Foundational¶
Description¶
Marks entries that represent foundational, landmark, or must-know concepts and systems in the ZKP space. Good starting points for newcomers.
Entries tagged¶
- Algebraic Methods for Interactive Proof Systems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir)
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991)
- Non-Interactive Zero-Knowledge and Its Applications
- Non-Interactive Zero-Knowledge and Its Applications (BFM88)
- On Sigma Protocols (Damgård)
- On the Size of Pairing-Based Non-interactive Arguments (Groth16)
- On Σ-protocols
- Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013)
- Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997)
- Proofs, Arguments, and Zero-Knowledge
- Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013)
- Schwartz-Zippel Lemma
- Sumcheck Protocol
- The Knowledge Complexity of Interactive Proof Systems
- The Knowledge Complexity of Interactive Proof Systems (GMR85)
- Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018)