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

Wuhan University Journal of Natural Sciences

Provable efficient certificateless group key exchange protocol

Chunjie Cao, Jianfeng Ma, SangJae Moon

Published Jan 1, 2007• 16 citations
Publisher

Abstract

Certificateless public key cryptography (CL-PKC) avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we present an efficient constant-round group key exchange protocol, which is provably secure under the intractability of computation Diffie-Hellman problem. Our protocol is a contributory key exchange with perfect forward secrecy and has only two communication rounds. So it is more efficient than other protocols. Moreover, our protocol provides a method to design efficient constant-round group key exchange protocols and most secret sharing schemes could be adopted to construct our protocol.

DOI
10.1007/s11859-006-0167-1

Related papers

A provable authenticated certificateless group key agreement with constant rounds

Jikai Teng, Chuan-Kun Wu

Group key agreement protocols allow a group of users, communicating over a public network, to establish a shared secret key to achieve a cryptographic goal. Protocols based on certificateless public key cryptography (CL-PKC) are preferred since CL-PKC does not need certificates to guarantee the authenticity of public keys and does not suffer from key escrow of identity-based cryptography. Most previous certificateless group key agreement protocols deploy signature schemes to achieve authentication and do not have constant rounds. No security model has been presented for group key agreement protocols based on CL-PKC. This paper presents a security model for a certificateless group key agreement protocol and proposes a constant-round group key agreement pro- tocol based on CL-PKC. The proposed protocol does not involve any signature scheme, which increases the efficiency of the protocol. It is formally proven that the proposed protocol provides strong AKE-security and tolerates up to n-2 malicious insiders for weak MA-security. The protocol also resists key control attack under a weak corruption model.

Journal of Communications and Networks•Feb 1, 2012•34 citations

Constructing Secure Two-Party Authenticated Key Agreement Protocol Based on Certificateless Public Key Encryption Scheme

Mengbo Hou, Qiuliang Xu

Authenticated key agreement protocol is one of the important cryptographic primitives to ensure secure communication in an open network. Certificateless public key cryptography (CL-PKC) represents an interesting and potentially useful balance between public key cryptography based on certificates and identity-based cryptography. The topic of CL-PKC has undergone quite rapid development with schemes being proposed for encryption and signatures, while certificateless authenticated key agreement protocols are seldom discussed. In this paper, we present a secure two-party authenticated key agreement protocol based on an efficient certificateless public key encryption with pairing. Such a scheme achieves almost all of the security attributes, including known-key secrecy, perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience, known session-specific temporary information security, message independence and no key control. Meanwhile, it is also practical with nice efficiency.

International Conference on Computer Science & Education (ICCSE)•Jul 1, 2009•4 citations

An Authenticated Certificateless Public Key Encryption Scheme.

Young-Ran Lee, Hyang-Sook Lee

In 2003, Al-Riyami and Paterson[1] proposed the certificateless public key cryptography(CL-PKC) which is intermediate between traditional certificated PKC and identity-based PKC. In this paper, we propose an authenticated certificateless public key encryption scheme. Our result improves their public key encryption scheme in the efficiency. The security of the protocol is based on the hardness of two problems; the computational Diffie-Hellman problem(CDHP) and the bilinear Diffie-Hellman problem(BDHP). We also give a formal security model for both confidentiality and authentication, and then show that our scheme is probably secure in the security model.

•Jan 1, 2004•18 citations

An efficient two-party key exchange protocol with strong security

Shao-feng DENG, LI Yi-fa, Yiqun Deng

Combined public key (CPK) cryptography does not need certificates to guarantee the authenticity of public keys and avoids the inherent key escrow problem of identity-based cryptography. Based on the efficient CPK scheme, we present an efficient three-round two-party authenticated key exchange protocol with strong security, which is provably secure in the standard model under the decisional Diffie-Hellman (DDH) assumption. The protocol can keep the session key secret from the adversary except that one party’s ephemeral private key and static private key are all revealed to the adversary. Compared to the existing protocols, this protocol not only assures strong security but also is more efficient.

