Bilinear Pairings-based Zero-Knowledge Proofs
summary
Chronicles the concrete moves that turn pairings into compact non‑interactive ZK: uses a double-homomorphic pairing encryption over composite-order groups to make multiplication checks cancel modulo subgroups, yielding perfect everlasting zero knowledge; moves to prime-order groups and a CRS to get practical proofs; introduces the knowledge-of-exponent assumption to achieve constant-size proofs with a large preprocessing CRS; and formalizes verification via quadratic arithmetic programs (QAPs). Constructions are implemented conceptually and scale down proof sizes from terabytes to kilobytes, enabling later SNARK deployments.
AI-written summary · about
chapters (16)
- 0:00Intro
- 0:33Recurring motifs
- 1:09Abiogenesis
- 1:37Cambrian explosion
- 2:51Biodiversity
- 4:03Devonian explosion
- 5:01Adaptive radiation?
- 8:23Exogenous genetic material
- 12:17Transformation
- 19:57Fitness
- 23:34Succinctness
- 31:08Intelligent design
- 32:13Arithmetic circuit satisfiability
- 34:15Phylogenetic web
- 36:02Sexual reproduction
- 39:39Adaptation
related talks
51mWhy you shouldn't trust me
44mZero-Knowledge Proofs: Simultaneously ensuring integrity and privacy
01h 03mProofs, Knowledge, and Computation
25mHigh-Speed zkSNARKs without Trusted Setup
59mCommit-and-Prove Zero-Knowledge Proof Systems and Extensions
51mDistributed Zero-Knowledge Proofs and Applications to Secure Computation
44mStandardizing Zero Knowledge Proofs - Keynote
48mzkSNARKs — Cryptographic Proofs for Scaling and Security Challenges