ZKP Papers¶
41 entries.
This file is auto-generated. Run devbox run summaries to update.
Navigation¶
All Papers¶
| Resource | Year | Authors | Tags |
|---|---|---|---|
| Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index (Wang et al. 2026) | 2026 | Weijie Wang et al. | snark, non-interactive, applications |
| Device Binding for Anonymous Credentials on Legacy Phones (Lehmann, Zacharakis 2026) | 2026 | Anja Lehmann, Alexandros Zacharakis | eid, applications, cryptography |
| On the (Privacy) Harms of the European Digital Identity Framework (Knabenhans, Veitch, Raynal, Stadler, Chatel, Lueks, Troncoso 2026) | 2026 | Christian Knabenhans et al. | eid, applications |
| Device-Bound Anonymous Credentials With(out) Trusted Hardware (Friedrichs, Harding, Lehmann, Lysyanskaya 2025) | 2025 | Karla Friedrichs et al. | eid, applications, cryptography |
| Secure and Privacy-Preserving Credentials for E-ID Proof-of-Concept (Gasser, Humbert, Elghareeb 2025) | 2025 | Linus Gasser, Clement Humbert, Ahmed Elghareeb | eid, applications, zkp |
| Taxonomy for Privacy-Preserving Electronic Identities (Gasser, Humbert, Elghareeb 2025) | 2025 | Linus Gasser, Clement Humbert, Ahmed Elghareeb | eid, overview, reference, cryptography |
| Vision: A Modular Framework for Anonymous Credential Systems (Lehmann, Sidorenko, Zacharakis 2025) | 2025 | Anja Lehmann, Andrey Sidorenko, Alexandros Zacharakis | snark, eid, applications, commit-and-prove, composition |
| Anonymous Credentials from ECDSA (Frigo & shelat 2024) | 2024 | Matteo Frigo, abhi shelat | snark, transparent, eid, elliptic-curves, applications |
| Crescent: Stronger Privacy for Existing Credentials (Paquin, Policharla, Zaverucha 2024) | 2024 | Christian Paquin, Guru-Vamsi Policharla, Greg Zaverucha | snark, eid, elliptic-curves, applications |
| HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023) | 2023 | Binyi Chen et al. | snark, arithmetization, lookup, linear-time-prover |
| Ligero: Lightweight Sublinear Arguments Without a Trusted Setup | 2022 | Scott Ames et al. | linear-time-prover, transparent, iop |
| ZKAttest: Ring and Group Signatures for Existing ECDSA Keys | 2022 | Gregor Seiler, Kasra Abbaszadeh, Azam Soleimanian | attestation, zkp, elliptic-curves, applications |
| ZKProof Sigma Protocol Proposal (Workshop 4) | 2021 | ZKProof Community | sigma, standard, non-interactive |
| Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020) | 2020 | Heewon Chung et al. | transparent, range-proof, discrete-log, logarithmic |
| Ligero++: A New Optimized Sublinear IOP (Bhadauria et al. 2020) | 2020 | Rishabh Bhadauria et al. | linear-time-prover, transparent, iop |
| Plookup: A Simplified Polynomial Protocol for Lookup Tables (Gabizon-Williamson 2020) | 2020 | Ariel Gabizon, Zachary J. Williamson | lookup, arithmetization, snark |
| Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) | 2019 | Eli Ben-Sasson et al. | snark, transparent, iop, post-quantum |
| LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) | 2019 | Matteo Campanelli et al. | snark, commit-and-prove, composition, pairing |
| PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge | 2019 | Ariel Gabizon, Zachary J. Williamson, Oana Ciobotaru | snark, universal-setup, arithmetization |
| Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings (Maller et al. 2019) | 2019 | Mary Maller et al. | snark, universal-setup, trusted-setup |
| Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup (Setty 2020) | 2019 | Srinath Setty | snark, transparent, iop |
| TurboPLONK Proposal (ZKProof Workshop 3) | 2019 | Ariel Gabizon, Zachary J. Williamson | standard, arithmetization, snark |
| Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) | 2018 | Eli Ben-Sasson et al. | stark, reed-solomon, iop, transparent, post-quantum |
| Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018) | 2018 | Jens Groth et al. | snark, universal-setup, trusted-setup, foundational |
| Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) | 2017 | Benedikt Bünz et al. | snark, transparent, logarithmic, discrete-log, range-proof, commitment |
| Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) | 2017 | Riad S. Wahby et al. | snark, transparent, iop, scalable, commitment |
| Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (Ames et al. 2017) | 2017 | Scott Ames et al. | linear-time-prover, transparent, iop, reed-solomon |
| On the Size of Pairing-Based Non-interactive Arguments (Groth16) | 2016 | Jens Groth | snark, pairing, trusted-setup, foundational |
| Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013) | 2013 | Bryan Parno et al. | snark, trusted-setup, foundational |
| Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013) | 2012 | Rosario Gennaro et al. | snark, foundational, trusted-setup |
| Scalable Secure Multiparty Computation (Damgård-Ishai 2006) | 2006 | Ivan Damgård, Yuval Ishai | mpc, scalable, theory, linear-time-prover |
| On Sigma Protocols (Damgård) | 2004 | Ivan Damgård | sigma, interactive-proof, foundational, theory |
| Short Group Signatures (Boneh, Boyen, Shacham 2004) | 2004 | Dan Boneh, Xavier Boyen, Hovav Shacham | sigma, commitment, pairing, cryptography, foundational |
| Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999) | 1999 | Jan Camenisch, Markus Michels | sigma, cryptography, discrete-log, range-proof |
| Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997) | 1997 | Jan Camenisch, Markus Stadler | sigma, discrete-log, foundational, cryptography |
| Algebraic Methods for Interactive Proof Systems | 1992 | Carsten Lund et al. | zkp, interactive-proof, mathematics, foundational |
| Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991) | 1991 | Torben Pryds Pedersen | commitment, cryptography, foundational, discrete-log |
| Non-Interactive Zero-Knowledge and Its Applications (BFM88) | 1988 | Manuel Blum, Paul Feldman, Silvio Micali | non-interactive, foundational, zkp, theory |
| How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir) | 1986 | Amos Fiat, Adi Shamir | non-interactive, sigma, transformation, foundational |
| The Knowledge Complexity of Interactive Proof Systems (GMR85) | 1985 | Shafi Goldwasser, Silvio Micali, Charles Rackoff | interactive-proof, foundational, zkp, theory |
| Fast Probabilistic Algorithms for Verification of Polynomial Identities | 1980 | Jacob T. Schwartz | mathematics, foundational, information-theoretic |