Quantum Cryptography
Quantum information changes both the assumptions cryptography needs and the security guarantees it can provide.
For an accessible introduction, see this Quanta article or my recorded talks and tutorials.
Foundations and assumptions
What assumptions does cryptography need in a quantum world? Quantum notions of one-wayness and assumptions connected to quantum advantage can support commitments and secure computation.
- with Aditya Gulati and Kabir Tomer(Preprint, 2026)
- with Aditya Gulati and Kabir Tomer(Preprint, 2026)
- with Kabir Tomer(STOC 2025, QIP 2025, Invited to the SICOMP Special Issue for STOC 2025)
- with Kabir Tomer(STOC 2024, QIP 2024)
Certified deletion and unclonability
Can we certify that sensitive information has been deleted? Quantum information enables deletion guarantees for encryption and software, including publicly verifiable deletion, as well as proofs that cannot be copied.
- with James Bartusek, Fuyuki Kitagawa, Giulio Malavolta, Ryo Nishimaki, Alexander Poremba, Michael Walter and Takashi Yamakawa(Journal of Cryptology 2026)
Merged journal version of two TCC 2023 papers, including Weakening Assumptions for Publicly-Verifiable Deletion. - with James Bartusek, Vipul Goyal, Giulio Malavolta, Justin Raizes and Bhaskar Roberts(EUROCRYPT 2024, preliminary version at QIP 2023)
- with James Bartusek.(CRYPTO 2023, QIP 2023)
Verification and certified randomness
How can a classical verifier check quantum behavior or certify randomness? Results include verification that preserves a quantum witness and unconditional certified randomness in the quantum random oracle model against adversaries making subexponentially many queries.
- with Andrea Coladangelo, Saachi Mutreja, Bhaskar Roberts, Joseph Slote and Avishay Tal(Preprint, 2026)
- with Bhaskar Roberts, Avishay Tal(FOCS 2026)
- with Yael Kalai and Justin Raizes(Preprint, 2026)
Secure quantum computation
How can mutually distrustful parties compute together while protecting their private inputs? Quantum-hard one-way functions suffice for general secure computation, while post-quantum hardness of LWE lets a classical client privately and securely use an untrusted quantum server as a virtual quantum computer.
- with Yael Tauman Kalai and Justin Raizes(Preprint, 2026)
- with Andrea Coladangelo, Ruta Jawale, Giulio Malavolta and Hendrik Waldner(Quantum 2026) · Journal version
- with James Bartusek and Akshayaram Srinivasan.(CRYPTO 2023, QCRYPT 2023)
- with James Bartusek, Andrea Coladangelo and Fermi Ma.(CRYPTO 2021. QIP 2021 - Long Plenary Talk, QCrypt 2021 - Invited Talk, both joint with GLSV)