Thanks to Meta, Mastercard, NSERC and NSF for their support!
News: I co-organized, together with Douglas Stebila, the first occurrence of Ontario Crypto Day, held on June 6, 2024 at the University of Waterloo. The next event is scheduled to take place at the University of Toronto in December 2025.
Students:
Postdoc: Roman Langrehr
PhD: Vahid Reza Asadi (joint with Richard Cleve), Zehou (Tiger) Wu
Master's (current): Karaneh Keypoor, Anas Ibrahim, Pranshu Kumar (joint with Douglas Stebila)
Master's (graduated): Ali Ghadirli, Alice Murphy, Sara Sarfaraz, Daniel Santana (joint with Rafael Oliveira)
Computation on Encrypted Data CS 858 (Winter 2025, Winter 2023)
Foundations of Modern Cryptography CS 489/698 (Fall 2025, Fall 2023)
Privacy, Cryptography, Network and Data Security CS 489/698 (Winter 2024)
Introduction to the Theory of Computing CS 360 (Fall 2025, Winter 2023, Fall 2022)
Cryptography / Network Security CS 758 (Fall 2021)
Introduction to Cryptography (Fall 2020, Penn State University)
Eurocrypt 2026, Crypto 2026
Eurocrypt 2025, Asiacrypt 2025, ITC 2025
TCC 2024, Crypto 2024, SAC 2024
Asiacrypt 2023
Crypto 2022, Asiacrypt 2022 , ITC 2022
TCC 2021
TCC 2020, Eurocrypt 2020, ITC 2020.
Sanjam Garg; Mohammad Hajiabadi; Dimitris Kolonelos; Abhiram Kothapalli; Guru Vamsi Policharla
A Framework for Witness Encryption from Linearly Verifiable SNARKs and Applications
Crypto 2025 (Full Version )
Mohammad Hajiabadi; Roman Langrehr; Adam O’Neill; Mingyuan Wang
On the Black-Box Complexity of Private-Key Inner-Product Functional Encryption
TCC 2024 (Full Version)
Jesko Dujmovic; Mohammad Hajiabadi
Lower-Bounds on Public-Key Operations in PIR
Eurocrypt 2024 (Full Version)
Sanjam Garg; Mohammad Hajiabadi; Peihan Miao; Alice Murphy
Laconic Branching Programs from the Diffie-Hellman Assumption
PKC 2024 (Full Version)
Mohammad Hajiabadi; Mohammad Mahmoody; Wei Qi; Sara Sarfaraz
Lower Bounds on Assumptions Behind Registration-Based Encryption
TCC 2023
Mohammad Hajiabadi; Shahram Khazaei; Behzad Vahdani:
Randomness Recoverable Secret Sharing Schemes
ITC 2023 (Full Version). Accepted to Journal of Cryptology 2024.
Sanjam Garg; Mohammad Hajiabadi; Abhishek Jain; Zhengzhong Jin; Omkant Pandey; Sina Shiehian
Credibility in Private Set Membership
PKC 2023 (Full Version)
Divesh Aggarwal; Nico Döttling; Jesko Dujmovic; Mohammad Hajiabadi; Giulio Malavolta; Maciej Obremski
Algebraic Restriction Codes and their Applications. Accepted to Algorithmica 2023.
ITCS 2022 (Full version).
Melissa Chase; Sanjam Garg; Mohammad Hajiabadi; Jialin Li; Peihan Miao
Amortizing Rate-1 OT and Applications to PIR and PSI
TCC 2021 (Full version).
Navid Alamati; Pedro Branco; Nico Döttling; Sanjam Garg; Mohammad Hajiabadi; Sihang Pu
Laconic Private Set Intersection and Applications
TCC 2021 (Full version).
Sanjam Garg; Mohammad Hajiabadi; Giulio Malavolta; Rafail Ostrovsky
How to Build a Trapdoor Function from an Encryption Scheme
Asiacrypt 2021
Rohit Chatterjee; Sanjam Garg; Mohammad Hajiabadi; Dakshita Khurana; Xiao Liang; Giulio Malavolta; Omkant Pandey; Sina Shiehian
Compact Ring Signatures from Learning with Errors
Crypto 2021 (Full version).
Sanjam Garg; Mohammad Hajiabadi; Rafail Ostrovsky
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More
TCC 2020 (Full version).
Lower-Bounds on Public-Key Operations in PIR. Secure Computation Workshop, Simons Institute, Berkeley, August 2025.
Laconic MPC, PIR and Public-Key Operations. Invited Talk at TPLC: Theory and Practice of Laconic Cryptography Workshop, Eurocrypt 2025, Madrid, May 2025.
Laconic Function Evaluation for Branching Programs. Invited Talk at TPLC: Theory and Practice of Laconic Cryptography Workshop, Eurocrypt 2024, Zurich, May 2024.
Limits on the Power of Garbling Techniques for Public-Key Encryption. Workshop: Lowerbounds in Cryptography, Bertinoro, Italy (July 2019).
New Techniques for Trapdoor Functions and Applications. Bay Area Crypto Day (November 2018).
Trapdoor Functions from the Computational Diffie-Hellman Assumption. IST Austria (October 2018), DC Area Crypto Day (May 2018), Georgetown University (March 2018).
Can public-key encryption be based on one-way functions via non-blackbox garbling techniques? Bay Area Crypto Day (November 2017).
Limitations of Black-Box Constructions in Cryptography. Information Security Group, University College London (February 2017).
New constructions and applications of KDM-secure schemes. Microsoft Research, Redmond (August 2015).
How encryption with standard security copes under stronger forms of attack, with applications to computational soundness, Stanford Security Seminar and UCSD Theory Seminar (December 2013).
Cheriton School of Computer Science, University of Waterloo
200 University Avenue West, Waterloo, ON
Canada N2L 3G1
Office: DC 2629