Efficient Zero Knowledge Protocols: The Modular Approach
summary
Argues for separating an information-theoretic core from the cryptographic compilation layer so design and proofs stay exact and reusable, and claims this yields simpler analysis, broader reuse and concrete speedups. Shows how zero-knowledge PCP abstractions replace ad hoc NP reductions, how MPC-in-the-head yields practical ZK systems like zk‑boo and Leggero with ~sqrt circuit-size prover cost, and how linear PCPs and Merkle/homomorphic compilers give single- or few-query verification that compiles into succinct SNARK-style protocols.
AI-written summary · about
chapters (10)
- 0:00Start
- 1:05Broad Motivation
- 17:13ZKP for 3-Colorability
- 25:38Traditional PCPs
- 28:58Limitations
- 30:02Relaxing PCP model 1: Interaction Prover
- 32:03Advantages of Linear PCPs
- 32:42Crypto Compiler: First Attempt CRS
- 33:32Combining the Two Relaxations: Linear IOP Prover
- 34:07Conclusions
related talks
51mDistributed Zero-Knowledge Proofs and Applications to Secure Computation
53mFormal security analysis of MPC-in-the-headzero-knowledge protocols
51mWhy you shouldn't trust me
44mStandardizing Zero Knowledge Proofs - Keynote
54mVerification Dilemmas, Law, and the Promise of Zero-Knowledge Proofs
22mScalable Zero-Knowledge Protocols From Vector-OLE
32mSoK: Private Programmability on Blockchain Systems
30mPractical Zero Knowledge Proofs