286.pdf
eprint.iacr.org · 9,405 words · saved by 1 readers
N/A
Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge) Justin Holmgren∗ Alex Lombardi† Ron D. Rothblum‡ March 6, 2021 Abstract Shortly after the introduction of zero-knowledge proofs, Goldreich, Micali and Wigderson (CRYPTO ’86) demonstrated their wide applicability by constructing zero-knowledge proofs for the NP-complete problem of graph 3-coloring. A long-standing open question…
related reading
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 118.pdfeprint.iacr.org
- 370.pdfeprint.iacr.org
- Collaborative zkSNARKseprint.iacr.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- 1021.pdfeprint.iacr.org
- Succinct Non-Interactive Arguments (SNARGs) for NP65610.csail.mit.edu
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org
- WHIR: Reed–Solomon Proximity Testing with Super-Fast Verificationeprint.iacr.org
- 306.pdfeprint.iacr.org
- thesis.pdfaayushg.com