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

Artificial Intelligence and Symbolic Computation

ID-based one-pass authenticated key establishment

M. Choudary Gorantla, Colin Boyd, Juan Manuel González Nieto

Published Jan 1, 2008• 30 citations
OpenAlex

Abstract

One-pass authenticated key establishment (AKE) protocols are arguably better suited to the ID-based environment than their two-pass counterparts. However, there is no ID-based one-pass AKE protocol proposed in the literature with a proof of security in an appropriate model. This paper addresses the current gap by proposing a new ID-based one-pass AKE protocol and proving it secure in a formal model. The security of the new protocol is treated under a model adapted from a formal security model for traditional certificate based AKE protocols. The proof of security is in the random oracle model and is based on the hardness of the bilinear Diffie-Hellman problem. The protocol also turns out to be the most efficient of all the previously known protocols. It can work over a class of asymmetric pairings for better efficiency at higher bit security levels.

Related papers

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 Sciences•Jan 1, 2013•8 citations

An ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem

Hai Huang, Zhenfu Cao

In this paper, we present a new ID-based two-party authenticated key exchange (AKE) protocol, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cash, Kiltz and Shoup. We show that our scheme is secure under bilinear Diffie-Hellman (BDH) assumption in the enhanced Canetti-Krawczyk (eCK) model, which better supports the adversary's queries than previous AKE models. To the best of our knowledge, our scheme is the first ID-based AKE protocol provably secure in eCK model.

ACM Asia Conference on Computer and Communications Security (ASIA CCS)•Mar 10, 2009•78 citations

IDOAKE: strongly secure ID‐based one‐pass authenticated key exchange protocol

Hai Huang, Zhenfu Cao

Abstract ID‐based one‐pass authenticated key exchange protocol allows the sender Alice to generate a session key without interacting with receiver Bob. As a result, it is better suitable for some application scenarios than the two‐pass counterpart. However, currently there are few ID‐based one‐pass authenticated key exchange protocols with a security proof in a formal model. The paper investigates the ID‐based one‐pass authenticated key exchange protocol in the enhanced Canetti–Krawczyk (eCK) model. We propose a new ID‐based one‐pass authenticated key exchange protocol IDOAKE, which is shown secure under Bilinear Diffie–Hellman (BDH) assumption in the eCK model. To the best of our knowledge, our protocol is the first provably secure ID‐based one‐pass authenticated key exchange in the eCK model. Copyright © 2010 John Wiley & Sons, Ltd.

Security and Communication Networks•Dec 3, 2010•5 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 gongcheng•Jan 1, 2010•0 citations

An Efficient One-Way Authenticated Key Exchange Protocol for Anonymity Networks

Mingping Qi, Jianhua Chen

Authenticated key exchange (AKE) is a crucial cryptographic primitive used for establishing an authenticated and confidential communication channel between parties, which has been widely used in our daily life when we surf on the Internet. However, in past decades mutual AKE protocols have been studied extensively in theory, while in many practical environments such as in the Tor anonymity network the mutual authentication property is undesirable. Meanwhile, considering privacy protection is getting more and more attention and one-way AKE protocols play an important role in privacy protection, so no matter in theory or in practice, it is quite meaningful to conduct research on the one-way AKE protocols. In this article, we present a new efficient anonymous one-way AKE protocol, which has strong anonymity and security properties guarantee, and efficiency advantages. Moreover, our new scheme has tight security reduction and is formally proved secure in the random oracle model under the Gap-DH and XCR signature security assumptions.

IEEE Systems Journal•May 5, 2020•2 citations

eCK Secure Single Round ID-based Authenticated Key Exchange Protocols with Master Perfect Forward Secrecy (Extended Version)

Tapas Pandit, Rana Barua, Somanath Tripathy

Recently, LaMacchia, Lauter and Mityagin proposed the extended Canetti-Krawczyk (eCK) model for Authenticated Key Exchange (AKE) protocols that covers many attacks on existing models. An ID-based AKE protocol with Perfect Forward Secrecy (PFS) (respectively Master Perfect Forward Secrecy (MPFS)) ensures that revelation of the static keys of the parties (respectively the master secret key of the private key generator), must not compromise even a single bit of the session keys of the past sessions between the parties. Currently, to the best of our knowledge, there is no ID-based eCK secure single round AKE protocol with either PFS or MPFS. In our preliminary version [18] we have proposed, without proofs, ID-based eCK secure single round AKE protocols with PFS and MPFS in the random oracle model. To achieve this, we also have constructed ID-based eCK secure single round AKE protocols, one without Master Forward Secrecy (MFS) and one with MFS, almost at the same computational cost as the existing efficient ID-based eCK Secure Single Round AKE protocols. In this full version, we provide proofs to show that all of our protocols are secure under the Gap Bilinear Diffie-Hellman (GBDH) problem.

