Cryptographic Proofs

How can we prove a claim without revealing its secrets, or verify a computation without repeating it? These questions lead to zero-knowledge and succinct proofs, from their underlying assumptions to techniques that overcome black-box barriers.

Zero-knowledge and its foundations

What assumptions are necessary for zero-knowledge, and when can weak privacy guarantees be strengthened? Results connect non-trivial zero-knowledge to one-way functions and show how weak guarantees can be amplified.

Succinct proofs and delegation

How can a verifier check a long computation with much less work? Succinct proofs and delegation address this question, with tradeoffs in assumptions, efficiency, and interaction.