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

Research/Publications

Activities

Teaching

Students

Prospective Students

I am actively seeking strong MSc. and Ph.D students who are interested in different aspects of cryptography and information security . A strong theoretical background is a big plus. See here for more information and contact me if you are interested.

About Me

I am an assistant professor in the Department of Computer Science at University of Calgary. I am also a member of the Institute for Security, Privacy and Information Security (ISPIA) at U of C. I received my Ph.D. from UC Davis, in 2009 under the supervision of Matthew Franklin. I have been a visiting researcher or an intern at a number of places such as Microsoft Research, Redmond (August 2011, October 2010), Sun Microsystems (Summer 2008), Google Inc. (Summer 2007), and UCLA's IPAM (Fall 2006).

Teaching

Winter 2012 : Networked Systems Security (CPSC 626/526) Explorations in Information Security (CPSC 329) Fall 2011 : Foundations of Modern Cryptography (CPSC 601.48) Winter 2011 : Foundations of Modern Cryptography (CPSC 601.48) Networked Systems Security (CPSC 626/526) Explorations in Information Security (CPSC 329) Winter 2010 : -Foundations of Modern Cryptography (CPSC 601.48) -Information and Network Security (CPSC 529)

Students

Current Saeed Sadeghian Ph.D. (Sept 2011 - present) Past Salman Niksefat , visiting Ph.D. (April 2011 - Dec. 2011) Research: Privacy-preserving computation for pattern matching, IDS and more. Greg Lewis , Undergrad (Jan. 2011 - Dec. 2011) Research: Fingerprinting attacks against anonymizing networks. Masoud Barati , MSc. (Sept. 2009 - Nov. 2011) Thesis: Learning Decision Trees Through Black-Box Queries.

Activities

Program Committees: (submit good papers!) INDOCRYPT, 2011 ASIACRYPT, 2011 ASIACRYPT, 2010 ACM WPES, 2010 Recent and Upcoming Talks: CANS 2011. (Talk PPT). Sanya, China, December 10-12, 2011 Cryptography Group, Microsoft Research. Oblivious Automata Evaluation and Its Applications. (Talk Video). Redmond, August 30, 2011 Asiacrypt, 2010. (Talk PPT). Singapore, Dec 5-9, 2010 Selected Areas of Cryptography. (Talk PDF). Waterloo, Canada, August 11-13, 2010 Applied Cryptography and Network Security Conference (Talk PPT). Beijing, China, June 22-25, 2010 Workshop on Computer Security and Cryptography (Talk PDF). Montreal, Canada, April 12-16, 2010 UofC Theory Seminar (Talk PDF). Calgary, Canada, Jan 22, 2010

Research

My research interests are in cryptography, information security and theoretical computer science. The following is a chronological list of most of my publications. Presentation slides are made available in cases when I gave the talks.

2012

Efficient and Secure Delegation of Linear Algebra. [eprint archive]

with Salman Niksefat Oblivious Decision Programs from Oblivious Transfer: Efficient Reductions. To Appear at Proceedings of FC 2012.

with Salman Niksefat, Saeed Sadeghian, and Babak Sadeghiyan An Efficient Protocol for Oblivious DFA Evaluation and Applications. [Eprint PDF] To Appear at Proceedings of CT-RSA 2012.

2011

with Seny Kamara, and Mariana Raykova Outsourcing Multiparty Computation. eprint archive

Fast Computation On Encrypted Polynomials and Applications. [Proceedings PDF][Talk PPT] In Proceedings of International Conference on Cryptography and Network Security, CANS 2011 .

with Mohammad Moshirpour and Behrouz Far Model Based Analysis of Internet Filtering Systems. To Appear at Proceedings of IEEE IRI 2011.

2010

A Closer Look at Anonymity and Robustness in Encryption Schemes. [PDF][Talk PPT] To Appear at Proceedings of ASIACRYPT 2010 .

One-time Signatures and Chameleon Hash Functions. [PDF][Talk PDF] In Proceedings of Selected Areas in Cryptography, SAC 2010 .

with Matthew Franklin Secure and Efficient Evaluation of Multivariate Polynomials and Applications. [Proceedings PDF][Talk PPT] In Proceedings of Applied Cryptography and Network Security Conference, ACNS 2010 .

with Eike Kiltz and Adam O'Neill. Adaptive Trapdoor Functions and Chosen Ciphertext Security. [Prceedings PDF] In Proceedings of Advances in Cryptology, EUROCRYPT 2010 .

2009

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 .

2008

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 .

2007

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 .

2006

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. In case of PhD students, I almost strictly require previous experience in cryptography, and an interest in both theoretical and practical aspects of the field. Please take a look at my research interests, and publications to determine if your research experience and interest has some overlap with mine. After doing so, feel free to contact me to. Make sure to include a CV, your TOEFL/IELTS score (for international students), and an unofficial copy of your transcripts. In general, if you are interested in working with me, you need to put my name in your application form. Otherwise, it is likely that I won't get to see your application. You can find all the necessary information 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.