| 2009 |
|---|
| 10 | EE | Matthew K. Franklin,
Mark Gondree,
Payman Mohassel:
Communication-Efficient Private Protocols for Longest Common Subsequence.
CT-RSA 2009: 265-278 |
| 2008 |
|---|
| 9 | EE | Payman Mohassel,
Enav Weinreb:
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries.
CRYPTO 2008: 481-496 |
| 8 | EE | Vipul Goyal,
Payman Mohassel,
Adam Smith:
Efficient Two Party and Multi Party Computation Against Covert Adversaries.
EUROCRYPT 2008: 289-306 |
| 2007 |
|---|
| 7 | EE | Matthew K. Franklin,
Mark Gondree,
Payman Mohassel:
Multi-party Indirect Indexing and Applications.
ASIACRYPT 2007: 283-297 |
| 6 | EE | Matthew K. Franklin,
Mark Gondree,
Payman Mohassel:
Improved Efficiency for Private Stable Matching.
CT-RSA 2007: 163-177 |
| 5 | EE | Nenad Dedic,
Payman Mohassel:
Constant-Round Private Database Queries.
ICALP 2007: 255-266 |
| 4 | EE | Eike Kiltz,
Payman Mohassel,
Enav Weinreb,
Matthew K. Franklin:
Secure Linear Algebra Using Linearly Recurrent Sequences.
TCC 2007: 291-310 |
| 2006 |
|---|
| 3 | EE | Gergei Bana,
Payman Mohassel,
Till Stegers:
Computational Soundness of Formal Indistinguishability and Static Equivalence.
ASIAN 2006: 182-196 |
| 2 | EE | Payman Mohassel,
Matthew K. Franklin:
Efficient Polynomial Operations in the Shared-Coefficients Setting.
Public Key Cryptography 2006: 44-57 |
| 1 | EE | Payman Mohassel,
Matthew K. Franklin:
Efficiency Tradeoffs for Malicious Two-Party Computation.
Public Key Cryptography 2006: 458-473 |
