The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Security Arguments for Digital Signatures and Blind Signatures
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Blind Signatures for Untraceable Payments
Chaum, D. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_18 · Cited by 3,260
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
The MD5 Message-Digest Algorithm
Rivest, R. (1992) · doi:10.17487/rfc1321 · Cited by 1,976
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
ElGamal, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_2 · Cited by 1,604
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_22 · Cited by 1,381
The knowledge complexity of interactive proof-systems
Goldwasser, S., Micali, S., & Rackoff, C. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22178 · Cited by 1,302
A Design Principle for Hash Functions
Damgård, I. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_39 · Cited by 1,188
Untraceable Electronic Cash: (Extended Abstract)
Chaum, D., Fiat, A., & Naor, M. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_25 · Cited by 1,120
Security Proofs for Signature Schemes
Pointcheval, D., & Stern, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_33 · Cited by 1,077
Self-citationUniversal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73011 · Cited by 959
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Bellare, M., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_34 · Cited by 945
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_68 · Cited by 751
New Directions in Cryptography
Diffie, W., & Hellman, M. E. (2022) · Democratizing Cryptography · doi:10.1145/3549993.3550007 · Cited by 668
Rivest, R. L. (1990) · doi:10.17487/rfc1186 · Cited by 607
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
Okamoto, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_3 · Cited by 581
Digital Signature Standard (DSS)
Daley, W. M., & Kammer, R. G. (2000) · Defense Technical Information Center (DTIC) · Cited by 551
Witness indistinguishable and witness hiding protocols
Feige, U., & Shamir, A. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100272 · Cited by 523
Untraceable Off-line Cash in Wallet with Observers
Brands, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_26 · Cited by 507
RIPEMD-160: A strengthened version of RIPEMD
Dobbertin, H., Bosselaers, A., & Preneel, B. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60865-6_44 · Cited by 487
A new identification scheme based on syndrome decoding
Stern, J. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_2 · Cited by 353
Self-citationProvably secure blind signature schemes
Pointcheval, D., & Stern, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0034852 · Cited by 246
Self-citationSecurity of blind digital signatures: Extended abstract
Juels, A., Luby, M., & Ostrovsky, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052233 · Cited by 203
Efficient identification andsignatures for smart cards
Schnorr, C. P. (1990) · International Cryptology Conference · Cited by 202
Ferguson, N. (2007) · Springer eBooks · doi:10.1007/3-540-48285-7_28 · Cited by 152
“Indirect discourse proofs”: Achieving efficient Fair Off-Line e-cash
Frankel, Y., Tsiounis, Y., & Yung, M. M. (1996) · Lecture notes in computer science · doi:10.1007/bfb0034855 · Cited by 145
HAVAL - A One-Way Hashing Algorithm with Variable Length of Output
Yuliang Zheng, A., Pieprzyk, J., & Seberry, J. (1992) · Research Online (University of Wollongong) · Cited by 135
Digital payment systems with passive anonymity-revoking trustees
Camenisch, J. L., Maurer, U. M., & Stadler, M. A. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61770-1_26 · Cited by 119
Digital Signature Standard (DSS)Preprint
Regenscheid, A. (2019) · doi:10.6028/nist.fips.186-5-draft · Cited by 111
An Efficient Identification Scheme Based on Permuted Kernels (extended abstract)
Shamir, A. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_54 · Cited by 110
Fast Signature Generation with a Fiat Shamir — Like Scheme
Ong, H., & Schnorr, C. P. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_38 · Cited by 99
A "Paradoxical" Solution To The Signature Problem
Goldwasser, S., Micali, S. M., & Rivest, R. L. (1984) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1984.715946 · Cited by 91
Secure and efficient off-line digital money (extended abstract)
Franklin, M. K., & Yung, M. M. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56939-1_78 · Cited by 87
Revokable and versatile electronic money (extended abstract)
Jakobsson, M., & Yung, M. M. (1996) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/238168.238191 · Cited by 78
A New Identification Scheme Based on the Perceptrons Problem
Pointcheval, D. (1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x_26 · Cited by 74
Self-citationA “Paradoxical” Solution to The Signature Problem
Goldwasser, S., Micali, S. M., & Rivest, R. L. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_37 · Cited by 73
How To Sign Given Any Trapdoor Function
Mihir Bellare, Y., & Micali, S. M. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_15 · Cited by 66
How to sign given any trapdoor permutation
Mihir Bellare, Y., & Micali, S. M. (1992) · Journal of the ACM · doi:10.1145/147508.147537 · Cited by 60
Cited by
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing
Wang, C., Wang, Q., Ren, K., & Lou, W. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462173 · Cited by 1,415
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
Metadata
- Authors
- Pointcheval, D., & Stern, J.
- Venue
- Journal of Cryptology
- Published
- 2000-03-21
- Volume
- 13
- Issue
- 3
- Pages
- 361-396
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W2169194339
- Cited by
- 2,209
- References
- 48
- FWCI
- 38.32
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.