ZKBoo: Faster Zero-Knowledge for Boolean Circuits
summary
Protocol claims a practical, non-interactive zero-knowledge for Boolean circuits using MPC-in-the-head and a new linear decomposition of the circuit; it's a three‑round Σ-protocol made non-interactive via Fiat–Shamir. Implementation proves SHA-1 preimage in ~13 ms (verification ~5 ms), with a 444 KB proof (SHA-256 ≈ double), outperforming Pinocchio proving time by ~1000× but with proof size linear in gates. Soundness is 2/3 per repetition (repeat to reach 2^-18). Code and benchmarks are on GitHub.
AI-written summary · about
chapters (9)
- 0:00Introduction to ZK protocols
- 2:22Comparing ZK approaches
- 4:20Zika-Boom overview
- 6:37Sigma protocol basics
- 9:30Circuit decomposition
- 12:52Construction of Zika-Boom
- 15:30Results and implementation
- 18:49Recap and future work
- 21:02Q&A session
related talks
33mAn Introduction to Zero Knowledge Proofs
28mZero Knowledge Proofs and Their Future Applications
26mPractical, Efficient ZKPs, Economic and Social Processes
01h 13mA Zero-Knowledge PCP Theorem
49mLattice-Based Zero Knowledge and Applications
01h 08mSecure Computation 1
01h 09mProofs - Practice 1
18mzkSaaS: Zero-Knowledge SNARKs as a Service