Rinocchio: SNARKs for Ring Arithmetic
summary
Proposal adapts preprocessing SNARK machinery to computations over rings instead of fields by defining Quadratic Ring Programs and an evaluation strategy that uses an exceptional set of ring elements to recover soundness. It replaces field pairing and PDH assumptions with ring-friendly encodings and a modified PDH-like assumption plus extractable encodings, shows how Z2^k and certain composite rings instantiate the ideas, flags designated verifier encodings and no implementation yet, and outlines parallel repetition and cost tradeoffs versus field-based reductions.
AI-written summary · about
chapters (6)
- 0:00Start
- 2:14What Are Snarks
- 2:44Key Properties for Snarks
- 20:34The Quadratic Link Program
- 27:12Conclusions
- 33:08Strategies for Parallel Repetition
related talks
28mNotes from the SNARKonomicon: Techniques for Writing SNARK Programs
25mSonic: zkSNARKs from Linear Size Universal and Updatable SRS
44mBilinear Pairings-based Zero-Knowledge Proofs
26mzk-SHARKs: Combining Succinct Verification and Public Coin Setup
17mSNARK Flipper. FLIP & Prove multiple instances efficiently
34mSNARKs and their Practical Applications
08mShort Talk: Generalising secure compilation criteria
23mAurora: Transparent Sucinct Arguments for R1CS