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

Towards Security Two-part Authenticated Key Agreement Protocols.

Songping Li, Quan Yuan, Jin Li

Published Jan 1, 2005• 20 citations
OpenAlex

Abstract

Abstract. We first present a new security 2-AK protocol, which is more secure and more efficient than previously proposed ones. Meanwhile, we point that Xie’s ID-2-AK protocol modified from McCullagh-Barreto in CT-RSA 2005 doesn’t provide protection against KCI attack likewise, and finally utilize the modular arithmetic, first proposed in MQV and also used in Kim, to get a modified new ID-2-AK protocol. On second thoughts, we give another ID-2-AK protocol utilizing the operation of addition in finite field like our forenamed 2-AK protocol. The two ID-2-AK protocols are in possession of all the desired security attributes. We also compare our new protocols with others in terms of computational cost and security properties. Keywords. key management, authenticated protocol, ID-based, Key Compromise Impersonation 1

Related papers

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

On Security Proof of McCullagh-Barreto's Key Agreement Protocol and its Variants.

Zhaohui Cheng, Liqun Chen

McCullagh and Barreto presented an identity-based authenticated key agreement protocol in CT-RSA 2005. Their protocol was found to be vulnerable to a key-compromise impersonation attack. In order to recover the weakness, McCullagh and Barreto, and Xie proposed two variants of the protocol respectively. In each of these works, a security proof of the proposed protocol was presented. In this paper, we revisit these three security proofs and show that all the reductions in these proofs are invalid, because the property of indistinguishability between their simulation and the real world was not held. As a replacement, we slightly modify the McCullagh and Barreto’s second protocol and then formally analyse the security of the modified scheme in the Bellare-Rogaway key agreement model.

•Jan 1, 2005•12 citations

Analysis and improvement of ID-based authenticated key agreement protocols

Qiuliang Xu

The security attributes of three provable secure ID-based authenticated key agreement protocols are analyzed,and an enhanced ID-based authenticated key agreement protocol is presented based on the previous work.The new scheme achieves most of the known security attributes,such as known-key secrecy,key-compromise impersonation resilience,unknown key-share resilience,no-key control and message independence,especially the PKG-forward secrecy and known session-specific temporary information secrecy attributes,meanwhile keeping with the nice efficiency.

Computer Engineering and Applications Journal•Jan 1, 2010•0 citations

Revisit Of McCullagh-Barreto Two-Party ID-Based Authenticated Key Agreement Protocols.

Kim‐Kwang Raymond Choo

The recently proposed two-party ID-based authenticated key agreement protocols (with and without escrow) and its variant resistant to key-compromise impersonation by McCullagh & Barreto are revisited. The protocol carries a proof of security in the Bellare & Rogaway (1993) model. In this paper, it is demonstrated that the protocols and its variant are not secure if the adversary is allowed to send a Reveal query to reveal non-partner players who had accepted the same session key.

•Jan 1, 2004•3 citations

Key-Compromise Impersonation Attacks on Some Certificateless Key Agreement Protocols and Two Improved Protocols

Gao Meng, Futai Zhang

Certificateless public key cryptography (CL-PKC) is a new paradigm in public key cryptography which avoids the inherent key escrow problem of identity-based public key cryptography (ID-PKC) and yet requires no certificates to guarantee the authenticity of users' public keys. It was first introduced by Al-Riyami and Paterson in 2003. Subsequently, several certificateless two-party key agreement protocols were presented. Unfortunately, some of these protocols are not as secure as they were claimed to be. We will show that some existing certificateless key agreement protocols do not satisfy the requirements of key-compromise impersonation security and known session-specific temporary information security. Further more, we present two improved certificateless authenticated two-party key agreement protocols which possess all security attributes of a key agreement protocol.

International Workshop on Education Technology and Computer Science•Jan 1, 2009•5 citations

Identity Based Authenticated Key Agreement Protocols from Pairings.

Liqun Chen, Caroline Kudla

