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

Lecture notes in computer science

Key agreement protocols and their security analysis

Simon Blake-Wilson⋆⋆, Don B. Johnson, Alfred Menezes

Published Jan 1, 1997• 601 citations
Publisher
DOI
10.1007/bfb0024447

Related papers

Security Analysis and Applications of Standard Key Agreement Protocols

Soohyun Oh, Jin Kwak, Seungwoo Lee +1 more

Lecture notes in computer science•Jan 1, 2003•7 citations

Security Analysis Approaches for Group Key Agreement Protocols

Wei Da-wei

Group Key agreement allows multi users to establish a common session key though insecure channels.Designing secure group key agreement protocols is one of the most fundamental cryptographic tasks.This paper introduced two approaches developed for analyzing security group key agreement protocols:computational complexity approach and formal analysis approach.The key technologies of computational complexity approach were discussed,including the proof technology based on reduction and simulatability,and security models based on reduction and simulatability.The trends in this field were presented.

•Jan 1, 2011•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•Dec 20, 2018•11 citations

Key Agreement Protocols

Colin Boyd, Anish Mathuria

Information security and cryptography•Jan 1, 2003•7 citations

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

Xie Yong

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

Key Agreement Protocols

Colin Boyd, Anish Mathuria, Douglas Stebila

Information security and cryptography•Nov 6, 2019•1 citation
Group Key agreement allows multi users to establish a common session key though insecure channels.Designing secure group key agreement protocols is one of the most fundamental cryptographic tasks.This paper introduced two approaches developed for analyzing security group key agreement protocols:computational complexity approach and formal analysis approach.The key technologies of computational complexity approach were discussed,including the proof technology based on reduction and simulatability,and security models based on reduction and simulatability.The trends in this field were presented.
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.
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.