|
Search the dblp DataBase
Payman Mohassel:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Matthew K. Franklin, Mark Gondree, Payman Mohassel
Improved Efficiency for Private Stable Matching. [Citation Graph (0, 0)][DBLP] CT-RSA, 2007, pp:163-177 [Conf]
- Payman Mohassel, Matthew K. Franklin
Efficient Polynomial Operations in the Shared-Coefficients Setting. [Citation Graph (0, 0)][DBLP] Public Key Cryptography, 2006, pp:44-57 [Conf]
- Payman Mohassel, Matthew K. Franklin
Efficiency Tradeoffs for Malicious Two-Party Computation. [Citation Graph (0, 0)][DBLP] Public Key Cryptography, 2006, pp:458-473 [Conf]
- Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin
Secure Linear Algebra Using Linearly Recurrent Sequences. [Citation Graph (0, 0)][DBLP] TCC, 2007, pp:291-310 [Conf]
- Matthew K. Franklin, Mark Gondree, Payman Mohassel
Multi-party Indirect Indexing and Applications. [Citation Graph (0, 0)][DBLP] ASIACRYPT, 2007, pp:283-297 [Conf]
- Nenad Dedic, Payman Mohassel
Constant-Round Private Database Queries. [Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:255-266 [Conf]
Efficient and Secure Evaluation of Multivariate Polynomials and Applications. [Citation Graph (, )][DBLP]
Computational Soundness of Formal Indistinguishability and Static Equivalence. [Citation Graph (, )][DBLP]
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries. [Citation Graph (, )][DBLP]
Communication-Efficient Private Protocols for Longest Common Subsequence. [Citation Graph (, )][DBLP]
Efficient Two Party and Multi Party Computation Against Covert Adversaries. [Citation Graph (, )][DBLP]
Adaptive Trapdoor Functions and Chosen-Ciphertext Security. [Citation Graph (, )][DBLP]
Search in 0.031secs, Finished in 0.032secs
|