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

An efficient pairing-free certificateless two-party authenticated key agreement protocol in the eCK model

Yong-Jin Kim, Jong-Geon Kang, Chol-hun Kim, Yongmin Kim

Published Apr 1, 2013• 10 citations
OpenAlex

Abstract

Recent study on certificateless authenticated key agreement focuses on bilinear pairing-free certificateless authenticated key agreement protocol. Yet it has got limitations in the aspect of computational amount. So it is important to reduce the number of the scalar multiplication over elliptic curve group in bilinear pairing-free protocols. This paper proposed a new bilinear pairing-free certificateless two-party authenticated key agreement protocol, providing more efficiency among related work and proof under the random oracle model.

Related papers

An Efficient Bilinear Pairing-Free Certificateless Two-Party Authenticated Key Agreement Protocol in the eCK Model

Kim, Yong-Jin, Yongmin Kim, Yong-Jin Choe +1 more

Recent study on certificateless authenticated key agreement focuses on bilinear pairing-free certificateless authenticated key agreement protocol. Yet it has got limitations in the aspect of computational amount. So it is important to reduce the number of the scalar multiplication over elliptic curve group in bilinear pairing-free protocols. This paper proposed a new bilinear pairing-free certificateless two-party authenticated key agreement protocol, providing more efficiency among related work and proof under the random oracle model.

arXiv:1304.0383•Apr 1, 2013•10 citations

A pairing‐free certificateless authenticated key agreement protocol

Debiao He, Jianhua Chen, Hu Jin

SUMMARY Many certificateless two‐party authenticated key agreement schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar multiplication over elliptic curve group In order to improve the performance we propose a certificateless two‐party authenticated key agreement scheme without bilinear pairings in this paper. A security proof under random oracle model is also provided. Copyright © 2011 John Wiley & Sons, Ltd.

International Journal of Communication Systems•Apr 13, 2011•107 citations

Practical Certificateless Authenticated Two-party Key Protocol

Jian Shu

Recently,Lippold et al.proposed certificateless authenticated two-party key agreement with provable security,their scheme suffers from computation burden.Basesd on twin diffie-hellman problem introduced by Cash,Kiltz and Shoup,A new scheme using bilinear pair is proposed.When compared with Lippold's scheme,the proposed protocol,with the same message bandwidth,achieves efficiency in computational cost.The security of the proposed scheme has been proven in the random oracle model under CDH assumption and BDH assumption.

Journal of Chinese Computer Systems•Jan 1, 2010•0 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

New secure identity-based and certificateless authenticated Key Agreement protocols without pairings

Seyed Mohsen Ghoreishi, Shukor Bin Abd Razak, Ismail Fauzi Isnin +1 more

Recently, various pairing-based and pairing-free two party Key Agreement protocols in the context of Identity-Based and Certificateless cryptosystems have been published. The pairing-free Key Agreement protocols could improve the efficiency by eliminating the high expense of pairing maps. In this paper, we proposed several secure and efficient Identity-Based and Certificateless pairing-free two party Key Agreement protocols. In compare with related works, our protocols require less computational cost.

International Symposium on Biometrics and Security Technologies•Aug 1, 2014•7 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
Recent study on certificateless authenticated key agreement focuses on bilinear pairing-free certificateless authenticated key agreement protocol. Yet it has got limitations in the aspect of computational amount. So it is important to reduce the number of the scalar multiplication over elliptic curve group in bilinear pairing-free protocols. This paper proposed a new bilinear pairing-free certificateless two-party authenticated key agreement protocol, providing more efficiency among related work and proof under the random oracle model.
Recent study on certificateless authenticated key agreement focuses on bilinear pairing-free certificateless authenticated key agreement protocol. Yet it has got limitations in the aspect of computational amount. So it is important to reduce the number of the scalar multiplication over elliptic curve group in bilinear pairing-free protocols. This paper proposed a new bilinear pairing-free certificateless two-party authenticated key agreement protocol, providing more efficiency among related work and proof under the random oracle model.
SUMMARY Many certificateless two‐party authenticated key agreement schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar multiplication over elliptic curve group In order to improve the performance we propose a certificateless two‐party authenticated key agreement scheme without bilinear pairings in this paper. A security proof under random oracle model is also provided. Copyright © 2011 John Wiley & Sons, Ltd.
Recently,Lippold et al.proposed certificateless authenticated two-party key agreement with provable security,their scheme suffers from computation burden.Basesd on twin diffie-hellman problem introduced by Cash,Kiltz and Shoup,A new scheme using bilinear pair is proposed.When compared with Lippold's scheme,the proposed protocol,with the same message bandwidth,achieves efficiency in computational cost.The security of the proposed scheme has been proven in the random oracle model under CDH assumption and BDH assumption.
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.
Recently, various pairing-based and pairing-free two party Key Agreement protocols in the context of Identity-Based and Certificateless cryptosystems have been published. The pairing-free Key Agreement protocols could improve the efficiency by eliminating the high expense of pairing maps. In this paper, we proposed several secure and efficient Identity-Based and Certificateless pairing-free two party Key Agreement protocols. In compare with related works, our protocols require less computational cost.
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.