Succinct Non-Interactive Arguments (SNARGs) for NP
65610.csail.mit.edu · 2,409 words · saved by 1 readers
N/A
Succinct Non-Interactive Arguments (SNARGs) for NP Notes by Yael Kalai MIT - 6.5610 Lecture 13 (March 18, 2024) Warning: This document is a rough draft, so it may contain bugs. Please feel free to email me with corrections. Outline • The Fiat-Shamir Paradigm • SNARGs for low-depth computations • Overcoming the low-depth restriction • Succinct hash with local opening Last class we presented the GKR protocol which is a doubly effi- cient interactive proof for bounded depth computations. Recall that the GKR protocol consists of a sequence of (pairs of)…
related reading
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 370.pdfeprint.iacr.org
- Collaborative zkSNARKseprint.iacr.org
- Survey-SNARKs.pdfdi.ens.fr
- 118.pdfeprint.iacr.org
- 0xPARC0xparc.org
- 286.pdfeprint.iacr.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- The GKR Protocol65610.csail.mit.edu
- thesis.pdfaayushg.com
- lec5.pdfcrypto.stanford.edu
- Spartaneprint.iacr.org