The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
An Efficient Protocol for Authenticated Key Agreement
Overview
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
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
Self-citationEntity 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
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Authentication and authenticated key exchanges
Diffie, W., Van Oorschot, P. C., & Wiener, M. J. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,154
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A. J., Okamoto, T., & Vanstone, S. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259647 · Cited by 1,022
Self-citationMonte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825 · cited 1×
“In order to avoid the Pollard-rho [ 33 ] and Pohlig-Hellman [32] algorithms for the elliptic curve discrete logarithm problem (ECDLP), it is necessary that the number of Fq -rational points on E, denoted #E(Fq), be divisible by a sufficiently large prime n. As of this writing, it is commonly recommended that n > 2 160…”
MethodKey agreement protocols and their security analysis
Blake-Wilson⋆⋆, S., Johnson, D. B., & Menezes, A. (1997) · Lecture notes in computer science · doi:10.1007/bfb0024447 · Cited by 595
Self-citationA Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
Frey, G., & Ruck, H.-G. (1994) · Mathematics of Computation · doi:10.2307/2153546 · Cited by 551
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols.
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Cited by 381
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
The Discrete Logarithm Problem on Elliptic Curves of Trace One
Smart, N. P. (1999) · Journal of Cryptology · doi:10.1007/s001459900052 · Cited by 343
On Formal Models for Secure Key Exchange.
Shoup, V. (1999) · Cited by 322
An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations
Chaum, D., Evertse, J.-H., & Graaf, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/3-540-39118-5_13 · Cited by 246
Semaev, I. (1998) · Mathematics of Computation · doi:10.1090/s0025-5718-98-00887-4 · Cited by 234
A key recovery attack on discrete log-based schemes using a prime order subgroup
Lim, C. H., & Lee, P. J. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052240 · Cited by 207
Authenticated multi-party key agreement
Just, M., & Vaudenay, S. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0034833 · Cited by 199
An unknown key-share attack on the MQV key agreement protocol
Kaliski, B. S. (2001) · ACM Transactions on Information and System Security · doi:10.1145/501978.501981 · Cited by 140
On Diffie-Hellman Key Agreement with Short Exponents
van Oorschot, P. C., & Wiener, M. J. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_29 · Cited by 135
Anderson, R., & Serge Vaudenay, B. (1996) · Lecture notes in computer science · doi:10.1007/bfb0034832 · Cited by 110
On the Risk of Opening Distributed Keys
Burmester, M. V. D. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_29 · Cited by 65
Yacobi, Y. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_19 · Cited by 42
Towards practical “proven secure” authenticated key distribution
Desmedt, Y., & Burmester, M. V. D. (1993) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/168588.168616 · Cited by 23
Cited by
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
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
Charm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 675
Identity-based authenticated key agreement protocol based on Weil pairing
Smart, N. P. (2002) · Electronics Letters · doi:10.1049/el:20020387 · Cited by 446
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
Metadata
- Authors
- Law, L., Menezes, A., Qu, M., Solinas, J., & Vanstone, S.
- Venue
- Designs, Codes and Cryptography
- Published
- 2003-03
- Volume
- 28
- Issue
- 2
- Pages
- 119-134
- ISSN
- 0925-1022 (ISSN-L)
- 1573-7586
- OpenAlex
- W1927099252
- Cited by
- 513
- References
- 25
- FWCI
- 31.86
- Type
- journal article
- Language
- en
- Open access
- closed
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.