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 Daxue xuebao. Xinxi kexue ban

Certificateless Authentication Protocol Without Pairing

Yumin Wang

Published Jan 1, 2010• 1 citation
OpenAlex

Abstract

A new certificateless signcryption scheme without using the bilinear pairings was presented based Discrete-Logarithm firstly,which was proved security in the random oracle model.Secondly,with the proposes signcryption scheme Canetti-Krawczyk model,the author proposes an efficient certificateless authentication and key exchange protocol without pairings.The security analysis of the proposed protocol in the implementation plan with the Canetti-Krawczyk model is presented in this paper.The results show that the proposed protocol is session-key secure with perfect forward secrecy.Moreover,the implementation of the protocol is just 1 encryption operation,3 exponent operations and twice communications.

Related papers

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

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

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

Efficient strongly-secure identity-based authenticated key agreement protocol

Jian Shu

Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.

Journal of Computer Applications•Jan 1, 2012•0 citations

Provably Secure Certificateless Authenticated Key Agreement Protocol in the Standard Model

Xiaofen Wang, Xiongda Li

Inspired by the certificateless public key encryption scheme proposed by Jong et al, we present a new certificateless authenticated key agreement protocol (CLAK). It is provably secure in the standard model. CLAK protocol provides perfect forward secrecy. Compared with a certificateless authenticated key agreement protocol which is only provable secure in the random oracle model, the new protocol is improved with respect to the security properties, computation and communication cost.

International Conference on Pervasive Computing, Signal Processing and Applications (PCSPA)•Sep 1, 2010•0 citations

Efficient and secure certificateless key agreement protocol

Xiaolei Dong

In the area of network information security,key agreement is essential between servers and clients.To overcome the key escrow property of identity-based cryptography,proposed certificateless public key cryptography,it combined the advantages of the traditional PKI and the identity-based cryptography.This paper proposed a new certificateless two-party key agreement protocol using pairing operation in elliptic curves,it only required each party to compute one pairing.Proved its security in ECK(extended Canetti-Krawczyk) model.Compared with existing certificateless protocols,the newly proposed key agreement protocol has better security and efficiency.

Jisuanji yingyong yanjiu•Jan 1, 2009•0 citations
A new certificateless signcryption scheme without using the bilinear pairings was presented based Discrete-Logarithm firstly,which was proved security in the random oracle model.Secondly,with the proposes signcryption scheme Canetti-Krawczyk model,the author proposes an efficient certificateless authentication and key exchange protocol without pairings.The security analysis of the proposed protocol in the implementation plan with the Canetti-Krawczyk model is presented in this paper.The results show that the proposed protocol is session-key secure with perfect forward secrecy.Moreover,the implementation of the protocol is just 1 encryption operation,3 exponent operations and twice communications.
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.
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.
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.
Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.
In the area of network information security,key agreement is essential between servers and clients.To overcome the key escrow property of identity-based cryptography,proposed certificateless public key cryptography,it combined the advantages of the traditional PKI and the identity-based cryptography.This paper proposed a new certificateless two-party key agreement protocol using pairing operation in elliptic curves,it only required each party to compute one pairing.Proved its security in ECK(extended Canetti-Krawczyk) model.Compared with existing certificateless protocols,the newly proposed key agreement protocol has better security and efficiency.