~/talk

Lattice-based Zero-knowledge Proofs

links:none on file
slides:none on file

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

  1. 0:00Start
  2. 0:11Zero Knowledge Proofs from Lattices
  3. 12:03Rejection Sampling
  4. 19:10Signature Schemes
  5. 31:03The Commitment Scheme
  6. 33:28Ite Commitment
  7. 36:02Prove a Linear Relation over Our Q
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.