Tutorial on Proof Systems
summary
Survey of recent work on making non‑interactive succinct proofs practical: shows how PCP+Kilian-style compilers and the Fiat‑Shamir heuristic are turned into SNARGs by building correlation‑intractable hash families, introduces Batch‑NP and a somewhere statistical soundness notion that hides one statistically binding index in the CRS, and explains folding/recursion to compress T instances to polylog verification. Covers iO/Sahai‑Waters routes around the Gentry‑Wichs barrier and the Waters‑Wu bilinear exception; constructions work but current CRS and cryptographic tools remain large.
AI-written summary · about
chapters (11)
- 0:00Welcome and logistics
- 2:08Workshop introduction
- 3:14Cryptographic proofs overview
- 6:46Zero knowledge and connections
- 10:41SNARKs and standard assumptions
- 14:09The recipe for SNARKs
- 23:04Batch NP and statistical soundness
- 32:17Completeness for P
- 39:18Interactive proofs and folding
- 52:34Efficiency and alternative methods
- 55:45SNARKs for NP and open problems
related talks
01h 15mProofs - Theory
01h 15mTo interact or not to interact: Cryptographic proof systems and the Fiat-Shamir heuristic
01h 09mProofs - Practice 1
01h 12mAn Introduction to Commitment-Based Succinct Arguments
52mFaster, Smaller, Weaker, Darker
01h 02mIncremental proof systems
53mA Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for NP
24mA Framework for Post-Quantum Succinct Arguments