Abstract. We investigate a number of issues related to identity based authenticated key agreement protocols using the Weil or Tate pairings. These issues include how to make protocols efficient; how to avoid key escrow by a Trust Authority (TA) who issues identity based private keys for users, and how to allow users to use different Trusted Authorities. We describe a few authenticated key agreement (AK) protocols and AK with key confirmation (AKC) protocols which are modified from Smart’s AK protocol [Sm02]. We study the security of these protocols heuristically and using provable security methods. In addition, we prove that our AK protocol is immune to key compromise impersonation attacks, and we also show that our second protocol has the TA forward secrecy property (which we define to mean that the compromise of the TA’s private key will not compromise previously established session keys). We also show that this TA forward secrecy property implies that the protocol has the perfect forward secrecy property. 1

•Jan 1, 2002•14 citations
Abstract. We first present a new security 2-AK protocol, which is more secure and more efficient than previously proposed ones. Meanwhile, we point that Xie’s ID-2-AK protocol modified from McCullagh-Barreto in CT-RSA 2005 doesn’t provide protection against KCI attack likewise, and finally utilize the modular arithmetic, first proposed in MQV and also used in Kim, to get a modified new ID-2-AK protocol. On second thoughts, we give another ID-2-AK protocol utilizing the operation of addition in finite field like our forenamed 2-AK protocol. The two ID-2-AK protocols are in possession of all the desired security attributes. We also compare our new protocols with others in terms of computational cost and security properties. Keywords. key management, authenticated protocol, ID-based, Key Compromise Impersonation 1
McCullagh and Barreto presented an identity-based authenticated key agreement protocol in CT-RSA 2005. Their protocol was found to be vulnerable to a key-compromise impersonation attack. In order to recover the weakness, McCullagh and Barreto, and Xie proposed two variants of the protocol respectively. In each of these works, a security proof of the proposed protocol was presented. In this paper, we revisit these three security proofs and show that all the reductions in these proofs are invalid, because the property of indistinguishability between their simulation and the real world was not held. As a replacement, we slightly modify the McCullagh and Barreto’s second protocol and then formally analyse the security of the modified scheme in the Bellare-Rogaway key agreement model.
The security attributes of three provable secure ID-based authenticated key agreement protocols are analyzed,and an enhanced ID-based authenticated key agreement protocol is presented based on the previous work.The new scheme achieves most of the known security attributes,such as known-key secrecy,key-compromise impersonation resilience,unknown key-share resilience,no-key control and message independence,especially the PKG-forward secrecy and known session-specific temporary information secrecy attributes,meanwhile keeping with the nice efficiency.
Certificateless public key cryptography (CL-PKC) is a new paradigm in public key cryptography which avoids the inherent key escrow problem of identity-based public key cryptography (ID-PKC) and yet requires no certificates to guarantee the authenticity of users' public keys. It was first introduced by Al-Riyami and Paterson in 2003. Subsequently, several certificateless two-party key agreement protocols were presented. Unfortunately, some of these protocols are not as secure as they were claimed to be. We will show that some existing certificateless key agreement protocols do not satisfy the requirements of key-compromise impersonation security and known session-specific temporary information security. Further more, we present two improved certificateless authenticated two-party key agreement protocols which possess all security attributes of a key agreement protocol.
Abstract. We investigate a number of issues related to identity based authenticated key agreement protocols using the Weil or Tate pairings. These issues include how to make protocols efficient; how to avoid key escrow by a Trust Authority (TA) who issues identity based private keys for users, and how to allow users to use different Trusted Authorities. We describe a few authenticated key agreement (AK) protocols and AK with key confirmation (AKC) protocols which are modified from Smart’s AK protocol [Sm02]. We study the security of these protocols heuristically and using provable security methods. In addition, we prove that our AK protocol is immune to key compromise impersonation attacks, and we also show that our second protocol has the TA forward secrecy property (which we define to mean that the compromise of the TA’s private key will not compromise previously established session keys). We also show that this TA forward secrecy property implies that the protocol has the perfect forward secrecy property. 1