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

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

Certificateless Key Agreement Protocols under Strong Models

Denise Goya, Dionathan Nakamura, Routo Terada

Published Jan 1, 2016• 6 citations
Publisher

Abstract

Two new authenticated key agreement protocols in the certificateless setting are presented in this paper. Both are proved secure in the extended Canetti-Krawczyk model, under the BDH assumption. The first one is more efficient than the Lippold et al.'s (LBG) protocol, and is proved secure in the same security model. The second protocol is proved secure under the Swanson et al.'s security model, a weaker model. As far as we know, our second proposed protocol is the first one proved secure in the Swanson et al.'s security model. If no pre-computations are done, the first protocol is about 26% faster than LBG, and the second protocol is about 49% faster than LBG, and about 31% faster than the first one. If pre-computations of some operations are done, our two protocols remain faster.

DOI
10.1587/transfun.e99.a.1822

Related papers

Cryptanalysis of an efficient certificateless two-party authenticated key agreement protocol.

Qingfeng Cheng

Abstract. Recently, He et al. (Computers and Mathematics with Applications, 2012, 64(6): 1914-1926) proposed a new efficient certificateless two-party authenticated key agreement protocol. They claimed their protocol was provably secure in the extended Canetti-Krawczyk (eCK) model. In this paper, we will show that their protocol is insecure. A type I adversary, who obtains one party’s ephemeral private key, can impersonate the party to cheat the other party and compute the shared session key successfully. For overcoming this weakness, we also propose a simple countermeasure.

•Jan 1, 2012•4 citations

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•2 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

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

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

Efficient two-party certificateless authenticated key agreement protocol under GDH assumption

Yong Gang Xie, Libing Wu, Jian Shen +1 more

Security and efficiency are two key requirements for most of the authentication protocol, especially for the mobile wireless network. However, security and efficiency are a contradiction for the design of authentication protocol, it is hard to meet the two requirements simultaneously. Since certificateless public key cryptography (CL-PKC) has an advantage in wiping off key escrow problem, many certificateless authentication key agreement (CL_AKA) protocols have been proposed. The existing CL_AKA protocols may meet either security requirement well or efficiency requirement well, but cannot meet the two well. In this paper, we propose an efficient two-party CL_AKA protocol with strong security. We perform an in-depth security analysis in extended Canetti-Krawczyk (eCK) model to show the proposed CL_AKA protocol is provably secure. The performance analysis shows that the proposed protocol can meet the strong security and efficiency requirements simultaneously.

International Journal of Ad Hoc and Ubiquitous Computing•Jan 1, 2017•13 citations
Two new authenticated key agreement protocols in the certificateless setting are presented in this paper. Both are proved secure in the extended Canetti-Krawczyk model, under the BDH assumption. The first one is more efficient than the Lippold et al.'s (LBG) protocol, and is proved secure in the same security model. The second protocol is proved secure under the Swanson et al.'s security model, a weaker model. As far as we know, our second proposed protocol is the first one proved secure in the Swanson et al.'s security model. If no pre-computations are done, the first protocol is about 26% faster than LBG, and the second protocol is about 49% faster than LBG, and about 31% faster than the first one. If pre-computations of some operations are done, our two protocols remain faster.
Abstract. Recently, He et al. (Computers and Mathematics with Applications, 2012, 64(6): 1914-1926) proposed a new efficient certificateless two-party authenticated key agreement protocol. They claimed their protocol was provably secure in the extended Canetti-Krawczyk (eCK) model. In this paper, we will show that their protocol is insecure. A type I adversary, who obtains one party’s ephemeral private key, can impersonate the party to cheat the other party and compute the shared session key successfully. For overcoming this weakness, we also propose a simple countermeasure.
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.
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.
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.
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.
Security and efficiency are two key requirements for most of the authentication protocol, especially for the mobile wireless network. However, security and efficiency are a contradiction for the design of authentication protocol, it is hard to meet the two requirements simultaneously. Since certificateless public key cryptography (CL-PKC) has an advantage in wiping off key escrow problem, many certificateless authentication key agreement (CL_AKA) protocols have been proposed. The existing CL_AKA protocols may meet either security requirement well or efficiency requirement well, but cannot meet the two well. In this paper, we propose an efficient two-party CL_AKA protocol with strong security. We perform an in-depth security analysis in extended Canetti-Krawczyk (eCK) model to show the proposed CL_AKA protocol is provably secure. The performance analysis shows that the proposed protocol can meet the strong security and efficiency requirements simultaneously.