Practical, Efficient ZKPs, Economic and Social Processes
summary
Describes an efficient zero-knowledge toolkit that represents each secret x as a split-value representation u,v with x = u+v mod p (p ≤ 2^128) and posts commitments to u and v while revealing at most one coordinate, avoiding bit-decomposition. Shows constant-cost arithmetic checks (additions, multiplications, comparisons) over mod p with p≤2^128, updates and proofs over all intermediate values, and posts them to a public board. Demonstrates working systems: provably correct, privacy-preserving Vickrey auctions without collusion and an electronic voting scheme that keeps ballots secret while producing publicly verifiable outcomes.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 4:42String Matching History
- 6:31Historical Solution
- 8:15Fingerprinting
- 9:17Capillary
- 9:57Previous Results
- 10:39New Results
- 15:55Generalized Straight Line Computation
related talks
33mAn Introduction to Zero Knowledge Proofs
28mZero Knowledge Proofs and Their Future Applications
49mLattice-Based Zero Knowledge and Applications
23mZKBoo: Faster Zero-Knowledge for Boolean Circuits
01h 06mLattice-based Zero-knowledge Proofs
38mNew Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, ...
01h 13mA Zero-Knowledge PCP Theorem
01h 09mProofs - Practice 1