A Selection of Pairing Based zk-SNARKs
summary
Survey of pairing-based zk-SNARKs compares concrete schemes and tradeoffs: Groth16 gives the smallest constant-size proofs and fastest verification but needs a trusted setup; QAP compilation from 2013 enables that efficiency. Recursion uses MNT-style curves to embed pairings and enables recursive SNARKs with logarithmic-depth trees. Papers like Libra trade proof size for prover time; Aurora Light and universal schemes provide universal and updatable setup at cost of losing full succinctness or higher prover work.
AI-written summary · about
chapters (9)
- 0:00Intro
- 0:35What are zk-SNARKS?
- 2:40Types of Zero-Knowledge
- 5:45If all you need is Speed
- 7:11Best Used When
- 8:27If proofs should remain the same
- 9:43If you need Compression
- 12:03If you cannot do a Setup
- 15:49Summary
related talks
39mPrivacy and Evolution of SNARKs
36mPanel Discussion
18mSoK: Understanding zk-SNARKs: The Gap Between Research and Practice
56mCollaborative zk-SNARKs: Proving as One over Distributed Secrets
52mFaster, Smaller, Weaker, Darker
48mzkSNARKs — Cryptographic Proofs for Scaling and Security Challenges
31mSecure Distributed Storage
19mDIZK: A Distributed Zero Knowledge Proof System