Home > Resources
ZKP Resources¶
Curated external resources for Zero-Knowledge Proofs — 82 entries across papers, blogs, books, wikis, docs, and code repositories.
This file is auto-generated. Run devbox run summaries to update.
By Type¶
By Topic¶
applications¶
- Choosing a Cryptographic Library for Anonymous Credentials (eid-privacy, 2026) (blog, 2026)
- Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index (Wang et al. 2026) (paper, 2026)
- Device Binding for Anonymous Credentials on Legacy Phones (Lehmann, Zacharakis 2026) (paper, 2026)
- On the (Privacy) Harms of the European Digital Identity Framework (Knabenhans, Veitch, Raynal, Stadler, Chatel, Lueks, Troncoso 2026) (paper, 2026)
- Proof-of-Concept for ZKPs (eid-privacy, 2026) (blog, 2026)
- Comparing ZK Systems (eid-privacy, 2025) (blog, 2025)
- Crescent and Longfellow (eid-privacy, 2025) (blog, 2025)
- Device-Bound Anonymous Credentials With(out) Trusted Hardware (Friedrichs, Harding, Lehmann, Lysyanskaya 2025) (paper, 2025)
- Open Source SWIYU Demo application (eid-privacy, 2025) (blog, 2025)
- Overview of Privacy and Unlinkability (eid-privacy, 2025) (blog, 2025)
- Secure and Privacy-Preserving Credentials for E-ID Proof-of-Concept (Gasser, Humbert, Elghareeb 2025) (paper, 2025)
- Vision: A Modular Framework for Anonymous Credential Systems (Lehmann, Sidorenko, Zacharakis 2025) (paper, 2025)
- Anonymous Credentials from ECDSA (Frigo & shelat 2024) (paper, 2024)
- Crescent: Stronger Privacy for Existing Credentials (Paquin, Policharla, Zaverucha 2024) (paper, 2024)
- Microsoft Crescent Credentials (Spartan-t256 Fork) (code, 2023)
- ZKAttest: Ring and Group Signatures for Existing ECDSA Keys (paper, 2022)
arithmetization¶
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023) (paper, 2023)
- PLONKish Arithmetization (blog, 2022)
- PLONKish Arithmetization — ZK Jargon (doc, 2022)
- R1CS Explainer (0xPARC / Circom) (doc, 2022)
- Halo2 Documentation (Zcash) (doc, 2021)
- STARK 101 — AIR Tutorial (StarkWare) (doc, 2021)
- Plookup: A Simplified Polynomial Protocol for Lookup Tables (Gabizon-Williamson 2020) (paper, 2020)
- PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge (paper, 2019)
- TurboPLONK Proposal (ZKProof Workshop 3) (paper, 2019)
attestation¶
book¶
- Proofs, Arguments, and Zero-Knowledge (book, 2023)
circuit¶
- A Deep Dive into Axiom's Halo2 Circuits (blog, 2025)
- PLONKish Arithmetization (blog, 2022)
- PLONKish Arithmetization — ZK Jargon (doc, 2022)
- R1CS Explainer (0xPARC / Circom) (doc, 2022)
circuit-dsl¶
- Noir's Circuit Backend (blog, 2023)
- Noir Documentation (doc, 2022)
- noir-lang/noir — ACVM Repository (code, 2022)
- Circom2 Documentation (doc, 2021)
- Halo2 Documentation (Zcash) (doc, 2021)
- ZoKrates Documentation (doc, 2018)
commit-and-prove¶
- Vision: A Modular Framework for Anonymous Credential Systems (Lehmann, Sidorenko, Zacharakis 2025) (paper, 2025)
- LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) (paper, 2019)
commitment¶
- DockNetwork Crypto Library Analysis (doc, 2026)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
- Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) (paper, 2017)
- Short Group Signatures (Boneh, Boyen, Shacham 2004) (paper, 2004)
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991) (paper, 1991)
composition¶
- Vision: A Modular Framework for Anonymous Credential Systems (Lehmann, Sidorenko, Zacharakis 2025) (paper, 2025)
- LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) (paper, 2019)
cryptography¶
- Device Binding for Anonymous Credentials on Legacy Phones (Lehmann, Zacharakis 2026) (paper, 2026)
- Device-Bound Anonymous Credentials With(out) Trusted Hardware (Friedrichs, Harding, Lehmann, Lysyanskaya 2025) (paper, 2025)
- Taxonomy for Privacy-Preserving Electronic Identities (Gasser, Humbert, Elghareeb 2025) (paper, 2025)
- Cryptographic Principles (Alin Tomescu) (blog, 2021)
- Short Group Signatures (Boneh, Boyen, Shacham 2004) (paper, 2004)
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999) (paper, 1999)
- Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997) (paper, 1997)
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991) (paper, 1991)
discrete-log¶
- Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020) (paper, 2020)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999) (paper, 1999)
- Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997) (paper, 1997)
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991) (paper, 1991)
eid¶
- Choosing a Cryptographic Library for Anonymous Credentials (eid-privacy, 2026) (blog, 2026)
- Device Binding for Anonymous Credentials on Legacy Phones (Lehmann, Zacharakis 2026) (paper, 2026)
- DockNetwork Crypto Library Analysis (doc, 2026)
- On the (Privacy) Harms of the European Digital Identity Framework (Knabenhans, Veitch, Raynal, Stadler, Chatel, Lueks, Troncoso 2026) (paper, 2026)
- Proof-of-Concept for ZKPs (eid-privacy, 2026) (blog, 2026)
- Reading list for ZKP algorithms and implementations (eid-privacy, 2026) (blog, 2026)
- Comparing ZK Systems (eid-privacy, 2025) (blog, 2025)
- Crescent and Longfellow (eid-privacy, 2025) (blog, 2025)
- Device-Bound Anonymous Credentials With(out) Trusted Hardware (Friedrichs, Harding, Lehmann, Lysyanskaya 2025) (paper, 2025)
- Open Source SWIYU Demo application (eid-privacy, 2025) (blog, 2025)
- Overview of Privacy and Unlinkability (eid-privacy, 2025) (blog, 2025)
- Resources on Zero-knowledge Systems and Proofs (eid-privacy, 2025) (blog, 2025)
- Secure and Privacy-Preserving Credentials for E-ID Proof-of-Concept (Gasser, Humbert, Elghareeb 2025) (paper, 2025)
- Taxonomy 101 (eid-privacy, 2025) (blog, 2025)
- Taxonomy for Privacy-Preserving Electronic Identities (Gasser, Humbert, Elghareeb 2025) (paper, 2025)
- Taxonomy of digital identity systems (eid-privacy, 2025) (blog, 2025)
- Vision: A Modular Framework for Anonymous Credential Systems (Lehmann, Sidorenko, Zacharakis 2025) (paper, 2025)
- Anonymous Credentials from ECDSA (Frigo & shelat 2024) (paper, 2024)
- Crescent: Stronger Privacy for Existing Credentials (Paquin, Policharla, Zaverucha 2024) (paper, 2024)
- Microsoft Crescent Credentials (Spartan-t256 Fork) (code, 2023)
elliptic-curves¶
- Anonymous Credentials from ECDSA (Frigo & shelat 2024) (paper, 2024)
- Crescent: Stronger Privacy for Existing Credentials (Paquin, Policharla, Zaverucha 2024) (paper, 2024)
- Microsoft Crescent Credentials (Spartan-t256 Fork) (code, 2023)
- ZKAttest: Ring and Group Signatures for Existing ECDSA Keys (paper, 2022)
- Cryptographic Principles (Alin Tomescu) (blog, 2021)
explainer¶
- Choosing a Cryptographic Library for Anonymous Credentials (eid-privacy, 2026) (blog, 2026)
- A Deep Dive into Axiom's Halo2 Circuits (blog, 2025)
- Comparing ZK Systems (eid-privacy, 2025) (blog, 2025)
- Crescent and Longfellow (eid-privacy, 2025) (blog, 2025)
- Groth16 (Alin Tomescu) (blog, 2024)
- Noir's Circuit Backend (blog, 2023)
- PLONKish Arithmetization (blog, 2022)
- Note: PLONK / TurboPLONK / UltraPLONK Family (blog, 2021)
- Understanding PLONK (blog, 2019)
foundational¶
- Proofs, Arguments, and Zero-Knowledge (book, 2023)
- Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018) (paper, 2018)
- On the Size of Pairing-Based Non-interactive Arguments (Groth16) (paper, 2016)
- Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013) (paper, 2013)
- Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013) (paper, 2012)
- On Sigma Protocols (Damgård) (paper, 2004)
- Short Group Signatures (Boneh, Boyen, Shacham 2004) (paper, 2004)
- Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997) (paper, 1997)
- Algebraic Methods for Interactive Proof Systems (paper, 1992)
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991) (paper, 1991)
- Non-Interactive Zero-Knowledge and Its Applications (BFM88) (paper, 1988)
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir) (paper, 1986)
- The Knowledge Complexity of Interactive Proof Systems (GMR85) (paper, 1985)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities (paper, 1980)
go¶
- gnark Documentation (Consensys) (doc, 2021)
history¶
- The Evolution of Zero Knowledge Proofs (blog, 2018)
implementations¶
- DockNetwork Crypto Library Analysis (doc, 2026)
- A Deep Dive into Axiom's Halo2 Circuits (blog, 2025)
- Comparative Analysis of SP1 and RISC Zero Zero-Knowledge Virtual Machines (blog, 2024)
- Ligetron Marketplace Documentation (doc, 2024)
- OpenVM Documentation (doc, 2024)
- SP1 Documentation (Succinct Labs) (doc, 2024)
- AztecProtocol: Aztec Packages (UltraHONK Audit Scope) (code, 2023)
- RISC Zero Documentation (doc, 2023)
- Microsoft Spartan2 (code, 2022)
- Noir Documentation (doc, 2022)
- noir-lang/noir — ACVM Repository (code, 2022)
- Circom2 Documentation (doc, 2021)
- gnark Documentation (Consensys) (doc, 2021)
- Halo2 Documentation (Zcash) (doc, 2021)
- Microsoft Spartan — Commit History (code, 2020)
- Microsoft Spartan (Original) (code, 2020)
- Sonic Reference Implementation (ebfull/sonic) (code, 2019)
- ZoKrates Documentation (doc, 2018)
information-theoretic¶
interactive-proof¶
- On Sigma Protocols (Damgård) (paper, 2004)
- Algebraic Methods for Interactive Proof Systems (paper, 1992)
- The Knowledge Complexity of Interactive Proof Systems (GMR85) (paper, 1985)
iop¶
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (paper, 2022)
- Ligero++: A New Optimized Sublinear IOP (Bhadauria et al. 2020) (paper, 2020)
- Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) (paper, 2019)
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup (Setty 2020) (paper, 2019)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) (paper, 2018)
- Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) (paper, 2017)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (Ames et al. 2017) (paper, 2017)
learning¶
- Reading list for ZKP algorithms and implementations (eid-privacy, 2026) (blog, 2026)
- Resources on Zero-knowledge Systems and Proofs (eid-privacy, 2025) (blog, 2025)
- Proofs, Arguments, and Zero-Knowledge (book, 2023)
- R1CS Explainer (0xPARC / Circom) (doc, 2022)
- STARK 101 — AIR Tutorial (StarkWare) (doc, 2021)
- The Evolution of Zero Knowledge Proofs (blog, 2018)
library¶
- Choosing a Cryptographic Library for Anonymous Credentials (eid-privacy, 2026) (blog, 2026)
- DockNetwork Crypto Library Analysis (doc, 2026)
- Microsoft Spartan2 (code, 2022)
- gnark Documentation (Consensys) (doc, 2021)
- Microsoft Spartan — Commit History (code, 2020)
- Microsoft Spartan (Original) (code, 2020)
- Sonic Reference Implementation (ebfull/sonic) (code, 2019)
linear-time-prover¶
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023) (paper, 2023)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (paper, 2022)
- Ligero++: A New Optimized Sublinear IOP (Bhadauria et al. 2020) (paper, 2020)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (Ames et al. 2017) (paper, 2017)
- Scalable Secure Multiparty Computation (Damgård-Ishai 2006) (paper, 2006)
llvm¶
- OpenVM Documentation (doc, 2024)
- SP1 Documentation (Succinct Labs) (doc, 2024)
- RISC Zero Documentation (doc, 2023)
logarithmic¶
- Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020) (paper, 2020)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
lookup¶
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023) (paper, 2023)
- Plookup: A Simplified Polynomial Protocol for Lookup Tables (Gabizon-Williamson 2020) (paper, 2020)
mathematics¶
- Algebraic Methods for Interactive Proof Systems (paper, 1992)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities (paper, 1980)
mpc¶
non-interactive¶
- Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index (Wang et al. 2026) (paper, 2026)
- ZKProof Sigma Protocol Proposal (Workshop 4) (paper, 2021)
- Non-Interactive Zero-Knowledge and Its Applications (BFM88) (paper, 1988)
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir) (paper, 1986)
overview¶
- Proof-of-Concept for ZKPs (eid-privacy, 2026) (blog, 2026)
- Reading list for ZKP algorithms and implementations (eid-privacy, 2026) (blog, 2026)
- Comparing ZK Systems (eid-privacy, 2025) (blog, 2025)
- Crescent and Longfellow (eid-privacy, 2025) (blog, 2025)
- Overview of Privacy and Unlinkability (eid-privacy, 2025) (blog, 2025)
- Resources on Zero-knowledge Systems and Proofs (eid-privacy, 2025) (blog, 2025)
- Taxonomy 101 (eid-privacy, 2025) (blog, 2025)
- Taxonomy for Privacy-Preserving Electronic Identities (Gasser, Humbert, Elghareeb 2025) (paper, 2025)
- Taxonomy of digital identity systems (eid-privacy, 2025) (blog, 2025)
- Comparative Analysis of SP1 and RISC Zero Zero-Knowledge Virtual Machines (blog, 2024)
- ZKProof Wiki of Concrete ZKP Schemes (wiki, 2020)
- The Evolution of Zero Knowledge Proofs (blog, 2018)
pairing¶
- Groth16 (Alin Tomescu) (blog, 2024)
- Cryptographic Principles (Alin Tomescu) (blog, 2021)
- LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) (paper, 2019)
- On the Size of Pairing-Based Non-interactive Arguments (Groth16) (paper, 2016)
- Short Group Signatures (Boneh, Boyen, Shacham 2004) (paper, 2004)
post-quantum¶
- Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) (paper, 2019)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) (paper, 2018)
prover-backend¶
- Ligetron Marketplace Documentation (doc, 2024)
- AztecProtocol: Aztec Packages (UltraHONK Audit Scope) (code, 2023)
- Noir's Circuit Backend (blog, 2023)
- noir-lang/noir — ACVM Repository (code, 2022)
range-proof¶
- Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020) (paper, 2020)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999) (paper, 1999)
reed-solomon¶
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) (paper, 2018)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (Ames et al. 2017) (paper, 2017)
reference¶
- Reading list for ZKP algorithms and implementations (eid-privacy, 2026) (blog, 2026)
- Resources on Zero-knowledge Systems and Proofs (eid-privacy, 2025) (blog, 2025)
- Taxonomy for Privacy-Preserving Electronic Identities (Gasser, Humbert, Elghareeb 2025) (paper, 2025)
- Taxonomy of digital identity systems (eid-privacy, 2025) (blog, 2025)
- PLONKish Arithmetization — ZK Jargon (doc, 2022)
- Cryptographic Principles (Alin Tomescu) (blog, 2021)
- ZKProof Wiki of Concrete ZKP Schemes (wiki, 2020)
scalable¶
- Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) (paper, 2017)
- Scalable Secure Multiparty Computation (Damgård-Ishai 2006) (paper, 2006)
sigma¶
- DockNetwork Crypto Library Analysis (doc, 2026)
- ZKProof Sigma Protocol Proposal (Workshop 4) (paper, 2021)
- On Sigma Protocols (Damgård) (paper, 2004)
- Short Group Signatures (Boneh, Boyen, Shacham 2004) (paper, 2004)
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999) (paper, 1999)
- Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997) (paper, 1997)
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir) (paper, 1986)
snark¶
- Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index (Wang et al. 2026) (paper, 2026)
- Vision: A Modular Framework for Anonymous Credential Systems (Lehmann, Sidorenko, Zacharakis 2025) (paper, 2025)
- Anonymous Credentials from ECDSA (Frigo & shelat 2024) (paper, 2024)
- Crescent: Stronger Privacy for Existing Credentials (Paquin, Policharla, Zaverucha 2024) (paper, 2024)
- Groth16 (Alin Tomescu) (blog, 2024)
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023) (paper, 2023)
- Microsoft Spartan2 (code, 2022)
- Circom2 Documentation (doc, 2021)
- gnark Documentation (Consensys) (doc, 2021)
- Plookup: A Simplified Polynomial Protocol for Lookup Tables (Gabizon-Williamson 2020) (paper, 2020)
- Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) (paper, 2019)
- LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) (paper, 2019)
- PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge (paper, 2019)
- Sonic Reference Implementation (ebfull/sonic) (code, 2019)
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings (Maller et al. 2019) (paper, 2019)
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup (Setty 2020) (paper, 2019)
- TurboPLONK Proposal (ZKProof Workshop 3) (paper, 2019)
- Understanding PLONK (blog, 2019)
- Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018) (paper, 2018)
- ZoKrates Documentation (doc, 2018)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
- Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) (paper, 2017)
- On the Size of Pairing-Based Non-interactive Arguments (Groth16) (paper, 2016)
- Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013) (paper, 2013)
- Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013) (paper, 2012)
standard¶
- ZKProof Sigma Protocol Proposal (Workshop 4) (paper, 2021)
- TurboPLONK Proposal (ZKProof Workshop 3) (paper, 2019)
stark¶
- Comparative Analysis of SP1 and RISC Zero Zero-Knowledge Virtual Machines (blog, 2024)
- OpenVM Documentation (doc, 2024)
- SP1 Documentation (Succinct Labs) (doc, 2024)
- RISC Zero Documentation (doc, 2023)
- STARK 101 — AIR Tutorial (StarkWare) (doc, 2021)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) (paper, 2018)
theory¶
- Scalable Secure Multiparty Computation (Damgård-Ishai 2006) (paper, 2006)
- On Sigma Protocols (Damgård) (paper, 2004)
- Non-Interactive Zero-Knowledge and Its Applications (BFM88) (paper, 1988)
- The Knowledge Complexity of Interactive Proof Systems (GMR85) (paper, 1985)
transformation¶
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir) (paper, 1986)
transparent¶
- Anonymous Credentials from ECDSA (Frigo & shelat 2024) (paper, 2024)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (paper, 2022)
- Microsoft Spartan2 (code, 2022)
- Halo2 Documentation (Zcash) (doc, 2021)
- Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020) (paper, 2020)
- Ligero++: A New Optimized Sublinear IOP (Bhadauria et al. 2020) (paper, 2020)
- Microsoft Spartan — Commit History (code, 2020)
- Microsoft Spartan (Original) (code, 2020)
- Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) (paper, 2019)
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup (Setty 2020) (paper, 2019)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) (paper, 2018)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
- Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) (paper, 2017)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (Ames et al. 2017) (paper, 2017)
trusted-setup¶
- Groth16 (Alin Tomescu) (blog, 2024)
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings (Maller et al. 2019) (paper, 2019)
- Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018) (paper, 2018)
- On the Size of Pairing-Based Non-interactive Arguments (Groth16) (paper, 2016)
- Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013) (paper, 2013)
- Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013) (paper, 2012)
tutorials¶
- STARK 101 — AIR Tutorial (StarkWare) (doc, 2021)
universal-setup¶
- PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge (paper, 2019)
- Sonic Reference Implementation (ebfull/sonic) (code, 2019)
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings (Maller et al. 2019) (paper, 2019)
- Understanding PLONK (blog, 2019)
- Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018) (paper, 2018)
wasm¶
- Circom2 Documentation (doc, 2021)
zkp¶
- Secure and Privacy-Preserving Credentials for E-ID Proof-of-Concept (Gasser, Humbert, Elghareeb 2025) (paper, 2025)
- Proofs, Arguments, and Zero-Knowledge (book, 2023)
- ZKAttest: Ring and Group Signatures for Existing ECDSA Keys (paper, 2022)
- Cryptographic Principles (Alin Tomescu) (blog, 2021)
- Note: PLONK / TurboPLONK / UltraPLONK Family (blog, 2021)
- ZKProof Wiki of Concrete ZKP Schemes (wiki, 2020)
- The Evolution of Zero Knowledge Proofs (blog, 2018)
- Algebraic Methods for Interactive Proof Systems (paper, 1992)
- Non-Interactive Zero-Knowledge and Its Applications (BFM88) (paper, 1988)
- The Knowledge Complexity of Interactive Proof Systems (GMR85) (paper, 1985)
zkvm¶
- Comparative Analysis of SP1 and RISC Zero Zero-Knowledge Virtual Machines (blog, 2024)
- OpenVM Documentation (doc, 2024)
- SP1 Documentation (Succinct Labs) (doc, 2024)
- RISC Zero Documentation (doc, 2023)