payman's picture


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][CV] [Publications] [Google Scholar] [Activities] [Teaching] [Students/Visitors] [Prospective Students]



What's New

Slides and videos of the presentations/discussions for the Workshop on Applied Multi-Party Computation are now available on the website!
with Arash Afshar, Benny Pinkas, and Ben Riva
Non-Interactive Secure Computation Based on Cut-and-Choose.
To appear in EUROCRYPT 2014.
with Seny Kamara, Mariana Raykova, and Saeed Sadeghian
Scaling Private Set Intersection to Billion-Element Sets.[tech report]
To Appear in FC 2014.

with Dana Dachman-Soled and George Fuchsbauer and Adam O'Neill
Enhance Chosen-Ciphertext Security and Applications. [eprint archive]
To Appear in PKC 2014.

About Me
I am an assistant professor in the Department of Computer Science at University of Calgary. My research interests are in information security, cryptography, and privacy enhancing technologies. 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
Foundations of Modern Cryptography (CPSC 601.48) : Winter 2010, Winter 2011, Fall 2011, Winter 2013
Networked Systems Security (CPSC 626/526) :Winter 2010, Winter 2011, Winter 2012, Winer 2013
Explorations in Information Security (CPSC 329) : Winter 2011, Winter 2012
Introduction to Computer Science for Majors II (CPSC 233): Fall 2012, Fall 2013


Students/Visitors
Students
Arash Afshar, PhD. (July. 2013 - present)
Ostap Orobets, MSc. (Jan. 2013 - present)
Negin Karimian, MSc. (Sept 2012 - present)
Saeed Sadeghian, Ph.D. (Sept 2011 - present)
Akshaya Mani, BSc. (May. 2013 - August 2013)
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.

Visitors
Seny Kamara (March 2012, 1 wk)
Salman Niksefat , visiting PhD (April 2011 - Dec. 2011)
Research: Privacy-preserving computation for pattern matching, IDS and more.
Adam O'Neill ( July 2010, 1wk)


Activities
Co-Organizer:
WAMPC, 2014
ACNS, 2013
Program Committees: (submit good papers!)
CRYPTO, 2014
EUROCRYPT, 2014
ICICS, 2013
INSCRYPT, 2012
INDOCRYPT, 2011
ASIACRYPT, 2011
ASIACRYPT, 2010
ACM WPES, 2010

Recent and Upcoming Talks:
CRYPTO 2013. Garbled Circuits Checking Garbled Circuits. (Talk PPT). Santa Barbara, August 2013
Cryptography Group, Aarhus University. Private Function Evaluation. (Talk PPT). Aarhus, Denmark, June 2013
Cryptography Group, Bristol University. Private Function Evaluation. (Talk PPT). Bristol, UK, May, 2013
FC 2012. (Talk PPT). Bonaire, February, 2012
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


Publication List
The following is a chronological list of most of my publications. Presentation slides are made available in cases when I gave the talks. Also see my Google Scholar Profile.


with Arash Afshar, Benny Pinkas, and Ben Riva
Non-Interactive Secure Computation Based on Cut-and-Choose.
To appear in EUROCRYPT 2014.
with Seny Kamara, Mariana Raykova, and Saeed Sadeghian
Scaling Private Set Intersection to Billion-Element Sets.
To Appear in FC 2014. [tech report]

with Dana Dachman-Soled and George Fuchsbauer and Adam O'Neill
Enhance Chosen-Ciphertext Security and Applications.
To Appear in PKC 2014. [eprint archive]

with Ebrahim Tarameshloo and Philip W. L. Fong
On Protection in Federated Social Computing Systems.
To Appear in ACM CODASPY 2014.
with Ben Riva.
Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation.
In proceedings of CRYPTO 2013. [
eprint archive]
with Isheeta Nargis and Wayne Eberly.
Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority.
To Appear in AFRICACRYPT 2013.
with Saeed Sadeghian
How to Hide Circuits in MPC: An Efficient Framework for Private Function Evaluation.[
Full Version][Long Talk]
In Proceedings of Advances in Cryptology, EUROCRYPT 2013.
with Salman Niksefat, Babak Sadeghiyan, and Saeed Sadeghian
ZIDS: A Privacy-Preserving Intrusion Detection System Using Secure Two-Party Computation Protocols
The Computer Journal, 2013, doi: 10.1093/comjnl/bxt019. [PDF]
with Ozgur Dagdelen and Daniele Venturi
Rate-limited Secure Function Evaluation: Definitions and Constructions.
In Proceedings of Public-Key Cryptography Conference, PKC 2013. [
Full Version]
with Salman Niksefat and Babak Sadeghiyan
Oblivious Decision Program Evaluation.
In IET Information Security Journal, 2013, doi: 10.1049/iet-ifs.2012.0032. [PDF]
with Seny Kamara and Ben Riva
Salus: A System for Server-Aided Secure Function Evaluation. [Full Version]
ACM Computer and Communications Security Conference, ACM CCS 2012.
Efficient and Secure Delegation of Linear Algebra. [eprint archive]

with Salman Niksefat
Oblivious Decision Programs from Oblivious Transfer: Efficient Reductions. [Proceedings PDF][Talk PPT]
Financial Cryptography and Data Security, FC 2012.
with Salman Niksefat, Saeed Sadeghian, and Babak Sadeghiyan
An Efficient Protocol for Oblivious DFA Evaluation and Applications. [Eprint PDF][Talk video]
RSA Conference, The Cryptographer's Track, CT-RSA 2012.
with Seny Kamara, and Mariana Raykova
Outsourcing Multiparty Computation. eprint archive

Fast Computation On Encrypted Polynomials and Applications. [Proceedings PDF][Talk PPT]
International Conference on Cryptography and Network Security, CANS 2011 .
A Closer Look at Anonymity and Robustness in Encryption Schemes. [PDF][Talk PPT]
Advances in Cryptology, ASIACRYPT 2010 .

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

with Matthew Franklin
Secure and Efficient Evaluation of Multivariate Polynomials and Applications. [Proceedings PDF][Talk PPT]
Applied Cryptography and Network Security Conference, ACNS 2010 .
with Eike Kiltz and Adam O'Neill.
Adaptive Trapdoor Functions and Chosen Ciphertext Security. [Prceedings PDF]
Advances in Cryptology, EUROCRYPT 2010 .
with Mark Gondree.
Longest Common Subsequence as Private Search. [Full version PDF] [Talk PPT \PDF]
Workshop on Privacy in the Electronic Society, 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][Talk Video]
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. 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.