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

arXiv:1312.4363

On the Security of Wang's Provably Secure Identity-based Key Agreement Protocol

Maurizio Adriano Strangio

Published Dec 16, 2013• 0 citations
arXivHTMLPDF

Abstract

In a 2005 IACR report, Wang published an efficient identity-based key agreement protocol (IDAK) suitable for resource constrained devices. The author shows that the IDAK key agreement protocol is secure in the Bellare-Rogaway model with random oracles and also provides separate ad-hoc security proofs claiming that the IDAK protocol is not vulnerable to Key Compromise Impersonation attacks and also enjoys Perfect Forward Secrecy (PFS). In this report, we review the security properties of the protocol and point out that it is vulnerable to Unknown Key Share attacks. Although such attacks are often difficult to setup in a real world environment they are nevertheless interesting from a theoretical point of view so we provide a version of the protocol that fixes the problem in a standard way. We also provide a security proof of the IDAK protocol based on the Gap Bilinear Diffie Hellman and random oracle assumptions in the stronger extended Canetti-Krawczyk security model of distributed computing.

DOI
10.48550/arxiv.1312.4363

Related papers

Provably secure identity-based authenticated key agreement protocol and its application

Shuai Shao, Bin Tian, Xin Wang +1 more

We point out the RYY+ identity-based (ID-based) key agreement protocol is vulnerable to Key-compromise impersonation (KCI) attack and Intermediate results leakage (IRL) attack. Then we give the improved protocol which provides KCI and IRL resistance. The novel protocol is provably secure under the gap Bilinear Diffie-Hellman assumption in the seCK model, which enhances the adversary's queries comparing with previous ID based AKE models. The proposed scheme also has an advantage over most previous schemes on security and efficiency.

IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)•Oct 1, 2012•0 citations

Strongly-Secure Identity-based Key Agreement and Anonymous Extension.

Sherman S. M. Chow, Kim‐Kwang Raymond Choo

Abstract. We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in the random oracle model, only a weak adversarial model is considered – the adversary is not allowed to ask Session-Key Reveal queries that will allow the adversary to learn previously established session keys. Recent research efforts devoted to providing a stronger level of security require strong assumptions, such as assuming that the simulator has access to a non-existential computational or decisional oracle. In this work, we propose an ID-based key agreement protocol and prove its security in the widely accepted indistinguishability-based model of Canetti and Krawczyk. In our proof, the simulator does not require access to any non-existential computational or decisional oracle. We then extend our basic protocol to support ad-hoc anonymous key agreement with bilateral privacy. To the best of our knowledge, this is the first protocol of its kind as previously published protocols are for fixed group and provide only unilateral privacy (i.e., only one of the protocol participants enjoy anonymity).

•Jan 1, 2007•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

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

An Efficient Tripartite Identity-Based Authenticated Key Agreement Protocol

Xiaotong Fu, Shufang Guo, Ruijun Shi

In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2013•2 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
In a 2005 IACR report, Wang published an efficient identity-based key agreement protocol (IDAK) suitable for resource constrained devices. The author shows that the IDAK key agreement protocol is secure in the Bellare-Rogaway model with random oracles and also provides separate ad-hoc security proofs claiming that the IDAK protocol is not vulnerable to Key Compromise Impersonation attacks and also enjoys Perfect Forward Secrecy (PFS). In this report, we review the security properties of the protocol and point out that it is vulnerable to Unknown Key Share attacks. Although such attacks are often difficult to setup in a real world environment they are nevertheless interesting from a theoretical point of view so we provide a version of the protocol that fixes the problem in a standard way. We also provide a security proof of the IDAK protocol based on the Gap Bilinear Diffie Hellman and random oracle assumptions in the stronger extended Canetti-Krawczyk security model of distributed computing.
We point out the RYY+ identity-based (ID-based) key agreement protocol is vulnerable to Key-compromise impersonation (KCI) attack and Intermediate results leakage (IRL) attack. Then we give the improved protocol which provides KCI and IRL resistance. The novel protocol is provably secure under the gap Bilinear Diffie-Hellman assumption in the seCK model, which enhances the adversary's queries comparing with previous ID based AKE models. The proposed scheme also has an advantage over most previous schemes on security and efficiency.
Abstract. We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in the random oracle model, only a weak adversarial model is considered – the adversary is not allowed to ask Session-Key Reveal queries that will allow the adversary to learn previously established session keys. Recent research efforts devoted to providing a stronger level of security require strong assumptions, such as assuming that the simulator has access to a non-existential computational or decisional oracle. In this work, we propose an ID-based key agreement protocol and prove its security in the widely accepted indistinguishability-based model of Canetti and Krawczyk. In our proof, the simulator does not require access to any non-existential computational or decisional oracle. We then extend our basic protocol to support ad-hoc anonymous key agreement with bilateral privacy. To the best of our knowledge, this is the first protocol of its kind as previously published protocols are for fixed group and provide only unilateral privacy (i.e., only one of the protocol participants enjoy anonymity).
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,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.
In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.
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.