An Efficient Authenticated Key Exchange Protocol with a Tight Security Reduction.

Jooyoung Lee, Choon‐Sik Park

Published Jan 1, 2008• 29 citations

Abstract

In this paper, we present a new authenticated key exchange(AKE) protocol, called NETS, and prove its security in the extended Canetti-Krawczyk model under the random oracle assumption and the gap Diffie-Hellman(GDH) assumption. Our protocol enjoys a simple and tight security reduction compared to those of HMQV and CMQV without using the Forking Lemma. Each session of the NETS protocol requires only three exponentiations per party, which is comparable to the efficiency of MQV, HMQV and CMQV.

Related papers

Efficient and Secure Authenticated Key Exchange Protocols in the eCK Model

Jooyoung Lee, Je Hong Park

In this paper, we propose two authenticated key exchange (AKE) protocols and prove their security in the extended Canetti-Krawczyk model. The first protocol, called NAXOS+, is obtained by slightly modifying the NAXOS protocol proposed by LaMacchia, Lauter and Mityagin [15]. We prove its security under the Computational Diffie-Hellman (CDH) assumption by using the trapdoor test introduced in [6]. To the authors' knowledge, this is the first AKE protocol which is secure under the CDH assumption in the eCK model. The second protocol, called NETS, enjoys a simple and tight security reduction compared to existing schemes including HMQV and CMQV without using the Forking Lemma. Since each session of the NETS protocol requires only three exponentiations per party, its efficiency is also comparable to MQV, HMQV and CMQV.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesJan 1, 20110 citations

A New Efficient and Strongly Secure Authenticated Key Exchange Protocol

Qingfeng Cheng, Guangguo Han, Chuangui Ma

In 2007, LaMacchia et al.proposed the extended Canetti-Krawczyk (eCK) model for authenticated key exchange (AKE) protocols. In this paper, we first modify the eCK model by adding a new query to make the adversary can reveal all ephemeral secret information. Then we propose a new efficient and strongly secure AKE protocol in the asymmetric setting, called E-NETS (enhanced NETS) protocol, and prove its security in the modified eCK (meCK) model under the random oracle assumption and the gap Diffie-Hellman assumption.

International Conference on Information Assurance and Security (IAS)Jan 1, 20097 citations

Authenticated Key Exchange Secure under the Computational Diffie-Hellman Assumption.

Jooyoung Lee, Je Hong Park

Abstract. In this paper, we present a new authenticated key exchange(AKE) protocol and prove its security under the random oracle assumption and the computational Diffie-Hellman(CDH) assumption. In the extended Canetti-Krawczyk model, there has been no known AKE protocol based on the CDH assumption. Our protocol, called NAXOS+, is obtained by slightly modifying the NAXOS protocol proposed by LaMacchia, Lauter and Mityagin. We establish a formal security proof of NAXOS+ in the extended Canetti-Krawczyk model using as a main tool the trapdoor test presented by Cash, Kiltz and Shoup. Key words: authenticated key exchange, trapdoor test, computational Diffie-Hellman assumption, extended Canetti-Krawzcyk model 1

Jan 1, 200846 citations

Authenticated key exchange protocol under computational Diffie–Hellman assumption from trapdoor test technique

Hai Huang

SUMMARY This paper investigates authenticated key exchange (AKE) protocol under computational Diffie–Hellman assumption in the extended Canetti–Krawczyk model. The core technical component of our protocol is the trapdoor test technique, which is originally introduced to remove the gap Diffie–Hellman (GDH) assumption for the public key encryption schemes. Our contributions are twofold.First, we clarify some misunderstandings of the usage of the trapdoor test technique in AKE protocols showing its adaptation to the AKE protocols is not trivial. We point out some errors in some recent work which attempts to make use of the trapdoor test technique to remove GDH assumption.Second, based on trapdoor test technique, we propose an efficient extended Canetti–Krawczyk secure AKE protocol under computational Diffie–Hellman assumption instead of GDH assumption. Additionally, our protocol does not make use of NAXOS trick and has a tight reduction. In comparison with all existing AKE protocols with the properties as previously mentioned, our protocol with only three exponentiations is most efficient. Copyright © 2013 John Wiley & Sons, Ltd.

International Journal of Communication SystemsSep 23, 20138 citations

id-eCK Secure ID-Based Authenticated Key Exchange on Symmetric and Asymmetric Pairing

Atsushi Fujioka, Fumitaka Hoshino, Tetsutaro Kobayashi +3 more

In this paper, we propose an identity-based authenticated key exchange (ID-AKE) protocol that is secure in the identity-based extended Canetti-Krawczyk (id-eCK) model in the random oracle model under the gap Bilinear Diffie-Hellman assumption. The proposed ID-AKE protocol is the most efficient among the existing ID-AKE protocols that is id-eCK secure, and it can be extended to use in asymmetric pairing.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesJan 1, 20138 citations

Strongly-secure and Efficient Authenticated Key Exchange Protocol

Jinyue Xia

This paper presents an Authenticated Key Exchange(AKE) protocol,named AKE-1.Compared with previous protocols,the proposal is more efficient and proven to be safe in newly enhanced Canetti-Krawczyk(eCK07) model under the random oracle assumption and the Computational Diffie-Hellman(CDH) assumption.It uses a technique named trapdoor test,recently proposed by Cash,Kiltz and Shoup.In addition,it presents a one-pass variant(for only one entity on line) and three-pass variant(providing key confirmation) of AKE-1 for different applications.

Jisuanji gongchengJan 1, 20100 citations