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

A Certificateless Authentication Key Agreement Protocol to mitigate MITM and Key-Compromise Impersonation Attacks

Renu Srivastava

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

To overcome the key escrow issues of the identity based cryptography, Shi Yijuan and Ll Jianhua [11] proposed a new Certificateless Two-party Authentication Key Agreement (CL-2AKA) protocol. In this paper an improved CL-2AKA Protocol has been proposed. The proposed protocol CAKA (Certificateless Authentication Key Agreement Protocol) is based on the algebraic properties of the pairing. The proposed protocol attempts to mitigate the man-in-the middle and Keycompromise impersonation attacks. is found to be more efficient on computation and has more compact cipher text than the existing schemes.

Related papers

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

Two-party authenticated key agreement in certificateless public key cryptography

Yijuan Shi, Jianhua Li

Certificateless public key cryptography was introduced to overcome the key escrow limitation of the identity-based cryptography. It combines the advantages of the identity-based cryptography and the traditional PKI. Many certificateless public key encryption and signature schemes have been proposed. However, the key agreement in CL-PKE is seldom discussed. In this paper, we present a new certificateless two party authentication key agreement protocol and prove its security attributes. Compared with the existing protocol, our protocol is more efficient.

Wuhan University Journal of Natural Sciences•Jan 1, 2007•45 citations

On the security of certificateless authenticated key agreement protocol

Mengbo Hou, Qiuliang Xu

Authenticated key agreement protocol is a fundamental building block for ensuring private communications between two or more parties over an insecure network. Certificateless public key cryptography (CL-PKC) combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In the recent work, Wang et al. proposed an efficient two-party certificateless authenticated key agreement protocol from pairings used to protect the Web client/server communication. However, we found the scheme cannot withstand key compromise impersonation attack, and also, is vulnerable to one form of the man-in-the-middle attack -- key replicating attack, thus it doesn't possess some desirable security attributes,such as key compromise impersonation resilience and key integrity. We analyze the key replicating attack against the protocol in the BR93 security model in detail, and demonstrate that the protocol is not secure if the adversary was allowed to send a reveal query to reveal non-partner players who had accepted the same session key.

International Conference on Information Technology in Medicine and Education•Aug 1, 2009•2 citations

A Two-party certificateless authenticated key agreement protocol without pairing

Mengbo Hou, Qiuliang Xu

Authenticated key agreement (AK) protocol is crucial in providing data confidentiality and integrity for subsequent communications among two or more parties over a public network. Certificateless public key cryptography (CL-PKC) combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional public key cryptography (PKC). Unfortunately, construction of CL-PKC and AK protocols has so far depended on the use of identity-based encryption, which results in the bilinear pairing-based schemes that need costly operations. We present a secure certificateless authenticated key agreement protocol without paring, based on the certificateless encryption scheme proposed by J. Baek et al. It shows that the newly proposed scheme is of nice efficiency and practical. Moreover, it provides perfect forward secrecy, PKG forward secrecy and almost all the other known security attributes, such as known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience, known session-specific temporary information security, message independence and no key control.

IEEE International Conference on Computer Science and Information Technology•Jan 1, 2009•36 citations

Certificateless Two Party Key Agreement Protocol

Wenhao Liu, Chunxiang Xu, Jian Feng Xu

Certificateless cryptography aims at combining the advantages of identity based and public key cryptography in order to avoid the key escrow problem inherent in the identity based cryptography and cumbersome certificate management in the traditional public key infrastructure. The provably secure certificateless key agreement protocol is proposed by Lippold et al. in 2009, but their protocol suffers from computation burden. Owing to the above-mentioned situations, a new certificateless two party key agreement protocol (CL-KA) is proposed and the security attributes are analyzed in the extended Canetti-Krawzcyk(eCK) security model. Our protocol only requires each entity to compute two pairings, up to now, it turns out to be the most efficient one of all the previously known security CL-KA schemes.

International Conference on Multimedia Information Networking and Security•Jan 1, 2010•3 citations

Certificateless two-party key agreement scheme without bilinear pairing

XU Chun-xiang

