1021.pdf
eprint.iacr.org · 8,583 words · saved by 1 readers
N/A
Recursive Proof Composition without a Trusted Setup Sean Bowe1 , Jack Grigg1 , and Daira Hopwood1 1 Electric Coin Company {sean,jack,daira}@electriccoin.co https://electriccoin.co/ Abstract. Non-interactive arguments of knowledge are powerful cryp- tographic tools that can be used to demonstrate the faithful execution of arbitrary computations with publicly verifiable proofs. Increasingly efficient protocols have been…
related reading
- 370.pdfeprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Collaborative zkSNARKseprint.iacr.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org
- 1482.pdfeprint.iacr.org
- delegation.pdfpeople.csail.mit.edu
- A Succinct Story of Zero Knowledgenibnalin.me
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- 1022.pdfeprint.iacr.org
- Zero-Knowledge Proofs | MIT CSAIL Theory of Computationtoc.csail.mit.edu