| Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions (Ben-Or, Goldwasser, Kilian, Wigderson 1988) |
1988 |
469 |
12.0 |
| A "Paradoxical" Identity-Based Signature Scheme Resulting from Zero-Knowledge (Guillou, Quisquater 1988) |
1988 |
451 |
11.6 |
| Constant-Size Dynamic k-TAA (Au, Susilo, Mu 2006) |
2006 |
301 |
14.3 |
| Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999) |
1999 |
300 |
10.7 |
| Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997) |
1997 |
226 |
7.5 |
| Anonymous Credentials Light (Baldimtsi, Lysyanskaya 2013) |
2013 |
182 |
13.0 |
| Modular Design of Secure yet Practical Cryptographic Protocols (Cramer 1997) |
1997 |
169 |
5.6 |
| Scalable Secure Multiparty Computation (Damgård-Ishai 2006) |
2006 |
135 |
6.4 |
| Anonymous Attestation Using the Strong Diffie Hellman Assumption Revisited (Camenisch, Drijvers, Lehmann 2016) |
2016 |
120 |
10.9 |
| Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) |
2018 |
114 |
12.7 |
| Algebraic MACs and Keyed-Verification Anonymous Credentials (Chase, Meiklejohn, Zaverucha 2014) |
2014 |
113 |
8.7 |
| Ligero++: A New Optimized Sublinear IOP (Bhadauria et al. 2020) |
2020 |
77 |
11.0 |
| Unifying Zero-Knowledge Proofs of Knowledge (Maurer 2009) |
2009 |
76 |
4.2 |
| LaBRADOR: Compact Proofs for R1CS from Module-SIS (Beullens, Seiler 2023) |
2023 |
60 |
15.0 |
| The Signal Private Group System and Anonymous Credentials Supporting Efficient Verifiable Encryption (Chase, Perrin, Zaverucha 2020) |
2020 |
60 |
8.6 |
| Cinderella: Turning Shabby X.509 Certificates into Elegant Anonymous Credentials with the Magic of Verifiable Computation (Delignat-Lavaud, Fournet, Kohlweiss, Parno 2016) |
2016 |
56 |
5.1 |
| Issuer-Hiding Attribute-Based Credentials (Bobolz, Eidens, Krenn, Ramacher, Samelin 2021) |
2021 |
46 |
7.7 |
| U-Prove Cryptographic Specification V1.1 (Paquin, Zaverucha 2011) |
2011 |
45 |
2.8 |
| Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists (Bayer, Groth 2013) |
2013 |
43 |
3.1 |
| Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020) |
2020 |
41 |
5.9 |
| Ligero: Lightweight Sublinear Arguments Without a Trusted Setup |
2022 |
37 |
7.4 |
| Improved Algebraic MACs and Practical Keyed-Verification Anonymous Credentials (Barki, Brunet, Desmoulins, Traoré 2016) |
2016 |
27 |
2.5 |
| SoK: Anonymous Credentials (Kakvi, Martin, Putman, Quaglia 2023) |
2023 |
22 |
5.5 |
| The LaZer Library: Lattice-Based Zero Knowledge and Succinct Proofs for Quantum-Safe Privacy (Lyubashevsky, Seiler, Steuer 2024) |
2024 |
20 |
6.7 |
| Practical Post-Quantum Signatures for Privacy (Argo, Güneysu, Jeudy, Land, Roux-Langlois, Sanders 2024) |
2024 |
20 |
6.7 |
| Plookup: A Simplified Polynomial Protocol for Lookup Tables (Gabizon-Williamson 2020) |
2020 |
20 |
2.9 |
| D2.2 Architecture for Attribute-based Credential Technologies — Final Version (ABC4Trust) (Bichsel et al. 2014) |
2014 |
14 |
1.1 |
| One-more Unforgeability of Blind ECDSA (Qin, Cai, Yuen 2021) |
2021 |
10 |
1.7 |
| LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) |
2019 |
10 |
1.3 |
| Compositional Formal Verification of Zero-Knowledge Circuits (Coglio, McCarthy, Smith, Chin, Gaddamadugu, Dellepere 2023) |
2023 |
9 |
2.3 |
| ZKAttest: Ring and Group Signatures for Existing ECDSA Keys (Faz-Hernández, Ladd, Maram 2022) |
2022 |
9 |
1.8 |
| Multi-Party Revocation in Sovrin: Performance through Distributed Trust (Helminger, Kales, Ramacher, Walch 2020) |
2020 |
9 |
1.3 |
| Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings (Maller et al. 2019) |
2019 |
9 |
1.1 |
| Lattice-Based Proof-Friendly Signatures from Vanishing Short Integer Solutions (Dubois, Klooß, Lai, Woo 2025) |
2025 |
6 |
3.0 |
| A Short-List of Pairing-Friendly Curves Resistant to the Special TNFS Algorithm at the 192-bit Security Level (Aranha, Fotiadis, Guillevic 2024) |
2024 |
5 |
1.7 |
| CDLS: Proving Knowledge of Committed Discrete Logarithms with Soundness (Celi, Levin, Rowell 2023) |
2023 |
5 |
1.3 |
| ALLOSAUR: Accumulator with Low-Latency Oblivious Sublinear Anonymous credential Updates with Revocations (Jaques, Lodder, Montgomery 2022) |
2022 |
5 |
1.0 |
| Efficient Proofs of Possession for Legacy Signatures (Woo, Ozdemir, Sharp, Pornin, Grubbs 2025) |
2025 |
4 |
2.0 |
| SoK: Understanding zk-SNARKs: The Gap Between Research and Practice (Liang et al. 2025) |
2025 |
2 |
1.0 |
| Zero-Knowledge Proof Frameworks: A Systematic Survey (Sheybani, Ahmed, Kinsy, Koushanfar 2025) |
2025 |
2 |
1.0 |
| SoK: What Don't We Know? Understanding Security Vulnerabilities in SNARKs (Chaliasos, Ernstberger, Theodore, Wong, Jahanara, Livshits 2024) |
2024 |
2 |
0.7 |
| Cryptographic Accumulators: New Definitions, Enhanced Security, and Delegatable Proofs (Barthoulot, Blazy, Canard 2024) |
2024 |
2 |
0.7 |
| Revisiting Keyed-Verification Anonymous Credentials (Orrù 2025) |
2025 |
1 |
0.5 |
| Privacy-Enhancing Technologies for Digital Payments: Mapping the Landscape (Auer, Böhme, Clark, Demirag 2025) |
2025 |
0 |
0.0 |
| Formalizing Soundness Proofs of SNARKs (Bailey, Miller 2023) |
2023 |
0 |
0.0 |
| Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index (Wang et al. 2026) |
2026 |
— |
— |
| Server-Aided Anonymous Credentials (Chairattana-Apirom, Harding, Lysyanskaya, Tessaro 2025) |
2025 |
— |
— |
| Beyond the Circuit: How to Minimize Foreign Arithmetic in ZKP Circuits (Orrù, Kadianakis, Maller, Zaverucha 2025) |
2025 |
— |
— |
| Cryptographers' Feedback on the EU Digital Identity's ARF (Baum et al. 2024) |
2024 |
— |
— |
| Do You Need a Zero Knowledge Proof? (Ernstberger, Chaliasos, Zhou, Jovanovic, Gervais 2024) |
2024 |
— |
— |
| Arc: Accumulation for Reed–Solomon Codes (Bünz, Mishra, Nguyen, Wang 2024) |
2024 |
— |
— |
| Circle STARKs (Haböck, Levit, Papini 2024) |
2024 |
— |
— |
| The Last Challenge Attack: Exploiting a Vulnerable Implementation of the Fiat-Shamir Transform in a KZG-based SNARK (Ciobotaru, Peter, Velichkov 2024) |
2024 |
— |
— |
| The BBS# protocol: Technical details (Orange 2024) |
2024 |
— |
— |
| How to Bind Anonymous Credentials to Humans (Hesse, Singh, Sorniotti 2023) |
2023 |
— |
— |
| Customizable Constraint Systems for Succinct Arguments (Setty, Thaler, Wahby 2023) |
2023 |
— |
— |
| Sigmabus: Binding Sigmas in Circuits for Fast Curve Operations (Kadianakis, Maller, Novakovic 2023) |
2023 |
— |
— |
| Proofs of discrete logarithm equality across groups (Chase, Orrù, Perrin, Zaverucha 2022) |
2022 |
— |
— |
| ZKProof Sigma Protocol Proposal (Workshop 4) |
2021 |
— |
— |
| TurboPLONK Proposal (ZKProof Workshop 3) |
2019 |
— |
— |
| On Sigma Protocols (Damgård) |
2004 |
— |
— |