Spartan
eprint.iacr.org · 9,013 words · saved by 1 readers
N/A
Spartan: Efficient and general-purpose zkSNARKs without trusted setup Srinath Setty Microsoft Research Abstract This paper introduces Spartan, a new family of zero-knowledge succinct non- interactive arguments of knowledge (zkSNARKs) for the rank-1 constraint satisfiabil- ity (R1CS), an NP-complete language that generalizes arithmetic circuit satisfiability. A distinctive feature of Spartan is that it offers the first zkSNARKs without trusted setup (i.e.,…
related reading
- The Spartan zkSNARK framework - Alin Tomescualinush.github.io
- 370.pdfeprint.iacr.org
- Collaborative zkSNARKseprint.iacr.org
- 552.pdfeprint.iacr.org
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Survey-SNARKs.pdfdi.ens.fr
- STARK-paper.pdfstarkware.co
- Hardware Acceleration for Zero Knowledge Proofs - Paradigmparadigm.xyz
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org
- 1043.pdfeprint.iacr.org
- Collaborative zkSNARKsusenix.org