A few of certificateless key agreement schemes have been proposed in recent years,all of them need pairing operations,what's more,most of them are vulnerable to the key compromise impersonation attack and resistance to leakage of ephemeral keys.The provably secure certificateless key agreement protocol was proposed by Lippold in 2009,but their protocol suffered from computation burden.In order to solve the above-mentioned problem,this paper proposed a new pairing-free certificateless two party key agreement scheme (CL-KA) and presened its security properties.The new scheme was secure as long as each party had at least one uncompromised secret.Thus,the new scheme was secure even if the key generation centre learned the ephemeral secrets of both parties.The new scheme achieves efficiency in computational cost when compared with Lippold's protocol.

Jisuanji yingyong yanjiu•Jan 1, 2010•3 citations
To overcome the key escrow issues of the identity based cryptography, Shi Yijuan and Ll Jianhua [11] proposed a new Certificateless Two-party Authentication Key Agreement (CL-2AKA) protocol. In this paper an improved CL-2AKA Protocol has been proposed. The proposed protocol CAKA (Certificateless Authentication Key Agreement Protocol) is based on the algebraic properties of the pairing. The proposed protocol attempts to mitigate the man-in-the middle and Keycompromise impersonation attacks. is found to be more efficient on computation and has more compact cipher text than the existing schemes.
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.
Certificateless public key cryptography was introduced to overcome the key escrow limitation of the identity-based cryptography. It combines the advantages of the identity-based cryptography and the traditional PKI. Many certificateless public key encryption and signature schemes have been proposed. However, the key agreement in CL-PKE is seldom discussed. In this paper, we present a new certificateless two party authentication key agreement protocol and prove its security attributes. Compared with the existing protocol, our protocol is more efficient.
Authenticated key agreement protocol is a fundamental building block for ensuring private communications between two or more parties over an insecure network. Certificateless public key cryptography (CL-PKC) combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In the recent work, Wang et al. proposed an efficient two-party certificateless authenticated key agreement protocol from pairings used to protect the Web client/server communication. However, we found the scheme cannot withstand key compromise impersonation attack, and also, is vulnerable to one form of the man-in-the-middle attack -- key replicating attack, thus it doesn't possess some desirable security attributes,such as key compromise impersonation resilience and key integrity. We analyze the key replicating attack against the protocol in the BR93 security model in detail, and demonstrate that the protocol is not secure if the adversary was allowed to send a reveal query to reveal non-partner players who had accepted the same session key.
Authenticated key agreement (AK) protocol is crucial in providing data confidentiality and integrity for subsequent communications among two or more parties over a public network. Certificateless public key cryptography (CL-PKC) combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional public key cryptography (PKC). Unfortunately, construction of CL-PKC and AK protocols has so far depended on the use of identity-based encryption, which results in the bilinear pairing-based schemes that need costly operations. We present a secure certificateless authenticated key agreement protocol without paring, based on the certificateless encryption scheme proposed by J. Baek et al. It shows that the newly proposed scheme is of nice efficiency and practical. Moreover, it provides perfect forward secrecy, PKG forward secrecy and almost all the other known security attributes, such as known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience, known session-specific temporary information security, message independence and no key control.
Certificateless cryptography aims at combining the advantages of identity based and public key cryptography in order to avoid the key escrow problem inherent in the identity based cryptography and cumbersome certificate management in the traditional public key infrastructure. The provably secure certificateless key agreement protocol is proposed by Lippold et al. in 2009, but their protocol suffers from computation burden. Owing to the above-mentioned situations, a new certificateless two party key agreement protocol (CL-KA) is proposed and the security attributes are analyzed in the extended Canetti-Krawzcyk(eCK) security model. Our protocol only requires each entity to compute two pairings, up to now, it turns out to be the most efficient one of all the previously known security CL-KA schemes.
A few of certificateless key agreement schemes have been proposed in recent years,all of them need pairing operations,what's more,most of them are vulnerable to the key compromise impersonation attack and resistance to leakage of ephemeral keys.The provably secure certificateless key agreement protocol was proposed by Lippold in 2009,but their protocol suffered from computation burden.In order to solve the above-mentioned problem,this paper proposed a new pairing-free certificateless two party key agreement scheme (CL-KA) and presened its security properties.The new scheme was secure as long as each party had at least one uncompromised secret.Thus,the new scheme was secure even if the key generation centre learned the ephemeral secrets of both parties.The new scheme achieves efficiency in computational cost when compared with Lippold's protocol.