The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Authentication and authenticated key exchanges
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Self-citationA 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
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
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
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Burrows, M., Abadi, M., & Needham, R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/77648.77649 · Cited by 2,523
How to time-stamp a digital document
Haber, S., & Stornetta, W. S. (1991) · Journal of Cryptology · doi:10.1007/bf00196791 · Cited by 1,483
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Self-citationGuide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
The Elliptic Curve Digital Signature Algorithm (ECDSA)
Johnson, D., Menezes, A., & Vanstone, S. (2001) · International Journal of Information Security · doi:10.1007/s102070100002 · Cited by 2,239
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Canetti, R., & Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_28 · Cited by 1,653
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
Zheng, Y. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052234 · Cited by 1,250
A data mining framework for building intrusion detection models
Lee, W., Stolfo, S. J., & Mok, K. W. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766909 · Cited by 1,148
Anonymous connections and onion routing
Reed, M. G., Syverson, P. F., & Goldschlag, D. M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668972 · Cited by 1,063
Mobile values, new names, and secure communication
Abadi, M., & Fournet, C. (2001) · Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/360204.360213 · Cited by 846
A secure and efficient conference key distribution system: Extended abstract
Burmester, M., & Desmedt, Y. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053443 · Cited by 844
Universally Composable Notions of Key Exchange and Secure Channels
Canetti, R., & Krawczyk, H. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_22 · Cited by 746
The quest for security in mobile ad hoc networks
Hubaux, J., Buttyán, L., & Capkun, S. (2001) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/501436.501437 · Cited by 730
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
A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography
Malan, D. J., Welsh, M., & Smith, M. D. (2005) · 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. · doi:10.1109/sahcn.2004.1381904 · Cited by 712
A Forward-Secure Public-Key Encryption Scheme
Canetti, R., Halevi, S., & Katz, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_16 · Cited by 701
A hierarchy of authentication specifications
Lowe, G. (2002) · Proceedings 10th Computer Security Foundations Workshop · doi:10.1109/csfw.1997.596782 · Cited by 630
Anonymous connections and onion routing
Syverson, P. F., Goldschlag, D. M., & Reed, M. G. (2002) · Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097) · doi:10.1109/secpri.1997.601314 · Cited by 629
Provably secure session key distribution: the three party case
Bellare, M., & Rogaway, P. (1995) · Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 · doi:10.1145/225058.225084 · Cited by 593
A Forward-Secure Digital Signature Scheme
Bellare, M., & Miner, S. K. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_28 · Cited by 591
A secure and reliable bootstrap architecture
Arbaugh, W. A., Farber, D. J., & Smith, J. M. (2002) · Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097) · doi:10.1109/secpri.1997.601317 · Cited by 562
Authentication in distributed systems: a bibliography
Liebl, A. (1993) · ACM SIGOPS Operating Systems Review · doi:10.1145/163640.163643 · Cited by 534
Strong password-only authenticated key exchange
Jablon, D. P. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/242896.242897 · Cited by 532
An Efficient Protocol for Authenticated Key Agreement
Law, L., Menezes, A., Qu, M., Solinas, J., & Vanstone, S. (2003) · Designs, Codes and Cryptography · doi:10.1023/a:1022595222606 · Cited by 513
The NRL Protocol Analyzer: An Overview
Meadows, C. (1996) · The Journal of Logic Programming · doi:10.1016/0743-1066(95)00095-x · Cited by 459
Secure audit logs to support computer forensics
Schneier, B., & Kelsey, J. (1999) · ACM Transactions on Information and System Security · doi:10.1145/317087.317089 · Cited by 443
Cryptographic Extraction and Key Derivation: The HKDF Scheme
Krawczyk, H. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_34 · Cited by 408
Key-Insulated Public Key Cryptosystems
Dodis, Y., Katz, J., Xu, S., & Yung, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_5 · Cited by 400
Scalable Protocols for Authenticated Group Key Exchange
Katz, J., & Yung, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_7 · Cited by 393
Internet Security Association and Key Management Protocol (ISAKMP)
Maughan, D., Schertler, M., Schneider, M., & Turner, J. (1998) · doi:10.17487/rfc2408 · Cited by 392
SIGMA: The ‘SIGn-and-MAc’ Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols
Krawczyk, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_24 · Cited by 382
Privacy-Friendly Aggregation for the Smart-Grid
Kursawe, K., Danezis, G., & Kohlweiss, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22263-4_10 · Cited by 378
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276854 · Cited by 358
Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE
Bos, J., Costello, C., Ducas, L., Mironov, I., Naehrig, M., Nikolaenko, V., Raghunathan, A., & Stebila, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978425 · Cited by 320
Public-key cryptography and password protocols
Halevi, S., & Krawczyk, H. (1999) · ACM Transactions on Information and System Security · doi:10.1145/322510.322514 · Cited by 314
Practical Attacks Against Privacy and Availability in 4G/LTE Mobile Communication Systems
Shaik, A., Borgaonkar, R., Asokan, N., Niemi, V., & Seifert, J.-P. (2016) · Proceedings 2016 Network and Distributed System Security Symposium · doi:10.14722/ndss.2016.23236 · Cited by 277
Privacy as a Service: Privacy-Aware Data Storage and Processing in Cloud Computing Architectures
Itani, W., Kayssi, A., & Chehab, A. (2009) · 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing · doi:10.1109/dasc.2009.139 · Cited by 275
Forward-Security in Private-Key Cryptography
Bellare, M., & Yee, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36563-x_1 · Cited by 275
On unifying some cryptographic protocol logics
Syverson, P. F., & van Oorschot, P. C. (2002) · Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1994.296595 · Cited by 273
Self-citationThe Modelling and Analysis of Security Protocols: the CSP Approach
Ryan, P. Y. A., Schneider, S. A., Goldsmith, M., Lowe, G., & Roscoe, A. (2001) · doi:10.25405/ncl.34123404 · Cited by 269
Gope, P., & Hwang, T. (2016) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2016.2585081 · Cited by 267
Internet Engineering Task Force
(2018) · The SAGE Encyclopedia of the Internet · doi:10.4135/9781473960367.n143 · Cited by 266
A modular correctness proof of IEEE 802.11i and TLS
He, C., Sundararajan, M., Datta, A., Derek, A., & Mitchell, J. C. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102124 · Cited by 121
Injective synchronisation: An extension of the authentication hierarchy
Cremers, C. J. F., Mauw, S., & de Vink, E. P. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.08.034 · Cited by 61
Protecting Key Exchange and Management Protocols Against Resource Clogging Attacks
Oppliger, R. (1999) · Secure Information Networks · doi:10.1007/978-0-387-35568-9_11 · Cited by 22
Metadata
- Authors
- Diffie, W., Van Oorschot, P. C., & Wiener, M. J.
- Venue
- Designs, Codes and Cryptography
- Published
- 1992-06
- Volume
- 2
- Issue
- 2
- Pages
- 107-125
- ISSN
- 0925-1022 (ISSN-L)
- 1573-7586
- OpenAlex
- W1994386233
- Cited by
- 1,154
- References
- 25
- FWCI
- 12.49
- Type
- journal article
- Language
- en
- Open access
- green
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.