Cryptographic Proofs

How can we prove a claim without revealing its secrets, or verify a computation without repeating it? My work studies the assumptions and techniques behind zero-knowledge and succinct proofs, including weak forms of zero-knowledge and methods that go beyond black-box barriers.

Zero-knowledge and its foundations

Recent work studies when weak zero-knowledge can be amplified and what computational assumptions non-trivial zero-knowledge requires.

Non-Trivial Zero-Knowledge Implies One-Way Functions
with Suvradip Chakraborty, James Hulett and Kabir Tomer
(CRYPTO 2026)
On Weak NIZKs, One-way functions and Amplification
with Suvradip Chakraborty and James Hulett
(CRYPTO 2025)
Weak Zero-Knowledge via the Goldreich-Levin Theorem
with Giulio Malavolta and Kabir Tomer.
(ASIACRYPT 2023)

Succinct proofs and delegation

These papers study how a verifier can check a long computation with much less work, and the assumptions and limitations of such verification.

On Black-Box Verifiable Outsourcing
with Amit Agarwal, Navid Alamati, Srinivasan Raghuraman and Peter Rindal.
(TCC 2023)
SNARGs for P from Sub-exponential DDH and QR
with James Hulett, Ruta Jawale and Akshayaram Srinivasan.
(EUROCRYPT 2022)
SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE
with Ruta Jawale, Yael Kalai and Rachel Zhang.
(STOC 2021)
Merge of [JK20] and [KZ20].