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

Computer Communications

Modern key agreement techniques

Rainer A. Rueppel, Paul C. van Oorschot

Published Jul 1, 1994• 27 citations
Publisher
DOI
10.1016/0140-3664(94)90100-7

Related papers

An Authenticated 3-Round Identity-Based Group Key Agreement Protocol

Gang Yao, Hongji Wang, Qingshan Jiang

Key agreement protocols allow two or more participants exchange information over an open network with each other. In modern collaborative and distributed applications, authenticated group key agreement is one of the important issues. Recently identity-based authenticated key agreement protocol has been increasingly investigated because of the simplicity of a public key management. In this paper, we propose an authenticated three-round identity-based group key agreement protocol. The first round is for identity authentication, the second round is for key agreement, and the third round is for key confirmation. The proposed protocol is based on the protocol of Burmester and Desmedt, and the protocol is provably- secure in the random oracle model. In particular, the proposed authenticated identity-based group key agreement protocol provides a batch verification technique, which verifies the validity of transcripts from other group players simultaneously.

International Conference on Availability, Reliability and Security (ARES)•Mar 1, 2008•13 citations

Key Agreement Protocols

Colin Boyd, Anish Mathuria, Douglas Stebila

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

An Authenticated Key Agreement Protocol Using Artins Braid Group

Atul Chaturvedi, Dept. of Mathematics, PSIT, Kanpur, India, Dept. of Computer Science, PSIT, Kanpur, India +5 more

This paper proposes a new and efficient key agreement protocol where trusted third party (TTP) is involved. There are various available schemes which are based on number theoretic, elliptic curves etc. Due to the availability of modern computers, these schemes are vulnerable to man in the middle attack (MITM). So there is a requirement of new technique for key agreement which surprises the intruders and enhances the security of communication system. Our proposed protocol utilizes the property of a non commutative group. We have given the security proof of our protocol keeping the fact in mind that decomposition and conjugacy search problem are hard in a group which is non commutative.

International Journal of Computer Sciences and Engineering•Dec 31, 2017•1 citation

Key Agreement Protocols

Colin Boyd, Anish Mathuria

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

Efficient and Secure Design of ID-3PAKA Protocol Using ECC

Daya Sagar Gupta, Krittibas Parai, Mohammad S. Obaidat +1 more

In this modern era, the need for key agreement protocols equipped with high-speed Internet has become necessary in information/network security. An authenticated key agreement (AKA) protocol is a technique that negotiates a secret session key among various users in a network and is used in many scenarios like mutual authentication, data integrity, and many more. The current state-of-the-art include many AKA protocols that are either vulnerable to different attacks or incur massive communication and computational costs. This paper proposes an identity-based three-party authenticated key agreement (ID-3PAKA) protocol using elliptic curve cryptography (ECC). The proposed ID-3PAKA protocol generates a shared secret session key among three users. The security of the proposed ID-3PAKA protocol relies on the hardness assumption of the ECDLP and the CDH problems. The proposed ID-3PAKA protocol is safe against active and passive attacks, which is proved through the simulation of the OFMC and Cl-AtS back-ends of the AVISPA tool.

International Conference on Computer, Information and Telecommunication Systems•Nov 11, 2021•3 citations

Key Agreement via Protocols

Andrew William Roscoe, Lei Wang

Lecture notes in computer science•Jan 1, 2019•2 citations
Key agreement protocols allow two or more participants exchange information over an open network with each other. In modern collaborative and distributed applications, authenticated group key agreement is one of the important issues. Recently identity-based authenticated key agreement protocol has been increasingly investigated because of the simplicity of a public key management. In this paper, we propose an authenticated three-round identity-based group key agreement protocol. The first round is for identity authentication, the second round is for key agreement, and the third round is for key confirmation. The proposed protocol is based on the protocol of Burmester and Desmedt, and the protocol is provably- secure in the random oracle model. In particular, the proposed authenticated identity-based group key agreement protocol provides a batch verification technique, which verifies the validity of transcripts from other group players simultaneously.
This paper proposes a new and efficient key agreement protocol where trusted third party (TTP) is involved. There are various available schemes which are based on number theoretic, elliptic curves etc. Due to the availability of modern computers, these schemes are vulnerable to man in the middle attack (MITM). So there is a requirement of new technique for key agreement which surprises the intruders and enhances the security of communication system. Our proposed protocol utilizes the property of a non commutative group. We have given the security proof of our protocol keeping the fact in mind that decomposition and conjugacy search problem are hard in a group which is non commutative.
In this modern era, the need for key agreement protocols equipped with high-speed Internet has become necessary in information/network security. An authenticated key agreement (AKA) protocol is a technique that negotiates a secret session key among various users in a network and is used in many scenarios like mutual authentication, data integrity, and many more. The current state-of-the-art include many AKA protocols that are either vulnerable to different attacks or incur massive communication and computational costs. This paper proposes an identity-based three-party authenticated key agreement (ID-3PAKA) protocol using elliptic curve cryptography (ECC). The proposed ID-3PAKA protocol generates a shared secret session key among three users. The security of the proposed ID-3PAKA protocol relies on the hardness assumption of the ECDLP and the CDH problems. The proposed ID-3PAKA protocol is safe against active and passive attacks, which is proved through the simulation of the OFMC and Cl-AtS back-ends of the AVISPA tool.