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

Information security and cryptography

Key Agreement Protocols

Colin Boyd, Anish Mathuria

Published Jan 1, 2003• 7 citations
Publisher
DOI
10.1007/978-3-662-09527-0_5

Related papers

Key Agreement Protocols

Colin Boyd, Anish Mathuria, Douglas Stebila

Information security and cryptography•Nov 6, 2019•1 citation

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•3 citations

Key Agreement via Protocols

Andrew William Roscoe, Lei Wang

Lecture notes in computer science•Jan 1, 2019•2 citations

Certificateless two-party key agreement scheme without bilinear pairing

XU Chun-xiang

A few of certificateless key agreement schemes have been proposed in recent years,all of them need pairing operations,what's more,most of them are vulnerable to the key compromise impersonation attack and resistance to leakage of ephemeral keys.The provably secure certificateless key agreement protocol was proposed by Lippold in 2009,but their protocol suffered from computation burden.In order to solve the above-mentioned problem,this paper proposed a new pairing-free certificateless two party key agreement scheme (CL-KA) and presened its security properties.The new scheme was secure as long as each party had at least one uncompromised secret.Thus,the new scheme was secure even if the key generation centre learned the ephemeral secrets of both parties.The new scheme achieves efficiency in computational cost when compared with Lippold's protocol.

Jisuanji yingyong yanjiu•Jan 1, 2010•3 citations

Key agreement via protocols

Bill Roscoe

•Jan 1, 2019•0 citations

Identity-Based One Round Key Agreement Protocol without Bilinear Pairings

Wenhao Liu, Shengbao Wang, Xiao Tan +2 more

Almost all the existing identity-based key agreement (ID-KA) protocols cannot achieve both ephemeral secret reveal resilience and pairing-free. In this paper, a pairing-free ID-KA protocol is proposed, which captures all basic desirable security properties including key generation center forward secrecy, key compromise impersonation resilience and ephemeral secrets reveal resistance. On the other hand, the proposed scheme only needs one round communication between the two parties. Compared with the previous ID-KA protocols, the proposed scheme is more secure and efficient.

International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)•Nov 1, 2015•2 citations
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.
A few of certificateless key agreement schemes have been proposed in recent years,all of them need pairing operations,what's more,most of them are vulnerable to the key compromise impersonation attack and resistance to leakage of ephemeral keys.The provably secure certificateless key agreement protocol was proposed by Lippold in 2009,but their protocol suffered from computation burden.In order to solve the above-mentioned problem,this paper proposed a new pairing-free certificateless two party key agreement scheme (CL-KA) and presened its security properties.The new scheme was secure as long as each party had at least one uncompromised secret.Thus,the new scheme was secure even if the key generation centre learned the ephemeral secrets of both parties.The new scheme achieves efficiency in computational cost when compared with Lippold's protocol.
Almost all the existing identity-based key agreement (ID-KA) protocols cannot achieve both ephemeral secret reveal resilience and pairing-free. In this paper, a pairing-free ID-KA protocol is proposed, which captures all basic desirable security properties including key generation center forward secrecy, key compromise impersonation resilience and ephemeral secrets reveal resistance. On the other hand, the proposed scheme only needs one round communication between the two parties. Compared with the previous ID-KA protocols, the proposed scheme is more secure and efficient.