Get started
Keyword

zero-knowledge proofs

Description: Zero-knowledge proofs are cryptographic methods that let one party verify a claim without learning information beyond its validity.
Wikidata ID: wiki/Q191943
OpenAlex ID: keywords/zero-knowledge-proofs
Random oracles are practical
1993 · Mihir Bellare, Phillip Rogaway · Proceedings of the ACM Conference on Computer and Communications Security · 4,712
PDF
Universally composable security: a new paradigm for cryptographic protocols
2001 · R. Canetti · Annual Symposium on Foundations of Computer Science · 3,347
The Knowledge Complexity of Interactive Proof Systems
1989 · Shafi Goldwasser, Silvio Micali, et al. · SIAM Journal on Computing · 3,261
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
2016 · Ahmed Kosba, Andrew Miller, et al. · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · 2,225
Foundations of Cryptography
2001 · Oded Goldreich · Cambridge University Press eBooks · 2,201
Zerocash: Decentralized Anonymous Payments from Bitcoin
2014 · Eli Ben Sasson, Alessandro Chiesa, et al. · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · 1,961
PDF
Foundations of Cryptography
2004 · Oded Goldreich · Cambridge University Press eBooks · 1,810
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
1991 · Oded Goldreich, Silvio Micali, et al. · Journal of the ACM · 1,351
Traceable Signatures
2004 · Aggelos Kiayias, Yiannis Tsiounis, et al. · Lecture notes in computer science · 1,294
On the Size of Pairing-Based Non-interactive Arguments
2016 · Jens Groth · Lecture notes in computer science · 1,259
A Privacy-Preserving and Transparent Certification System for Digital Credentials
2014 · Saramago, Rodrigo Q., Meling, Hein, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 1,171
Efficient group signature schemes for large groups
1997 · Jan Camenisch, Markus Stadler · Lecture notes in computer science · 1,157
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
2007 · Ronald Cramer, Ivan Damgård, et al. · Springer eBooks · 1,153
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System
2001 · Ivan Damgård, Mads Jurik · Lecture notes in computer science · 1,066
Foundations of Cryptography: Basic Tools
2000 · Oded Goldreich · Cambridge University Press eBooks · 1,009
Signature Schemes and Anonymous Credentials from Bilinear Maps
2004 · Jan Camenisch, Anna Lysyanskaya · Lecture notes in computer science · 1,001
Security and Privacy on Blockchain
2019 · Rui Zhang, Rui Xue, et al. · ACM Computing Surveys · 972
PDF
Minimum disclosure proofs of knowledge
1988 · Gilles Brassard, David Chaum, et al. · Journal of Computer and System Sciences · 961
Non-interactive zero-knowledge and its applications
1988 · Manuel Blum, Paul Feldman, et al. · 905
PDF
Efficient Multiparty Protocols Using Circuit Randomization
2007 · Donald Beaver · Springer eBooks · 895
Pinocchio: Nearly Practical Verifiable Computation
2013 · B. Parno, J. Howell, et al. · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · 864
PDF
Elementary Number Theory and Its Applications.
1987 · S. S. Wagstaff, Kenneth H. Rosen · Mathematics of Computation · 837
A secure and optimally efficient multi‐authority election scheme
1997 · Ronald Cramer, Rosario Gennaro, et al. · European Transactions on Telecommunications · 791
Advances in Cryptology – CRYPTO 2016
2016 · Katz, Jonathan, Robshaw, Matthew · Lecture notes in computer science · 767
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
2002 · Jan Camenisch, Anna Lysyanskaya · Lecture notes in computer science · 757
Works count: 9,652
Citation count: 129,300
Year
Topic
Type