Wuhan University Journal of Natural Sciences•May 12, 2010•2 citations

Secure and efficient two-party certificateless authenticated key agreement protocol

Mengbo Hou, Qiuliang Xu

Authenticated key agreement protocol is used to provide data confidentiality and integrity to 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 PKI. In this paper, we present a secure and efficient two-party authenticated key agreement protocol based on the certificateless encryption scheme due to Libert and Quisquater. Security analysis shows that it achieves 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. Compared to other comparable schemes, it is more secure and efficient.

International Colloquium on Computing, Communication, Control, and Management•Aug 1, 2009•6 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
Certificateless public key cryptography (CL-PKC) avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we present an efficient constant-round group key exchange protocol, which is provably secure under the intractability of computation Diffie-Hellman problem. Our protocol is a contributory key exchange with perfect forward secrecy and has only two communication rounds. So it is more efficient than other protocols. Moreover, our protocol provides a method to design efficient constant-round group key exchange protocols and most secret sharing schemes could be adopted to construct our protocol.
Group key agreement protocols allow a group of users, communicating over a public network, to establish a shared secret key to achieve a cryptographic goal. Protocols based on certificateless public key cryptography (CL-PKC) are preferred since CL-PKC does not need certificates to guarantee the authenticity of public keys and does not suffer from key escrow of identity-based cryptography. Most previous certificateless group key agreement protocols deploy signature schemes to achieve authentication and do not have constant rounds. No security model has been presented for group key agreement protocols based on CL-PKC. This paper presents a security model for a certificateless group key agreement protocol and proposes a constant-round group key agreement pro- tocol based on CL-PKC. The proposed protocol does not involve any signature scheme, which increases the efficiency of the protocol. It is formally proven that the proposed protocol provides strong AKE-security and tolerates up to n-2 malicious insiders for weak MA-security. The protocol also resists key control attack under a weak corruption model.
Authenticated key agreement protocol is one of the important cryptographic primitives to ensure secure communication in an open network. Certificateless public key cryptography (CL-PKC) represents an interesting and potentially useful balance between public key cryptography based on certificates and identity-based cryptography. The topic of CL-PKC has undergone quite rapid development with schemes being proposed for encryption and signatures, while certificateless authenticated key agreement protocols are seldom discussed. In this paper, we present a secure two-party authenticated key agreement protocol based on an efficient certificateless public key encryption with pairing. Such a scheme achieves almost all of the security attributes, including known-key secrecy, perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience, known session-specific temporary information security, message independence and no key control. Meanwhile, it is also practical with nice efficiency.
In 2003, Al-Riyami and Paterson[1] proposed the certificateless public key cryptography(CL-PKC) which is intermediate between traditional certificated PKC and identity-based PKC. In this paper, we propose an authenticated certificateless public key encryption scheme. Our result improves their public key encryption scheme in the efficiency. The security of the protocol is based on the hardness of two problems; the computational Diffie-Hellman problem(CDHP) and the bilinear Diffie-Hellman problem(BDHP). We also give a formal security model for both confidentiality and authentication, and then show that our scheme is probably secure in the security model.
Combined public key (CPK) cryptography does not need certificates to guarantee the authenticity of public keys and avoids the inherent key escrow problem of identity-based cryptography. Based on the efficient CPK scheme, we present an efficient three-round two-party authenticated key exchange protocol with strong security, which is provably secure in the standard model under the decisional Diffie-Hellman (DDH) assumption. The protocol can keep the session key secret from the adversary except that one party’s ephemeral private key and static private key are all revealed to the adversary. Compared to the existing protocols, this protocol not only assures strong security but also is more efficient.
Authenticated key agreement protocol is used to provide data confidentiality and integrity to 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 PKI. In this paper, we present a secure and efficient two-party authenticated key agreement protocol based on the certificateless encryption scheme due to Libert and Quisquater. Security analysis shows that it achieves 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. Compared to other comparable schemes, it is more secure and efficient.
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.