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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 · cited 4×
“Moreover, we give, for the first time, an argument for a very slight variation of the well-known El Gamal signature scheme [17].”
BackgroundMethodInfluentialRandom 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
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
An Identity-Based Signature from Gap Diffie-Hellman Groups
Choon, J. C., & Hee Cheon, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_2 · Cited by 917
He, D., Zeadally, S., Xu, B., & Huang, X. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2473820 · Cited by 881
Efficient Identity Based Signature Schemes Based on Pairings
Hess, F. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36492-7_20 · Cited by 840
Lattice Signatures without Trapdoors
Lyubashevsky, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_43 · Cited by 827
HMQV: A High-Performance Secure Diffie-Hellman Protocol: (Extended Abstract)
Krawczyk, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_33 · Cited by 730
ECPP: Efficient Conditional Privacy Preservation Protocol for Secure Vehicular Communications
Lu, R., Lin, X., Zhu, H., Ho, P.-H., & Shen, X. (2008) · IEEE INFOCOM 2008 - The 27th Conference on Computer Communications · doi:10.1109/infocom.2008.179 · Cited by 724
Multi-signatures in the plain public-Key model and a general forking lemma
Bellare, M., & Neven, G. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180453 · Cited by 654
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_35 · Cited by 558
High-speed high-security signatures
Bernstein, D. J., Duif, N., Lange, T., Schwabe, P., & Yang, B.-Y. (2012) · Journal of Cryptographic Engineering · doi:10.1007/s13389-012-0027-1 · Cited by 541
ID-Based Blind Signature and Ring Signature from Pairings
Zhang, F., & Kim, K. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_33 · Cited by 530
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
Okamoto, T., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_8 · Cited by 477
Self-citationRandom Oracles in a Quantum World
Boneh, D., Dagdelen, Ö., Fischlin, M., Lehmann, A., Schaffner, C., & Zhandry, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_3 · Cited by 449
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
Barreto, P. S. L. M., Libert, B., McCullagh, N., & Quisquater, J.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11593447_28 · Cited by 437
Anonymous Authentication for Wireless Body Area Networks With Provable Security
He, D., Zeadally, S., Kumar, N., & Lee, J.-H. (2017) · IEEE Systems Journal · doi:10.1109/jsyst.2016.2544805 · Cited by 433
Provably authenticated group Diffie-Hellman key exchange
Bresson, E., Chevassut, O., Pointcheval, D., & Quisquater, J.-J. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502018 · Cited by 372
Self-citationOn Cryptographic Assumptions and Challenges
Naor, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_6 · Cited by 360
Zhang, J., Cui, J., Zhong, H., Chen, Z., & Liu, L. (2021) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2019.2904274 · Cited by 341
Shim, K.-A. (2012) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2012.2186992 · Cited by 337
1-out-of-n Signatures from a Variety of Keys
Abe, M., Ohkubo, M., & Suzuki, K. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_26 · Cited by 337
Simple Password-Based Encrypted Key Exchange Protocols
Abdalla, M., & Pointcheval, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30574-3_14 · Cited by 327
Self-citationAuthentication Protocols for Internet of Things: A Comprehensive Survey
Ferrag, M. A., Maglaras, L. A., Janicke, H., Jiang, J., & Shu, L. (2017) · Security and Communication Networks · doi:10.1155/2017/6562953 · Cited by 318
Identity-Based Distributed Provable Data Possession in Multicloud Storage
Wang, H. (2015) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2014.1 · Cited by 313
Bellare, M., & Palacio, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_11 · Cited by 312
Threshold Ring Signatures and Applications to Ad-hoc Groups
Bresson, E., Stern, J., & Szydlo, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_30 · Cited by 311
Self-citationLo, N.-W., & Tsai, J.-L. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2502322 · Cited by 307
Secure Anonymous Key Distribution Scheme for Smart Grid
Tsai, J.-L., & Lo, N.-W. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2015.2440658 · Cited by 306
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
Güneysu, T., Lyubashevsky, V., & Pöppelmann, T. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33027-8_31 · Cited by 301
Compact Multi-signatures for Smaller Blockchains
Boneh, D., Drijvers, M., & Neven, G. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-03329-3_15 · Cited by 299
Certificateless Remote Anonymous Authentication Schemes for WirelessBody Area Networks
Liu, J., Zhang, Z., Chen, X., & Kwak, K. S. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.145 · Cited by 299
Efficiency improvements for signature schemes with tight security reductions
Katz, J., & Wang, N. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948132 · Cited by 285
Blockchain-Based Reliable and Efficient Certificateless Signature for IIoT Devices
Wang, W., Xu, H., Alazab, M., Gadekallu, T. R., Han, Z., & Su, C. (2022) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2021.3084753 · Cited by 285
Anonymous Identification in Ad Hoc Groups
Dodis, Y., Kiayias, A., Nicolosi, A., & Shoup, V. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_36 · Cited by 284
Simple Schnorr multi-signatures with applications to Bitcoin
Maxwell, G., Poelstra, A., Seurin, Y., & Wuille, P. (2019) · Designs, Codes and Cryptography · doi:10.1007/s10623-019-00608-x · Cited by 276
SPECS: Secure and privacy enhancing communications schemes for VANETs
Chim, T. W., Yiu, S. M., Hui, L. C. K., & Li, V. O. K. (2011) · Ad Hoc Networks · doi:10.1016/j.adhoc.2010.05.005 · Cited by 275
Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud
Liu, X., Zhang, Y., Wang, B., & Yan, J. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.331 · Cited by 274
b-SPECS+: Batch Verification for Secure Pseudonymous Authentication in VANET
Horng, S.-J., Tzeng, S.-F., Pan, Y., Fan, P., Wang, X., Li, T., & Khan, M. K. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2277471 · Cited by 268
Enhancing Security and Privacy for Identity-Based Batch Verification Scheme in VANETs
Tzeng, S.-F., Horng, S.-J., Li, T., Wang, X., Huang, P.-H., & Khan, M. K. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2015.2406877 · Cited by 254
Anonymous and Traceable Group Data Sharing in Cloud Computing
Shen, J., Zhou, T., Chen, X., Li, J., & Susilo, W. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2774439 · Cited by 253
An evaluation of a multiple interface design solution for bloated software
McGrenere, J., Baecker, R. M., & Booth, K. S. (2002) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/503376.503406 · Cited by 169
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.