Payman Mohassel Assistant Professor Email : pmohasse at cpsc dot ucalgary dot ca Phone : (403) 210 6105 642 ICT Building Department of Computer Science University of Calgary Calgary, AB, Canada About Me | Publications | Activities | CV | Teaching | Graduate Students | Undergraduate Students

About Me I am an assistant professor in the computer science department at University of Calgary since July 2009. I recieved my Ph.D. in the computer science department at University of California Davis, in June 2009 under the supervision of Matthew Franklin. My research interests are in cryptography, information security and theoretical computer science. A few more recent projects are: 1- Efficient and Secure Multiparty Computation 2- Provably Secure Encryption and Signature Schemes 3- Privacy and Genomic Computation

Activities Program Committees: Asiacrypt 2010.

Publications

with Mark Gondree. Longest Common Subsequence as Private Search. [Full version PDF] [Talk PPT \PDF] ACM WPES 2009 .

with Matthew Franklin and Mark Gondree. Communication-Efficient Private Protocols for Longest Common Subsequence. [Full Version PDF] RSA Conference, Cryptographer's Track, CT-RSA 2009 .

with Enav Weinreb. Efficient Secure Linear Algebra In Presence of Covert or Computationally Unbounded Adversaries. [Proceedings PDF][Talk PPT] 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][TalkPDF] 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 .

Graduate Students I am looking for new graduate students with strong theoretical background to start in Fall 2010. Please take a look at my research interests, and publications to determine if your research experience and interests are related to mine. After doing so, feel free to contact me to learn more about my research, and to tell me more about yours. In general, if you are interested in working with me, you need to mention my name in your application form. Otherwise, it is likely that I won't see your application. You can find all the necessary infomration related to the admission process here.

Undergraduate Students University of Calgary undergraduate students who are interested in getting involved with research related to cryptography and/or information security are encouraged to contact me for more information. Also see here and here for detailed information on how to earn credit for doing undergraduate research.

Teaching

Winter 2010 : -Introduction to Computers for Non-Majors (CPSC 203) -Foundations of Modern Cryptography (CPSC 601.48)