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

Modular Security Proofs for Key Agreement Protocols

Caroline Kudla, Kenneth G. Paterson

Published Jan 1, 2005• 122 citations
Publisher
DOI
10.1007/11593447_30

Related papers

An improved identity-based key agreement protocol and its security proof

S WANG, Zhenfu Cao, Kim‐Kwang Raymond Choo +1 more

Information Sciences•Oct 5, 2008•58 citations

Security-provable Identity-based Authenticated Key Agreement Protocol

Yafei Wang

Most Identity-based Authenticated Key Agreement(ID-AKA) protocols have poor performance on security and the efficiency.To solve this problem,this paper presents an improved ID-AKA protocol.Security proof with the modular approach in the mBR model is provided,which means the new protocol satisfies perfect forward security,PKG forward security,resistant to key-compromise impersonation.Furthermore,the new protocol can satisfy resistance to leakage of ephemeral secrets.Compared with previous ID-AKA protocols which can satisfy the same security properties,the new protocol has higher efficiency.

Jisuanji gongcheng•Jan 1, 2012•0 citations

Key agreement protocols and their security analysis: Extended Abstract

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

Lecture notes in computer science•Jan 1, 1997•596 citations

Provably Secure Certificateless Two-Party Authenticated Key Agreement Protocol without Pairing

Manman Geng, Futai Zhang

Key agreement is one of the fundamental cryptographic primitives in public key cryptography. So far several certificateless two-party authenticated key agreement (CL-T-AKA) protocols have been proposed. However, all these protocols are based on bilinear map and most of them are without formal security proof. In this paper, we present a new formal security model of CL-T-AKA protocols and bring forward the first two-party key agreement protocol without the computation of expensive bilinear map. Our protocol is secure under the security model assuming the Gap-DH problem is intractable. With respect to efficiency, our protocol requires a single round of communication in which each party sends only one group element, and needs only five modular exponentiation computations. In addition, we point out that an existing certificateless two-party key agreement protocol cannot resist man-in-the-middle attack.

International Conference on Computational Intelligence and Security (CIS)•Jan 1, 2009•47 citations

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

On key agreement protocols based on tamper-proof hardware

Yuliang Zheng

Information Processing Letters•Jan 1, 1995•7 citations
Most Identity-based Authenticated Key Agreement(ID-AKA) protocols have poor performance on security and the efficiency.To solve this problem,this paper presents an improved ID-AKA protocol.Security proof with the modular approach in the mBR model is provided,which means the new protocol satisfies perfect forward security,PKG forward security,resistant to key-compromise impersonation.Furthermore,the new protocol can satisfy resistance to leakage of ephemeral secrets.Compared with previous ID-AKA protocols which can satisfy the same security properties,the new protocol has higher efficiency.
Key agreement is one of the fundamental cryptographic primitives in public key cryptography. So far several certificateless two-party authenticated key agreement (CL-T-AKA) protocols have been proposed. However, all these protocols are based on bilinear map and most of them are without formal security proof. In this paper, we present a new formal security model of CL-T-AKA protocols and bring forward the first two-party key agreement protocol without the computation of expensive bilinear map. Our protocol is secure under the security model assuming the Gap-DH problem is intractable. With respect to efficiency, our protocol requires a single round of communication in which each party sends only one group element, and needs only five modular exponentiation computations. In addition, we point out that an existing certificateless two-party key agreement protocol cannot resist man-in-the-middle attack.