Lattice-based Zero-knowledge Proofs
summary
A practical toolbox for lattice-based zero-knowledge condenses range proofs, commitments and algebraic tricks to get from megabyte-scale proofs down to 10–20 kilobytes; constructions use module LWE, Ajtai-style commitments / BDLOP composition, rejection sampling and an embedding that makes ZQ statements the constant coefficient of RQ products. Parameters target q ≈ 2^16–2^32 and d = 64 or 128. Implementations show efficient proofs of small-norm witnesses, correct encryption and batchable statements; quadratic relations and exact norms are handled via JL-style reductions.
AI-written summary · about
chapters (7)
- 0:00Start
- 0:11Zero Knowledge Proofs from Lattices
- 12:03Rejection Sampling
- 19:10Signature Schemes
- 31:03The Commitment Scheme
- 33:28Ite Commitment
- 36:02Prove a Linear Relation over Our Q
related talks
49mLattice-Based Zero Knowledge and Applications
33mAn Introduction to Zero Knowledge Proofs
01h 09mProofs - Practice 1
01h 13mA Zero-Knowledge PCP Theorem
38mNew Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, ...
33mA New Approach for Non-Interactive Zero-Knowledge from Learning with Errors
53mProofs Without Evidence: Assurance on the Blockchain and Other Applications
01h 03mLinear-Time Zero-Knowledge Arguments with Logarithmic Proof-Size
