Survey-SNARKs.pdf
di.ens.fr · 9,482 words · saved by 1 readers
N/A
zk-SNARKs: A Gentle Introduction Anca Nitulescu Abstract Zero-Knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs) are non-interactive systems with short proofs (i.e., independent of the size of the witness) that enable verifying NP computa- tions with substantially lower complexity than that required for classical NP verification. This is a short, gentle introduction to zk-SNARKs. It recalls some important advancements in the history of proof systems in…
related reading
- Collaborative zkSNARKseprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 370.pdfeprint.iacr.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- Collaborative zkSNARKsusenix.org
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org
- Why and How zk-SNARK Works 1: Introduction & the Medium of a Proof | by Maksym | Mediummedium.com
- A Succinct Story of Zero Knowledgenibnalin.me
- A zkSNARK Syllabusbrianczhang.com
- STARK-paper.pdfstarkware.co
- Zero-knowledge proof - Wikipediaen.wikipedia.org