370.pdf
eprint.iacr.org · 9,398 words · saved by 3 readers
N/A
Nova: Recursive Zero-Knowledge Arguments from Folding Schemes Abhiram Kothapalli† Srinath Setty⋆ Ioanna Tzialla‡ † ⋆ ‡ Carnegie Mellon University Microsoft Research New York University Abstract. We introduce a new approach to realize incrementally ver- ifiable computation (IVC), in which the prover recursively proves the correct execution of incremental computations of the form y = F (ℓ) (x), where F is a (potentially…
saved by
related reading
- Collaborative zkSNARKseprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org
- The Spartan zkSNARK framework - Alin Tomescualinush.github.io
- A Gentle Introduction to the MPC-in-the-Head Transformation - ZK/SEC Quarterlyblog.zksecurity.xyz
- Nova: Recursive Zero-Knowledge Arguments from Folding Schemes - Srinath Settyyoutube.com
- An incomplete guide to Folding: Nova, Sangria, SuperNova, HyperN… — Taiko Labstaiko.mirror.xyz
- Lecture 14: Zero knowledge proofsboazbarak.org
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org
- 1021.pdfeprint.iacr.org
- thesis.pdfaayushg.com
- 1482.pdfeprint.iacr.org