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

Security Proof for the Improved Ryu-Yoon-Yoo Identity-Based Key Agreement Protocol.

Shengbao Wang, Zhenfu Cao, Kim‐Kwang Raymond Choo, Lihua Wang

Published Jan 1, 2008• 3 citations
OpenAlex

Abstract

Abstract. Key agreement protocols are essential for secure communications in open and distributed environments. The protocol design is, however, extremely error-prone as evidenced by the iterative process of fixing discovered attacks on published protocols. We revisit an efficient identity-based (ID-based) key agreement protocol due to Ryu, Yoon and Yoo. The protocol is highly efficient and suitable for real-world applications despite offering no resilience against key-compromise impersonation (K-CI). We then show that the protocol is, in fact, insecure against reflection attacks. A slight modification to the protocol is proposed, which results in significant benefits for the security of the protocol without compromising on its efficiency. Finally, we prove the improved protocol secure in a widely accepted model.

Related papers

Cryptanalysis and improvement of the Lee-Lee identity-based key agreement protocol

Shuangqing Liu, Shengbao Wang, Qizhen Wang +2 more

Authenticated key agreement protocols are essential for secure communications in open and distributed environments. The protocol design is, however, extremely error-prone due to the inherent complexity of this problem. In this paper, we revisit an efficient identity-based (ID-based) authenticated key agreement protocols due to Lee and Lee. We reveal previously unpublished flaws in the protocol, whereby we demonstrate that it is vulnerable to key control attacks which violate its claimed security attributes. We then put forward an improved protocol to fix the identified security problem.

International Conference on Information Management and Engineering (ICIME)•Jan 1, 2010•0 citations

A New Efficient ID-Based Authenticated Key Agreement Protocol.

Quan Yuan, Songping Li

Recently Eun-Kyung Ryu, Eun-Jun Yoon, and Kee-Young Yoo proposed an efficient ID-based authenticated key agreement with paring[11]. They argued that it is secure and efficient. In this paper, we show this protocol is doesn’t satisfy the Key-Compromise Impersonate property and it is not secure against key reveal attack. Then we propose our protocol from this protocol and shim’s protocol[15], its security and efficiency was analyzed.

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

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

A Secure ID-Based Explicit Authenticated Key Agreement Protocol without Key Escrow

Mengbo Hou, Qiuliang Xu

Key agreement protocols are essential for secure communications in open and distributed environments. Identity-based cryptography has become extremely fashionable in the last few years for its special advantages. In this paper, we point out some flaw in the scheme proposed by Wang et al., then we present a two-party identity-based explicit authenticated key agreement protocol with key confirmation, which was inspired on a new identity-based encryption scheme first proposed by Gentry and can be used properly in the escrowless mode. The scheme captures the attributes of known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience, perfect forward secrecy, and no-key control. Especially, the scheme captures the PKG forward secrecy property. The PKG still could not recover all the userspsila past session keys even he knows the long-term private keys of all users.

International Conference on Information Assurance and Security (IAS)•Jan 1, 2009•1 citation

Security-provable Identity-based Authenticated Key Agreement Protocol

Yafei Wang

Most Identity-based Authenticated Key Agreement(ID-AKA) protocols have poor performance on security and the efficiency.To solve this problem,this paper presents an improved ID-AKA protocol.Security proof with the modular approach in the mBR model is provided,which means the new protocol satisfies perfect forward security,PKG forward security,resistant to key-compromise impersonation.Furthermore,the new protocol can satisfy resistance to leakage of ephemeral secrets.Compared with previous ID-AKA protocols which can satisfy the same security properties,the new protocol has higher efficiency.

Jisuanji gongcheng•Jan 1, 2012•0 citations
Abstract. Key agreement protocols are essential for secure communications in open and distributed environments. The protocol design is, however, extremely error-prone as evidenced by the iterative process of fixing discovered attacks on published protocols. We revisit an efficient identity-based (ID-based) key agreement protocol due to Ryu, Yoon and Yoo. The protocol is highly efficient and suitable for real-world applications despite offering no resilience against key-compromise impersonation (K-CI). We then show that the protocol is, in fact, insecure against reflection attacks. A slight modification to the protocol is proposed, which results in significant benefits for the security of the protocol without compromising on its efficiency. Finally, we prove the improved protocol secure in a widely accepted model.
Authenticated key agreement protocols are essential for secure communications in open and distributed environments. The protocol design is, however, extremely error-prone due to the inherent complexity of this problem. In this paper, we revisit an efficient identity-based (ID-based) authenticated key agreement protocols due to Lee and Lee. We reveal previously unpublished flaws in the protocol, whereby we demonstrate that it is vulnerable to key control attacks which violate its claimed security attributes. We then put forward an improved protocol to fix the identified security problem.
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.
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.
Key agreement protocols are essential for secure communications in open and distributed environments. Identity-based cryptography has become extremely fashionable in the last few years for its special advantages. In this paper, we point out some flaw in the scheme proposed by Wang et al., then we present a two-party identity-based explicit authenticated key agreement protocol with key confirmation, which was inspired on a new identity-based encryption scheme first proposed by Gentry and can be used properly in the escrowless mode. The scheme captures the attributes of known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience, perfect forward secrecy, and no-key control. Especially, the scheme captures the PKG forward secrecy property. The PKG still could not recover all the userspsila past session keys even he knows the long-term private keys of all users.
Most Identity-based Authenticated Key Agreement(ID-AKA) protocols have poor performance on security and the efficiency.To solve this problem,this paper presents an improved ID-AKA protocol.Security proof with the modular approach in the mBR model is provided,which means the new protocol satisfies perfect forward security,PKG forward security,resistant to key-compromise impersonation.Furthermore,the new protocol can satisfy resistance to leakage of ephemeral secrets.Compared with previous ID-AKA protocols which can satisfy the same security properties,the new protocol has higher efficiency.