IEICE TRANSACTIONS on Fundamentals
Efficient and Secure Authenticated Key Exchange Protocols in the eCK Model
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.1 pp.129-138
- Publication Date
- 2011/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E94.A.129
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
- Secure Protocol
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jooyoung LEE, Je Hong PARK, "Efficient and Secure Authenticated Key Exchange Protocols in the eCK Model" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 1, pp. 129-138, January 2011, doi: 10.1587/transfun.E94.A.129.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.129/_p
Copy
@ARTICLE{e94-a_1_129,
author={Jooyoung LEE, Je Hong PARK, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient and Secure Authenticated Key Exchange Protocols in the eCK Model},
year={2011},
volume={E94-A},
number={1},
pages={129-138},
abstract={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.},
keywords={},
doi={10.1587/transfun.E94.A.129},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Efficient and Secure Authenticated Key Exchange Protocols in the eCK Model
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 129
EP - 138
AU - Jooyoung LEE
AU - Je Hong PARK
PY - 2011
DO - 10.1587/transfun.E94.A.129
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2011
AB - 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.
ER -
English
