Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Systems and Software

Provably secure authenticated key exchange protocol under the CDH assumption

Jianjie Zhao, Dawu Gu

Published Jul 17, 2010• 11 citations
Publisher
DOI
10.1016/j.jss.2010.07.010

Related papers

A strongly secure pairing-free certificateless authenticated key agreement protocol under the CDH assumption

Haiyan Sun, Qiaoyan Wen, Wenmin Li

Science China Information Sciences•Jan 26, 2016•17 citations

A strengthened eCK secure identity based authenticated key agreement protocol based on the standard CDH assumption

Renu Mary Daniel, Anitha Thomas, Elijah Blessing Rajsingh +1 more

Information and Computation•Jul 11, 2023•12 citations

Provably Secure Two-Party Authenticated Key Exchange Protocol in eCK Model

Jianjie Zhao, Dawu Gu

Chinese Journal of Computers•May 17, 2011•2 citations

TMQV: A Strongly eCK-secure Diffie-Hellman Protocol without Gap Assumption.

Jiaxin Pan, Libin Wang

In this paper, we propose an authenticated key exchange (AKE) protocol under the computational Diffie-Hellman (CDH) assumption with respect to the strengthened eCK-security (seCK-security) of Sarr et al.. To date, many AKE protocols either are provably secure under a rather strong and non-standard assumption named as the gap Diffie-Hellman (GDH) assumption, or fall to practical attacks on the intermediate result leakage which can be captured by the seCK model. In order to remove the gap assumption and achieve stronger security requirements, we present the TMQV protocol using the twinning technique and the MQV key derivation method. With the help of trapdoor test theorem, TMQV is provably seCK-secure under the standard CDH assumption in the random oracle model. Compared with the related works, TMQV achieves not only stronger security but also higher implementation efficiency with weaker cryptographic assumptions.

Journal of Internet Services and Information Security•Jan 1, 2011•0 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, 2008•46 citations

Authenticated Key Exchange Protocols Based on Factoring Assumption

Hai Huang

Lecture notes in computer science•Jan 1, 2013•0 citations
In this paper, we propose an authenticated key exchange (AKE) protocol under the computational Diffie-Hellman (CDH) assumption with respect to the strengthened eCK-security (seCK-security) of Sarr et al.. To date, many AKE protocols either are provably secure under a rather strong and non-standard assumption named as the gap Diffie-Hellman (GDH) assumption, or fall to practical attacks on the intermediate result leakage which can be captured by the seCK model. In order to remove the gap assumption and achieve stronger security requirements, we present the TMQV protocol using the twinning technique and the MQV key derivation method. With the help of trapdoor test theorem, TMQV is provably seCK-secure under the standard CDH assumption in the random oracle model. Compared with the related works, TMQV achieves not only stronger security but also higher implementation efficiency with weaker cryptographic assumptions.
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