Payman Mohassel Email : pmohassel at ucdavis dot edu. Phone : (530) 752 8819. 2235 Kemper Hall Department of Computer Science University of California, Davis Davis, CA 95616 About Me | Research | CV

About Me I am a Ph.D. student in the Department of Computer Science at the University of California, Davis since Fall 2004. My research area is in information security with the main focus on cryptographic protocols. I am also interested in algorithms and their applications. My advisor is Matt Franklin. Currently, I am a participant in the SECuRIT program and interning at SUN's security group. Before that, I interned at Google during Summer 2007, and spent Fall 2006 at UCLA as part of IPAM's Securing Cyberspace program.

Research

with Enav Weinreb. Efficient Secure Linear Algebra In Presence of Covert or Computationally Unbounded Adversaries. [Proceedings PDF] Advances in Cryptology, Crypto 2008 .

with Vipul Goyal and Adam Smith. Secure Two-party and Multi-party Computation against Covert Adversaries. [Proceedings PDF][Talk PPT \PDF] Advances in Cryptology, Eurocrypt 2008 .

with Mark Gondree and Matthew Franklin. Multiparty Indirect Indexing and Applications. [ Full Version PDF] Advances in Cryptology, Asiacrypt 2007 .

with Nenad Dedic . Constant-Round Private Database Queries . [ PDF ][Talk PPT] International Colloquium on Automata, Languages and Programming, ICALP 2007 .

with Eike Kiltz and Enav Weinreb and Matthew Franklin. Secure Linear Algebra Using Linearly Recurrent Sequences. [ PDF] Theory of Cryptography Conference, TCC 2007 .

with Matthew Franklin and Mark Gondree. Improved Efficiency for Private Stable Matching. [ Full Version][Talk PPT] RSA Conference, Cryptographer's Track, CT-RSA 2007 .

with Matthew Franklin. Efficiency Tradeoffs for Malicious Two-Party Computation. [ PDF \ PS ][Talk PDF] Public Key Cryptography Conference PKC 2006 .

with Matthew Franklin . Efficient Polynomial Operations in the Shared-Coefficients Setting. [PDF \ PS ][Talk PDF] Public Key Cryptography Conference, PKC 2006 .

with Gergei Bana and Till Stegers . Computational Soundness of Formal Indistinguishability and Static Equivalence. [Full Version PDF] 11th Annual Asian Computing Conference, ASIAN 2006 .