WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification
eprint.iacr.org · 9,504 words · saved by 1 readers
N/A
WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification Gal Arnon Alessandro Chiesa gal.arnon@weizmann.ac.il alessandro.chiesa@epfl.ch Weizmann Institute EPFL Giacomo Fenzi Eylon Yogev giacomo.fenzi@epfl.ch eylon.yogev@biu.ac.il EPFL Bar-Ilan University November 21, 2024…
saved by
related reading
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org
- The Spartan zkSNARK framework - Alin Tomescualinush.github.io
- Collaborative zkSNARKseprint.iacr.org
- 370.pdfeprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 1043.pdfeprint.iacr.org
- Zinc+: SNARKs for Polynomial Ringseprint.iacr.org
- A Time-Space Tradeoff for the Sumcheck Provereprint.iacr.org
- [2605.01192] Linear-Readout Floors and Threshold Recovery in Computation in Superpositionarxiv.org
- 552.pdfeprint.iacr.org
- VROOM: Accelerating (Almost All) Number-Theoretic Cryptography Using Vectorization and the Residue Number Systemeprint.iacr.org
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org