A diffie-hellman key exchange protocol without random oracles

ik rae Jeong, Jeong Ok Kwon, Dong Hoon Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

TheMQV protocol of Law, Menezes, Qu, Slinas and Vanstone has been regarded as the most efficient authenticated Diffie-Hellman key exchange protocol, and standardized by many organizations including the US NSA. In Crypto 2005, Hugo Krawczyk showed vulnerabilities of MQV to several attacks and suggested a hashed variant of MQV, called HMQV, which provides the same superb performance of MQV and provable security in the random oracle model. In this paper we suggest an efficient authenticated Diffie-Hellman key exchange protocol providing the same functionalities and security of HMQV without random oracles. There exist some provably secure key exchange schemes using signatures in the standard model, but all of the schemes do not provide the same level of security of HMQV. So far there are no authenticated Diffie-Hellman protocols which are proven secure in the standard model and achieve the same level of security goals of HMQV efficiently yet. Dispensing of random oracles in our protocol does not require any expensive signature and encryption schemes.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages37-54
Number of pages18
Volume4301 LNCS
DOIs
Publication statusPublished - 2006 Dec 1
Event5th International Conference on Cryptology and Network Security, CANS 2006 - Suzhou, China
Duration: 2006 Dec 82006 Dec 10

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4301 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Conference on Cryptology and Network Security, CANS 2006
CountryChina
CitySuzhou
Period06/12/806/12/10

Fingerprint

Key Exchange
Random Oracle
Diffie-Hellman
Standard Model
Cryptography
Provable Security
Random Oracle Model
Signature Scheme
Vulnerability
Encryption
Signature
Attack

Keywords

  • Diffie-hellman protocol
  • Key compromise impersonation
  • Key exchange
  • Strong forward secrecy
  • Unknown key share

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Jeong, I. R., Kwon, J. O., & Lee, D. H. (2006). A diffie-hellman key exchange protocol without random oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4301 LNCS, pp. 37-54). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4301 LNCS). https://doi.org/10.1007/11935070-3

A diffie-hellman key exchange protocol without random oracles. / Jeong, ik rae; Kwon, Jeong Ok; Lee, Dong Hoon.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4301 LNCS 2006. p. 37-54 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4301 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jeong, IR, Kwon, JO & Lee, DH 2006, A diffie-hellman key exchange protocol without random oracles. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4301 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4301 LNCS, pp. 37-54, 5th International Conference on Cryptology and Network Security, CANS 2006, Suzhou, China, 06/12/8. https://doi.org/10.1007/11935070-3
Jeong IR, Kwon JO, Lee DH. A diffie-hellman key exchange protocol without random oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4301 LNCS. 2006. p. 37-54. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11935070-3
Jeong, ik rae ; Kwon, Jeong Ok ; Lee, Dong Hoon. / A diffie-hellman key exchange protocol without random oracles. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4301 LNCS 2006. pp. 37-54 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fe03ca811fe44a108679bd9b0014d25f,
title = "A diffie-hellman key exchange protocol without random oracles",
abstract = "TheMQV protocol of Law, Menezes, Qu, Slinas and Vanstone has been regarded as the most efficient authenticated Diffie-Hellman key exchange protocol, and standardized by many organizations including the US NSA. In Crypto 2005, Hugo Krawczyk showed vulnerabilities of MQV to several attacks and suggested a hashed variant of MQV, called HMQV, which provides the same superb performance of MQV and provable security in the random oracle model. In this paper we suggest an efficient authenticated Diffie-Hellman key exchange protocol providing the same functionalities and security of HMQV without random oracles. There exist some provably secure key exchange schemes using signatures in the standard model, but all of the schemes do not provide the same level of security of HMQV. So far there are no authenticated Diffie-Hellman protocols which are proven secure in the standard model and achieve the same level of security goals of HMQV efficiently yet. Dispensing of random oracles in our protocol does not require any expensive signature and encryption schemes.",
keywords = "Diffie-hellman protocol, Key compromise impersonation, Key exchange, Strong forward secrecy, Unknown key share",
author = "Jeong, {ik rae} and Kwon, {Jeong Ok} and Lee, {Dong Hoon}",
year = "2006",
month = "12",
day = "1",
doi = "10.1007/11935070-3",
language = "English",
isbn = "9783540494621",
volume = "4301 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "37--54",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A diffie-hellman key exchange protocol without random oracles

AU - Jeong, ik rae

AU - Kwon, Jeong Ok

AU - Lee, Dong Hoon

PY - 2006/12/1

Y1 - 2006/12/1

N2 - TheMQV protocol of Law, Menezes, Qu, Slinas and Vanstone has been regarded as the most efficient authenticated Diffie-Hellman key exchange protocol, and standardized by many organizations including the US NSA. In Crypto 2005, Hugo Krawczyk showed vulnerabilities of MQV to several attacks and suggested a hashed variant of MQV, called HMQV, which provides the same superb performance of MQV and provable security in the random oracle model. In this paper we suggest an efficient authenticated Diffie-Hellman key exchange protocol providing the same functionalities and security of HMQV without random oracles. There exist some provably secure key exchange schemes using signatures in the standard model, but all of the schemes do not provide the same level of security of HMQV. So far there are no authenticated Diffie-Hellman protocols which are proven secure in the standard model and achieve the same level of security goals of HMQV efficiently yet. Dispensing of random oracles in our protocol does not require any expensive signature and encryption schemes.

AB - TheMQV protocol of Law, Menezes, Qu, Slinas and Vanstone has been regarded as the most efficient authenticated Diffie-Hellman key exchange protocol, and standardized by many organizations including the US NSA. In Crypto 2005, Hugo Krawczyk showed vulnerabilities of MQV to several attacks and suggested a hashed variant of MQV, called HMQV, which provides the same superb performance of MQV and provable security in the random oracle model. In this paper we suggest an efficient authenticated Diffie-Hellman key exchange protocol providing the same functionalities and security of HMQV without random oracles. There exist some provably secure key exchange schemes using signatures in the standard model, but all of the schemes do not provide the same level of security of HMQV. So far there are no authenticated Diffie-Hellman protocols which are proven secure in the standard model and achieve the same level of security goals of HMQV efficiently yet. Dispensing of random oracles in our protocol does not require any expensive signature and encryption schemes.

KW - Diffie-hellman protocol

KW - Key compromise impersonation

KW - Key exchange

KW - Strong forward secrecy

KW - Unknown key share

UR - http://www.scopus.com/inward/record.url?scp=84885934262&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885934262&partnerID=8YFLogxK

U2 - 10.1007/11935070-3

DO - 10.1007/11935070-3

M3 - Conference contribution

AN - SCOPUS:84885934262

SN - 9783540494621

VL - 4301 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 37

EP - 54

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -