P lonK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge[0.72cm]
eprint.iacr.org · 9,864 words · saved by 1 readers
N/A
PlonK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge Ariel Gabizon* Zachary J. Williamson Oana Ciobotaru Aztec Aztec Pi Squared July 17, 2025 Abstract zk-SNARK constructions that utilize an updatable universal structured reference string remove one of the main obstacles in deploying zk-SNARKs[GKM+ ]. The…
related reading
- Collaborative zkSNARKseprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 370.pdfeprint.iacr.org
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org
- 1482.pdfeprint.iacr.org
- 1022.pdfeprint.iacr.org
- Survey-SNARKs.pdfdi.ens.fr
- thesis.pdfaayushg.com
- Collaborative zkSNARKsusenix.org
- Zinc+: SNARKs for Polynomial Ringseprint.iacr.org