Journal of Wireless Mobile Networks Ubiquitous Computing and Dependable Applications•Jan 1, 2014•1 citation
One-pass authenticated key establishment (AKE) protocols are arguably better suited to the ID-based environment than their two-pass counterparts. However, there is no ID-based one-pass AKE protocol proposed in the literature with a proof of security in an appropriate model. This paper addresses the current gap by proposing a new ID-based one-pass AKE protocol and proving it secure in a formal model. The security of the new protocol is treated under a model adapted from a formal security model for traditional certificate based AKE protocols. The proof of security is in the random oracle model and is based on the hardness of the bilinear Diffie-Hellman problem. The protocol also turns out to be the most efficient of all the previously known protocols. It can work over a class of asymmetric pairings for better efficiency at higher bit security levels.
In this paper, we present a new ID-based two-party authenticated key exchange (AKE) protocol, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cash, Kiltz and Shoup. We show that our scheme is secure under bilinear Diffie-Hellman (BDH) assumption in the enhanced Canetti-Krawczyk (eCK) model, which better supports the adversary's queries than previous AKE models. To the best of our knowledge, our scheme is the first ID-based AKE protocol provably secure in eCK model.
Abstract ID‐based one‐pass authenticated key exchange protocol allows the sender Alice to generate a session key without interacting with receiver Bob. As a result, it is better suitable for some application scenarios than the two‐pass counterpart. However, currently there are few ID‐based one‐pass authenticated key exchange protocols with a security proof in a formal model. The paper investigates the ID‐based one‐pass authenticated key exchange protocol in the enhanced Canetti–Krawczyk (eCK) model. We propose a new ID‐based one‐pass authenticated key exchange protocol IDOAKE, which is shown secure under Bilinear Diffie–Hellman (BDH) assumption in the eCK model. To the best of our knowledge, our protocol is the first provably secure ID‐based one‐pass authenticated key exchange in the eCK model. Copyright © 2010 John Wiley & Sons, Ltd.
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.
Authenticated key exchange (AKE) is a crucial cryptographic primitive used for establishing an authenticated and confidential communication channel between parties, which has been widely used in our daily life when we surf on the Internet. However, in past decades mutual AKE protocols have been studied extensively in theory, while in many practical environments such as in the Tor anonymity network the mutual authentication property is undesirable. Meanwhile, considering privacy protection is getting more and more attention and one-way AKE protocols play an important role in privacy protection, so no matter in theory or in practice, it is quite meaningful to conduct research on the one-way AKE protocols. In this article, we present a new efficient anonymous one-way AKE protocol, which has strong anonymity and security properties guarantee, and efficiency advantages. Moreover, our new scheme has tight security reduction and is formally proved secure in the random oracle model under the Gap-DH and XCR signature security assumptions.
Recently, LaMacchia, Lauter and Mityagin proposed the extended Canetti-Krawczyk (eCK) model for Authenticated Key Exchange (AKE) protocols that covers many attacks on existing models. An ID-based AKE protocol with Perfect Forward Secrecy (PFS) (respectively Master Perfect Forward Secrecy (MPFS)) ensures that revelation of the static keys of the parties (respectively the master secret key of the private key generator), must not compromise even a single bit of the session keys of the past sessions between the parties. Currently, to the best of our knowledge, there is no ID-based eCK secure single round AKE protocol with either PFS or MPFS. In our preliminary version [18] we have proposed, without proofs, ID-based eCK secure single round AKE protocols with PFS and MPFS in the random oracle model. To achieve this, we also have constructed ID-based eCK secure single round AKE protocols, one without Master Forward Secrecy (MFS) and one with MFS, almost at the same computational cost as the existing efficient ID-based eCK Secure Single Round AKE protocols. In this full version, we provide proofs to show that all of our protocols are secure under the Gap Bilinear Diffie-Hellman (GBDH) problem.