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 E-Business and Information System Security (EBISS)

Certificateless Key Agreement Protocol

Yixiang Chen

Published May 1, 2010• 1 citation
Publisher

Abstract

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. A new two party certificateless key agreement protocol (CL-KA) is proposed and we proved it secure in the random oracle model (ROM). Our protocol only requires each entity to compute one pairing, up to now, it turns out to be the most efficient one of all the previously known CL-KA schemes.

DOI
10.1109/ebiss.2010.5473707

Related papers

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

Efficient three-party authenticated key agreement protocol in certificateless cryptography

Hu Xiong, Zhong Chen, Zhiguang Qin

Key agreement protocols are multi-party protocols in which entities exchange public information allowing them to create a common secret key that is known only to those entities and which cannot be predetermined by any party. Key agreement can be achieved using a public key infrastructure or identity-based cryptography. However, the former suffers from a heavy certificate management burden, while the latter is subject to the so-called key escrow problem. Recently, the notion of certificateless public key cryptography (CL-PKC) was introduced to mitigate these limitations. In this paper, we introduce the notion of three-party authenticated key agreement into CL-PKC and propose a concrete certificateless three-party authenticated key agreement protocol. We show that the proposed protocol is secure (i.e. conforms to defined security attributes) while being efficient.

International Journal of Computer Mathematics•Jun 13, 2011•2 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

Secure Certificateless Two-Party Key Agreement with Short Message

Han-Yu Lin

Two-party key agreement protocol allows two communication parties to share a common key for secure communication. Constructed from the certificateless public key cryptography (CL-PKC), a certificateless key agreement (CL-KA) protocol can not only solve the key escrow problem inherited from identity-based systems, but also avoid the troublesome issue of certificate management. Although the topic of two-party CL-KA has been extensively studied during past few years, it is unknown whether such a protocol can be achieved with only one exchanged message. In this paper, we put this idea into practice and propose a new one-round CL-KA for two-party. Specifically, each party of the proposed protocol only has to transmit one group element for sharing a session key and still maintains low computational costs. Moreover, we analyze the security of our scheme in the extended Canetti-Krawzcyk (eCK) security model.DOI: http://dx.doi.org/10.5755/j01.itc.45.1.12595

Information Technology And Control•Mar 21, 2016•6 citations

Two Party Certificateless Key Agreement Schemes

Liu Wen

A pairing-free certificateless two party key agreement scheme(CL-KA) is proposed.This work is able demonstrates all existing CL-KA schemes(except for Lippold's scheme) are insecure in the eCK model.The scheme is secure in the eCK model as long as each party has at least one uncompromised secret.The scheme has proven to be secure in the random oracle model(ROM),assuming that the computational Diffie-Hellman assumption hold even if the key generation centre(KGC) learns the ephemeral secrets of both parties,or reveal secret values/replace public keys,but not both.The scheme eliminates pairing computation.It achieves efficiency in computational cost when compared with all the other known certificateless key agreement schemes.The scheme is more suitable for the restricted bandwidth of the communication environment,such as ad hoc networks,wireless sensors,and so on.

•Jan 1, 2011•0 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 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. A new two party certificateless key agreement protocol (CL-KA) is proposed and we proved it secure in the random oracle model (ROM). Our protocol only requires each entity to compute one pairing, up to now, it turns out to be the most efficient one of all the previously known CL-KA schemes.
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.
Key agreement protocols are multi-party protocols in which entities exchange public information allowing them to create a common secret key that is known only to those entities and which cannot be predetermined by any party. Key agreement can be achieved using a public key infrastructure or identity-based cryptography. However, the former suffers from a heavy certificate management burden, while the latter is subject to the so-called key escrow problem. Recently, the notion of certificateless public key cryptography (CL-PKC) was introduced to mitigate these limitations. In this paper, we introduce the notion of three-party authenticated key agreement into CL-PKC and propose a concrete certificateless three-party authenticated key agreement protocol. We show that the proposed protocol is secure (i.e. conforms to defined security attributes) while being efficient.
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.
Two-party key agreement protocol allows two communication parties to share a common key for secure communication. Constructed from the certificateless public key cryptography (CL-PKC), a certificateless key agreement (CL-KA) protocol can not only solve the key escrow problem inherited from identity-based systems, but also avoid the troublesome issue of certificate management. Although the topic of two-party CL-KA has been extensively studied during past few years, it is unknown whether such a protocol can be achieved with only one exchanged message. In this paper, we put this idea into practice and propose a new one-round CL-KA for two-party. Specifically, each party of the proposed protocol only has to transmit one group element for sharing a session key and still maintains low computational costs. Moreover, we analyze the security of our scheme in the extended Canetti-Krawzcyk (eCK) security model.DOI: http://dx.doi.org/10.5755/j01.itc.45.1.12595
A pairing-free certificateless two party key agreement scheme(CL-KA) is proposed.This work is able demonstrates all existing CL-KA schemes(except for Lippold's scheme) are insecure in the eCK model.The scheme is secure in the eCK model as long as each party has at least one uncompromised secret.The scheme has proven to be secure in the random oracle model(ROM),assuming that the computational Diffie-Hellman assumption hold even if the key generation centre(KGC) learns the ephemeral secrets of both parties,or reveal secret values/replace public keys,but not both.The scheme eliminates pairing computation.It achieves efficiency in computational cost when compared with all the other known certificateless key agreement schemes.The scheme is more suitable for the restricted bandwidth of the communication environment,such as ad hoc networks,wireless sensors,and so on.
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.