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 and Communication Networks

A Certificateless Noninteractive Key Exchange Protocol with Provable Security

Xuefei Cao, Lanjun Dang, Luan Yingzi, Wei You

Published Aug 28, 2020• 0 citations
Publisher

Abstract

In this paper, we propose a certificateless noninteractive key exchange protocol. No message exchange is required in the protocol, and this feature will facilitate the applications where the communication overhead matters, for example, the communications between the satellites and the earth. The public key certificate is removed as well as the key escrow problem using the certificateless public key cryptosystem. The security of the protocol rests on the bilinear Diffie–Hellman problem, and it could be proved in the random oracle model. Compared with previous protocols, the new protocol reduces the running time by at least 33.0%.

DOI
10.1155/2020/8862476

Related papers

Certificateless Concurrent Signature Scheme

Zhenjie Huang, Xuanzhi Lin, Rufen Huang

Certificateless public key cryptography was introduced to remove the use of certificate to ensure the authentication of the user's public key in the traditional certificate-based public key cryptography and overcome he key escrow problem in the identity-based public key cryptography. Concurrent signatures were introduced as an alternative approach to solving the problem of fair exchange of signatures. Combining the concept of certificateless cryptography with the concept of concurrent signature, in this paper, we present a notion of certificateless concurrent signature with a formal security model and propose a provably secure scheme assuming the hardness of computational Diffie-Hellman Problem.

International Conference for Young Computer Scientists•Nov 1, 2008•2 citations

Provable efficient certificateless group key exchange protocol

Chunjie Cao, Jianfeng Ma, SangJae Moon

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.

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

A novel certificateless deniable authentication protocol

Chunhua Jin, Chunxiang Xu, Fagen Li +1 more

Deniable authenticate is a different and attractive authenticate mechanism compared with the traditional authentication. It allows the appointed receiver to identify the identity of the sender, but not to prove the source of a given message to a third party even if the appointed receiver is willing to reveal its private key. Certificateless public key cryptography can solve both the public key certificate management problem of public key infrastructure-based cryptography and the key escrow problem of identity-based cryptography. In this paper, we first define a security model for certificateless deniable authentication protocols. Then we propose a non-interactive certificateless deniable authentication protocol. In addition, we prove its security in the random oracle model. Our protocol can be applied in many actual application scenarios, such as electronic voting, electronic tendering, and online shopping.

International Journal of Computers and Applications•Oct 2, 2015•8 citations

Certificateless two-party authenticated key agreement protocol based on bilinear pairings

Yuezhi Zhou

Certificateless public key cryptography has appealing features,namely it does not require the use of certificates and does not have a private key escrow feature.This paper describes a certificateless key agreement protocol based on bilinear pairings.The identity authentication in the protocol depends on a digital signature scheme.This paper proves the security of the signature scheme.The results show that in the random oracle model with the discrete logarithm assumption,the signature scheme resists existential forgeries against adaptive chosen-message attacks.The results farther show that the protocol preserves the desired security properties,including known-key security,unknown key-share resilience,perfect forward secrecy,key-compromise impersonation resilience and leakage of ephemeral private key resilience.The protocol requires much lower computation overhead than related protocols,since it uses fewer bilinear pairing operations and no modular exponentiation.

Journal of Tsinghua University(Science and Technology)•Jan 1, 2012•1 citation

An efficient certificateless deniable authentication protocol without pairings

Chunhua Jin, Chunxiang Xu, Xiaojun Zhang +1 more

A deniable authentication protocol enables an intended receiver to identify the source of a given message, but the receiver cannot prove the source of a given message to any third party. It is very useful in some particular applications such as electronic voting, online negotiation and online shopping. However, many related protocols are lack of formal security proof which is very important for cryptographic protocol design. In this paper, we present a certificateless deniable authentication protocol. Our protocol is based on certificateless cryptography, which can solve the public key certificate management problem of public key infrastructure (PKI)-based cryptography and the key escrow problem of identity-based cryptography. Our protocol does not need the pairing operation which is the most time-consuming. In addition, our protocol can admit formal security proof in the random oracle model and resist key compromise impersonation (KCI) attack. Compared with the existing deniable authentication protocols, our protocol can be well applied in electronic voting system.

International Journal of Electronic Security and Digital Forensics•Jan 1, 2015•8 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
In this paper, we propose a certificateless noninteractive key exchange protocol. No message exchange is required in the protocol, and this feature will facilitate the applications where the communication overhead matters, for example, the communications between the satellites and the earth. The public key certificate is removed as well as the key escrow problem using the certificateless public key cryptosystem. The security of the protocol rests on the bilinear Diffie–Hellman problem, and it could be proved in the random oracle model. Compared with previous protocols, the new protocol reduces the running time by at least 33.0%.
Certificateless public key cryptography was introduced to remove the use of certificate to ensure the authentication of the user's public key in the traditional certificate-based public key cryptography and overcome he key escrow problem in the identity-based public key cryptography. Concurrent signatures were introduced as an alternative approach to solving the problem of fair exchange of signatures. Combining the concept of certificateless cryptography with the concept of concurrent signature, in this paper, we present a notion of certificateless concurrent signature with a formal security model and propose a provably secure scheme assuming the hardness of computational Diffie-Hellman Problem.
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.
Deniable authenticate is a different and attractive authenticate mechanism compared with the traditional authentication. It allows the appointed receiver to identify the identity of the sender, but not to prove the source of a given message to a third party even if the appointed receiver is willing to reveal its private key. Certificateless public key cryptography can solve both the public key certificate management problem of public key infrastructure-based cryptography and the key escrow problem of identity-based cryptography. In this paper, we first define a security model for certificateless deniable authentication protocols. Then we propose a non-interactive certificateless deniable authentication protocol. In addition, we prove its security in the random oracle model. Our protocol can be applied in many actual application scenarios, such as electronic voting, electronic tendering, and online shopping.
Certificateless public key cryptography has appealing features,namely it does not require the use of certificates and does not have a private key escrow feature.This paper describes a certificateless key agreement protocol based on bilinear pairings.The identity authentication in the protocol depends on a digital signature scheme.This paper proves the security of the signature scheme.The results show that in the random oracle model with the discrete logarithm assumption,the signature scheme resists existential forgeries against adaptive chosen-message attacks.The results farther show that the protocol preserves the desired security properties,including known-key security,unknown key-share resilience,perfect forward secrecy,key-compromise impersonation resilience and leakage of ephemeral private key resilience.The protocol requires much lower computation overhead than related protocols,since it uses fewer bilinear pairing operations and no modular exponentiation.
A deniable authentication protocol enables an intended receiver to identify the source of a given message, but the receiver cannot prove the source of a given message to any third party. It is very useful in some particular applications such as electronic voting, online negotiation and online shopping. However, many related protocols are lack of formal security proof which is very important for cryptographic protocol design. In this paper, we present a certificateless deniable authentication protocol. Our protocol is based on certificateless cryptography, which can solve the public key certificate management problem of public key infrastructure (PKI)-based cryptography and the key escrow problem of identity-based cryptography. Our protocol does not need the pairing operation which is the most time-consuming. In addition, our protocol can admit formal security proof in the random oracle model and resist key compromise impersonation (KCI) attack. Compared with the existing deniable authentication protocols, our protocol can be well applied in electronic voting system.
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.