Publications
2026
Crypto 2026 · QCrypt 2025 Oral Presentation
Crypto 2026 · QCrypt 2026 Oral Presentation
Crypto 2026 · QIP 2025 Oral Presentation · QCrypt 2025 Oral Presentation
Crypto 2026 · QIP 2025 Oral Presentation · QCrypt 2026 Oral Presentation
Eurocrypt 2026
Eurocrypt 2026
Eurocrypt 2026
2025
Asiscrypt 2025
IACR Communications in Cryptology 2025
Eurocrypt 2025 · QCrypt 2024 Oral Presentation
2024
TCC 2024 · TQC 2024 Oral Presentation
TCC 2024 · TQC 2025 Oral Presentation · QCrypt 2025 Oral Presentation
TCC 2024
TCC 2024 · QCrypt 2023 · IEEE Trans. on Information Theory
Asiacrypt 2024
SCN 2024 · IACR Journal of Cryptology 2025
Eurocrypt 2024
2023
Crypto 2023 · QCrypt 2023
Crypto 2023
TQC 2023 proceedings
ITC 2023
2022
Eurocrypt 2022
Eurocrypt 2022
2021
Crypto 2021
Eurocrypt 2021
Eurocrypt 2021
Eurocrypt 2021
Eurocrypt 2021
2020
FOCS 2020
Conference version merged with this paper
The Round Complexity of Secure Computation Against Covert Adversaries
SCN 2020
Merged with the Crypto 2020 paper above
ACCO: Algebraic Computation with COmparison
Crypto 2020 Privacy Preserving Machine Learning Workshop
Eurocrypt 2020
2019
Interactive Non-Malleable Codes
TCC 2019
Eurocrypt 2019
2018
STOC 2018
Eurocrypt 2018
2017
Hierarchical Functional Encryption
ITCS 2017
Crypto ePrint Archive
2016
Breaking the Three Round Barrier for Non-Malleable Commitments
FOCS 2016
STOC 2016
STOC 2016
See a follow up by Chattopadhyay-Zuckerman and comments by Oded Goldreich
Asiacrypt 2016
Asiacrypt 2016
ICALP 2016
2015
ACM CCS 2015
2014
FOCS 2014 · Appeared in SICOMP (vol. 50, Issue 5) 2021
STOC 2014
Eurocrypt 2014
Merged with this paper by S. Dov Gordon, Jonathan Katz, Feng-Hao Liu, Elaine Shi, and, Hong-Sheng Zhou
Achieving privacy in verifiable computation with multiple servers - without FHE and without pre-processing
PKC 2014
2013
Crypto 2013 · Invited to Journal of Cryptology
2012
Eurocrypt 2012
On Black-Box Reductions between Predicate Encryption Schemes
TCC 2012
On-Line/Off-Line Leakage Resilient Secure Computation Protocols
Indocrypt 2012
2011 and earlier
Crypto 2011 · QIP 2011 (selected as one of 3 plenary papers out of 183 submissions) · Appeared in SICOMP (Vol. 43, Issue 1) 2014
See media review: Gilles Brassard, "Quantum information: The conundrum of secure positioning", Nature, 479, pages 307-308, 2011
See article in MIT Technology Review and Other media coverage
STOC 2011
(Improved 2015 SICOMP submission)
Slides + paper for ProvSec 2011 invited talk
(Abstract is here)
ASIACRYPT 2011
FOCS 2009
Invited to SICOMP FOCS 2009 special issue
EUROCRYPT 2009
(Proceedings version)
ACM CCS 2008
(full version; proc version here)
Eurocrypt 2008
(Proceedings Version)
Submission version with more proofs (but less polished with a lot more typos)
FOCS 2007
Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data Test of Time Award
ACM CCS 2006 · Winner of 2016 ACM CCS Test of Time Award
A new protocol to counter online dictionary attacks.
Computers & Security Journal