The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
HMQV: A High-Performance Secure Diffie-Hellman Protocol: (Extended Abstract)
Overview
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
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
Self-citationLower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
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
The Internet Key Exchange (IKE)
Harkins, D., & Carrel, D. (1998) · doi:10.17487/rfc2409 · Cited by 1,012
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
Self-citationProtocols for Authentication and Key Establishment
Boyd, C., & Mathuria, A. (2003) · Information Security and Cryptography · doi:10.1007/978-3-662-09527-0 · Cited by 653
Key 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
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 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
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
Abdalla, M., Bellare, M., & Rogaway, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_12 · Cited by 445
Dwork, C., Naor, M., & Sahai, A. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276853 · Cited by 425
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
Self-citationTowards Practical Public Key Systems Secure Against Chosen Ciphertext attacks
Damgård, I. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_36 · Cited by 357
On Formal Models for Secure Key Exchange.
Shoup, V. (1999) · Cited by 322
Authenticated Diffe-Hellman Key Agreement Protocols
Blake-Wilson, S., & Menezes, A. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48892-8_26 · Cited by 247
The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols
Bellare, M., & Palacio, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_17 · Cited by 235
SKEME: a versatile secure key exchange mechanism for Internet
Krawczyk, H. (2002) · Proceedings of Internet Society Symposium on Network and Distributed Systems Security · doi:10.1109/ndss.1996.492418 · Cited by 223
Self-citationOn the existence of 3-round zero-knowledge protocols
Hada, S., & Tanaka, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055744 · Cited by 175
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
Security Analysis of IKE’s Signature-Based Key-Exchange Protocol
Canetti, R., & Krawczyk, H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_10 · Cited by 132
Self-citationOne-Round Protocols for Two-Party Authenticated Key Exchange
Jeong, I. R., Katz, J. I., & Lee, D. H. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24852-1_16 · Cited by 105
Cited by
Provable data possession at untrusted stores
Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., & Song, D. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315318 · Cited by 2,705
Stronger Security of Authenticated Key Exchange
LaMacchia, B., Lauter, K., & Mityagin, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75670-5_1 · Cited by 695
Two birds with one stone: two-factor authentication with security beyond conventional bound
Wang, D., & Wang, P. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2605087 · Cited by 539
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
Self-citationLattice Cryptography for the Internet
Peikert, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11659-4_12 · Cited by 356
Metadata
- Authors
- Krawczyk, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 546-566
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2117455301
- Cited by
- 730
- References
- 29
- FWCI
- 22.66
- Type
- conference paper
- 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.