Welcome to the ZK Readings repository. This is a collection of resources related to Zero Knowledge proofs, cryptography, and privacy-preserving technologies.
This repository serves as a curated list of readings and materials related to Zero Knowledge proofs (ZK). It is intended to help individuals interested in ZK learn more about this fascinating field and stay updated with the latest research and developments.
| Structure | Title | Author |
|---|---|---|
| Introduction and History of ZKP | Knowledge Complexity of Interactive Proof Systems | Anca Nitulescu |
| Introduction and History of ZKP | How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design | Oded Goldreich, Silvio Micali, Avi Wigderson |
| Introduction and History of ZKP | How To Prove Yourself: Practical Solutions to Identification and Signature Problems | Anca Nitulescu |
| Introduction and History of ZKP | On Defining Proofs of Knowledge | Mihir Bellare, Oded Goldreich |
| Introduction and History of ZKP | zk-SNARKs: A Gentle Introduction | Anca Nitulescu |
| Polynomial IOPs | Verifiable computation using multiple provers | Andrew J. Blumberg, Justin Thaler, Victor Vu, Michael Walfish |
| Polynomial IOPs | Interactive Proofs and the Sum-Check Protocol | Sanjeev Arora and Boaz Barak |
| Polynomial IOPs | Spartan: Efficient and general-purpose zkSNARKs without trusted setup | Srinath Setty |
| Polynomial IOPs | Hyrax Doubly-efficient zkSNARKs without trusted setup | Riad S. Wahby, Ioanna Tzialla, abhi shelat, Justin Thaler, and Michael Walfish |
| Polynomial IOPs | Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation | Tiancheng Xie, Jiaheng Zhang, Yupeng Zhang, Charalampos Papamanthou,Dawn Song |
| Polynomial IOPs | Constant-Size Commitments to Polynomials and Their Applications | Aniket Kate , Gregory M. Zaverucha , and Ian Goldberg |
| Polynomial IOPs | Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments | Jonathan Lee |
| Polynomial IOPs | PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge | Ariel Gabizon, Aztec, Zachary J. Williamson, Oana Ciobotaru |
| Polynomial IOPs | HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates | Binyi Chen - Espresso Systems, Benedikt Bünz - Espresso Systems - Stanford University, Dan Boneh - Stanford University, Zhenfei Zhang - Espresso Systems |
| Polynomial IOPs | A Zero-Knowledge Version of vSQL | Yupeng Zhang, Daniel Genkin, Jonathan Katz, Dimitrios Papadopoulos, and Charalampos Papamanthou |
| Polynomial IOPs | Bulletproofs: Short Proofs for Confidential Transactions and More | Benedikt B¨unz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Greg Maxwell |
| Polynomial IOPs | Ligero: Lightweight Sublinear Arguments Without a Trusted Setup | Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam |
| Polynomial IOPs | Orion: Zero Knowledge Proof with Linear Prover Time | Tiancheng Xie, Yupeng Zhang, Dawn Song |
| Polynomial IOPs | Brakedown: Linear-time and post-quantum SNARKs for R1CS | Alexander Golovnev, Jonathan Lee, Srinath Setty, Justin Thaler, Riad S. Wahby |
| Polynomial Commitments | FRI Paper | Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev |
| Polynomial Commitments | Best Existing Soundness Analysis of FRI | Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty |
| Polynomial Commitments | Polynomial Commitments from FRI | Alexander Vlasov and Konstantin Panarin |
| Polynomial Commitments | Round-by-round Soundness, Fiat-Shamir, and Sum-check | Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblumk |
| Linear PCP | Pinocchio | Bryan Parno, Jon Howell, Craig Gentry, Mariana Raykova |
| Linear PCP | Succinct Non-Interactive Arguments via Linear Interactive Proofs | Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, and Omer Paneth |
| Linear PCP | Groth16 | Jens Groth |
| Recursive SNARKs | Incrementally Verifiable Computation via Incremental PCPs | Moni Naor, Omer Paneth, and Guy N. Rothblum |
| Recursive SNARKs | Scalable Zero Knowledge via Cycles of Elliptic Curves | Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza |
| Recursive SNARKs | Nova: Recursive Zero-Knowledge Argumentsfrom Folding Schemes | Abhiram Kothapalli, Srinath Setty, Ioanna Tzialla |
| Recursive SNARKs | Proof-Carrying Data without Succinct Arguments | Benedikt Bunz, Alessandro Chiesa, William Lin, Pratyush Mishra, Nicholas Spooner |
| Recursive SNARKs | Folding Schemes with Selective Verification | Carla Ràfols and Alexandros Zacharakis |
| Title | Link | Author |
|---|---|---|
| Using ZK Proofs to Fight Disinformation | Medium | Dan Boneh |
| Zero Knowledge Canon, part 1 & 2 | readmore | Elena BurgerBryan ChiangSonal ChokshiEddy LazzarinJustin ThalerAli Yahya |
| Feist-Khovratovich technique for computing KZG proofs fast | https://alinush.github.io/2021/06/17/Feist-Khovratovich-technique-for-computing-KZG-proofs-fast.html | Alin Tomescu |
| Recursive STARKs | https://medium.com/starkware/recursive-starks-78f8dd401025 | StarkWare |
This repository is licensed under the MIT License. Feel free to use, share, and modify the content in accordance with the license terms.
Enjoy your exploration of Zero Knowledge proofs and the world of cryptography!