Research Overview
Here, you will find my research grouped by topic, with an overview and related papers for each area.
Current focus
Quantum Cryptography
Quantum information changes both the assumptions cryptography needs and the security guarantees it can provide.
Foundations and assumptions
Quantum information opens new routes to cryptography, drawing on quantum notions of one-wayness and the hardness underlying quantum advantage.
Certified deletion and unclonability
Quantum information can make deletion verifiable and enable proofs that cannot be copied.
Verification and certified randomness
Classical verification makes it possible to check quantum computations, preserve quantum witnesses, and certify randomness.
Secure quantum computation
Secure quantum protocols let parties compute on private data and allow classical clients to delegate quantum tasks to untrusted servers.
Cryptographic Proofs
Cryptographic proof systems offer ways to verify computations efficiently and establish claims without revealing private information.
Zero-knowledge and its foundations
Zero-knowledge proofs raise two foundational questions: which hardness assumptions they require, and when weak privacy guarantees can be strengthened.
Succinct proofs and delegation
Succinct proofs let a verifier check a long computation with a short proof and substantially less effort.
Earlier research
Non-Malleable Cryptography
Non-malleable commitments prevent an adversary from using an honest commitment to construct a meaningfully related one.
Round-Efficient Secure Computation
Round-efficient protocols reduce the back-and-forth interaction needed for secure computation, even when participants behave maliciously.
Information-Theoretic Cryptography
Information-theoretic cryptography seeks security guarantees that hold even against adversaries with unlimited computational power.
Program Obfuscation
Obfuscation can be used to construct a specific type of functional encryption, universal samplers, and key exchange.
Research Visits
Visiting Scientist at the Simons Institute for the Theory of Computing:
- Summer 2025
- Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation
- Summer 2022
- Summer Cluster: Lattices and Beyond
- Summer 2021
- Summer Cluster in Quantum Computation
Previously, Google Research Fellow at the Simons Institute for Lattices: Algorithms, Complexity, and Cryptography, Spring 2020.