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

International Conference on Multimedia Information Networking and Security

A New ID-Based Authenticated Key Agreement Between Members of Distinct Domains

Song Xia, Juan You, Wenbao Han, Lei Wang

Published Jan 1, 2009• 1 citation
Publisher

Abstract

Most ID-based AKA protocols require that all parties are members of the same domain. In this paper, we present a new ID-based AKA protocol between members of distinct domains, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cash, Kiltz and Shoup. It is inspired on a new ID-based two-party authenticated key exchange protocol proposed by Hai Huang and Zhenfu Cao. We show that our scheme is secure in the enhanced Canetti-Krawczyk (eCK) model, which better supports the adversary's queries than previous AKA models. To the best of our knowledge, our scheme is the first ID-based AKA protocol between members of distinct domains provably secure in eCK model.

DOI
10.1109/mines.2009.79

Related papers

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

Strongly Secure Identity-based Authenticated Key Exchange Protocol

Jian Shu

Recently,LaMacchia et al.proposed the extended Canetti-Krawczyk(eCK) model,which captures all security properties of authenticated key enchange protocols.Most of existing identity-based authenticated key exchange protocols are not secure in the eCK model.This paper proposes an identity-based authenticated key exchange protocol,and the security of proposed protocol can be proved in the eCK model.When compaer with other schemes,the proposed protocol achieves efficiency in terms of computation and communication.The proposal achieve strong security,and can be proved under the random oracle assumption and the Gap Bilinear Diffie-Hellman assumption.

Journal of Chinese Computer Systems•Jan 1, 2011•0 citations

Efficient strongly-secure identity-based authenticated key agreement protocol

Jian Shu

Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.

Journal of Computer Applications•Jan 1, 2012•0 citations

An Improved Provably Secure Identity-Based Authenticated Key Agreement Protocol

Yang Li, Jianming Zhu, Wei Zhang +1 more

We revisit the identity-based (ID-based) key agreement protocol due to Wang et al. The protocol is highly efficient and suitable for practical applications except being vulnerable to Intermediate results leakage (IRL) and Key-compromise impersonation (KCI) attack. We propose an improved protocol following the Full Dual Exponential Challenge Response (FDCR-1) scheme to ensure the signature change every time. We also prove it to be secure in the strengthened extended Canetti -- Krawczyk (seCK) model provides better support for adversary's query than previous. In addition, the improved protocol also has an advantage over most existing protocols on security and efficiency.

International Conference on Management of e-Commerce and e-Government•Oct 1, 2014•0 citations

Practical Certificateless Authenticated Two-party Key Protocol

Jian Shu

Recently,Lippold et al.proposed certificateless authenticated two-party key agreement with provable security,their scheme suffers from computation burden.Basesd on twin diffie-hellman problem introduced by Cash,Kiltz and Shoup,A new scheme using bilinear pair is proposed.When compared with Lippold's scheme,the proposed protocol,with the same message bandwidth,achieves efficiency in computational cost.The security of the proposed scheme has been proven in the random oracle model under CDH assumption and BDH assumption.

Journal of Chinese Computer Systems•Jan 1, 2010•0 citations
Most ID-based AKA protocols require that all parties are members of the same domain. In this paper, we present a new ID-based AKA protocol between members of distinct domains, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cash, Kiltz and Shoup. It is inspired on a new ID-based two-party authenticated key exchange protocol proposed by Hai Huang and Zhenfu Cao. We show that our scheme is secure in the enhanced Canetti-Krawczyk (eCK) model, which better supports the adversary's queries than previous AKA models. To the best of our knowledge, our scheme is the first ID-based AKA protocol between members of distinct domains provably secure in eCK model.
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.
Recently,LaMacchia et al.proposed the extended Canetti-Krawczyk(eCK) model,which captures all security properties of authenticated key enchange protocols.Most of existing identity-based authenticated key exchange protocols are not secure in the eCK model.This paper proposes an identity-based authenticated key exchange protocol,and the security of proposed protocol can be proved in the eCK model.When compaer with other schemes,the proposed protocol achieves efficiency in terms of computation and communication.The proposal achieve strong security,and can be proved under the random oracle assumption and the Gap Bilinear Diffie-Hellman assumption.
Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.
We revisit the identity-based (ID-based) key agreement protocol due to Wang et al. The protocol is highly efficient and suitable for practical applications except being vulnerable to Intermediate results leakage (IRL) and Key-compromise impersonation (KCI) attack. We propose an improved protocol following the Full Dual Exponential Challenge Response (FDCR-1) scheme to ensure the signature change every time. We also prove it to be secure in the strengthened extended Canetti -- Krawczyk (seCK) model provides better support for adversary's query than previous. In addition, the improved protocol also has an advantage over most existing protocols on security and efficiency.
Recently,Lippold et al.proposed certificateless authenticated two-party key agreement with provable security,their scheme suffers from computation burden.Basesd on twin diffie-hellman problem introduced by Cash,Kiltz and Shoup,A new scheme using bilinear pair is proposed.When compared with Lippold's scheme,the proposed protocol,with the same message bandwidth,achieves efficiency in computational cost.The security of the proposed scheme has been proven in the random oracle model under CDH assumption and BDH assumption.