Scalable Zero-Knowledge Protocols From Vector-OLE

on YouTube ↗22m

" summary

Uses vector-OLE as the core primitive to get information‑theoretic homomorphic MACs that act as tiny interactive commitments, and builds a commit‑and‑prove protocol called mac and cheese for arithmetic circuits that runs in streaming with constant memory. Multiplication checks cost 1–3 field elements of communication and benchmarks show about a million multiplications per second. Protocols can Fiat‑Shamir to remove verifier rounds, support compact disjunctions whose cost is proportional to the longest branch (with logarithmic overhead via recursion), but remain designated‑verifier and non‑succinct.

AI-written summary · about

" chapters (7)

1. 0:00Introduction
2. 3:06VectorOLE
3. 7:46Mac and Cheese
4. 13:38Disjunctions
5. 14:55Main Observations
6. 18:29Performance
7. 19:59Summary

" related talks

• 35mEfficient Zero Knowledge Protocols: The Modular ApproachYuval Ishai · 2nd ZKProof Workshop 2019
• 44mBilinear Pairings-based Zero-Knowledge ProofsJens Groth · 2nd ZKProof Workshop 2019
• 30mPractical Zero Knowledge ProofsRemi Gai, Kautuk Kundan, Danilo Kim · Pragma India 2023
• 52mDiscrete Log based Zero-Knowledge ProofsDan Boneh · 2nd ZKProof Workshop 2019
• 44mIOP based Zero-Knowledge ProofsAlessandro Chiesa · 2nd ZKProof Workshop 2019
• 41mGKR based Zero-Knowledge ProofsYael Tauman Kalai · 2nd ZKProof Workshop 2019
• 26mApplications of Zero Knowledge Proofs in the Banking IndustryEduardo Moraes · 2nd ZKProof Workshop 2019
• 51mWhy you shouldn't trust meKeerthana Ganesh, Shubham Patil · NDC Oslo 2022