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

International Journal of Wireless and Microwave Technologies

A New Three-party Key Exchange Protocol Based on Diffie-Hellman

Chunling Liu, Yufeng Wang, Qinxi Bai

Published Aug 15, 2011• 1 citation
Publisher

Abstract

The goal of key exchange protocol is to establish a common and secure session key using the interactive communications.The existing schemes are usually in the pattern of 'user-server-user', so are weak in reality.In this paper, a new three-party key exchange protocol based on Diffie-Hellman was proposed which contains the following characteristics: without server; providing key secrecy and forward secrecy; ensuring no key control; ensuring known-key secrecy.

DOI
10.5815/ijwmt.2011.04.09

Related papers

New Secret Key Exchange Based On Recent Cryptographic Schemes (Dept.E)

Amina Rashad, Magcd Ibrahim, Zaki Nossair

Authenticated key exchange protocols have an important role for building secure communications amongst two or more entities over the networks. Two party authenticated key exchange protocols where each pair of parties must share a secret with each other; a three-party protocol does not cause any key management problem for the parties. In this paper, an extension of two-party key exchange protocol, which is based on Diffie-Hellman key exchange. is proposed. In this protocol each user exchanges secret key with server then each user uses this secret key to exchange session key with each other. The efficiency and the security analysis of this new key exchange protocol are proven in this paper.

MEJ Mansoura Engineering Journal•Dec 5, 2020•0 citations

Efficient Authenticated ID-Based Group Key Agreement Protocol

M Arifi, Mahmoud Gardeshi

Group key exchange protocols play main role in group applications such as computer networks, telecommunication and military systems. Given the wide range of usage of group applications, research and design of these protocols can play an important role in securing international exchanges, trade and military issues. Most existing group key exchange protocols establish multi-party or group key exchange protocols based on extending the two party well known Diffie- Hellman key exchanges. The security of these protocols is based on this assumption that difficulty of solving group Dif- fie-Hellman problem can be reduced to the difficulty of two party Diffie-Hellman problems. In spite of this assumption, Group key exchanges are not simply extension of two party protocols. In fact there are many differences and challenges that must be considered in design and implementation of these protocols. This difference is due to essential difference between peer to peer communication and group communication. In group communication in addition to considering the main goal e.g. obtaining group session key, consideration of group member changing is important too. In this paper, a Dynamic ID-based Group Key Agreement protocol based on Weil pairing is proposed. This complete ternary tree struc- ture is used and dynamic changes in group are considered too. Finally we show that the proposed protocol is more effi- cient than other protocols with similar structure and also satisfies all known security requirements .

•Jan 1, 2011•1 citation

An Enhanced and Secure Protocol for Authenticated Key Exchange.

Fuw-Yi Yang, Jinn-ke Jan

Abstract An enhanced authentication key exchange protocol was proposed to exchange multiple session keys between two participants at a time. This paper shows that this enhanced protocol is insecure under the known session key attack, known long-term private key attack, signature forgery attack, and replay attack. This paper also proposes an enhanced and secure key agreement protocol for exchanging multiple session keys in one run of the protocol. The protocol is secure against the attacks mentioned above. Besides, a formal proof is given to guarantee the security of the proposed protocol under other potential attacks. Keywords Authentication, Diffie-Hellman key exchange, perfect forward secrecy, session key. 1.

•Jan 1, 2004•4 citations

Multi-party Key-Exchange with Perfect Forward Secrecy

Susmita Mandal, Sujata Mohanty

The paper proposes a multi-party key exchange scheme with Perfect Forward Secrecy (PFS) which ensures that a session key derived from a set of long-term public and private keys used in the protocol to authenticate, does not compromise the secrecy of session key. In this protocol, each group establishes connection by communicating through a trusted third party. The trusted party acts as a group controller generates a public key and broadcasts it among the groups. Each group generate their public keys and send to trusted party. After receiving all the keys the group controller shares it among all the parties to generate the session key. Similarly, each group manager of individual group communicates with the members of the corresponding group. The security of the proposed scheme is analysed rigorously and proved to be resistant against non-repudiation attack, replay attack, chosen cipher attack, man-in-the middle attack. The scheme has wider applications such as, sending encrypted e-mail in a military environment to multiple users, securing submitted bids information in online tender, contract signing by many organizations, etc.

•Dec 1, 2014•7 citations

An Improvement on A Three-Party Authentication Key Exchange Protocol Using Elliptic Curve Cryptography

Zuowen Tan

The authentication key exchange protocol enables communication participants to authenticate each other and agree on the session key over an insecure public network. Recently, a three-party authentication key exchange protocol based on Elliptic curve cryptograph is proposed. In this paper, we improve the three-party encrypted key exchange protocol by bilinear maps. The proposed threeparty authentication key exchange protocol is provable secure under Computational Diffie-Hellman assumptions in the standard model. Furthermore, the novel protocol is more efficient.

Journal of Convergence Information Technology•Jun 30, 2010•13 citations

Efficient three‐party encrypted key exchange using trapdoor functions

Tian‐Fu Lee, I‐Pin Chang, Ching‐Cheng Wang

ABSTRACT Three‐party encrypted key exchange (3PEKE) enables two communicating parties to securely exchange confidential and authenticated information over an insecure network via a trusted server. This investigation presents a novel efficient and secure 3PEKE protocol using a super‐poly‐to‐one trapdoor function. The proposed protocol employs the Diffie–Hellman key exchange and adopts the technique that the clients can publicly exchange the factors for generating the session key without the help of the server to reduce the numbers of transmissions. A round‐efficient version of the proposed 3PEKE protocol is also described. Compared with related approaches, the proposed protocol not only retains security requirements and possesses lower computational cost but also has fewer transmissions and realizes the lower bounds of communications. Copyright © 2013 John Wiley & Sons, Ltd.

Security and Communication Networks•Feb 28, 2013•3 citations
The goal of key exchange protocol is to establish a common and secure session key using the interactive communications.The existing schemes are usually in the pattern of 'user-server-user', so are weak in reality.In this paper, a new three-party key exchange protocol based on Diffie-Hellman was proposed which contains the following characteristics: without server; providing key secrecy and forward secrecy; ensuring no key control; ensuring known-key secrecy.
Authenticated key exchange protocols have an important role for building secure communications amongst two or more entities over the networks. Two party authenticated key exchange protocols where each pair of parties must share a secret with each other; a three-party protocol does not cause any key management problem for the parties. In this paper, an extension of two-party key exchange protocol, which is based on Diffie-Hellman key exchange. is proposed. In this protocol each user exchanges secret key with server then each user uses this secret key to exchange session key with each other. The efficiency and the security analysis of this new key exchange protocol are proven in this paper.
Group key exchange protocols play main role in group applications such as computer networks, telecommunication and military systems. Given the wide range of usage of group applications, research and design of these protocols can play an important role in securing international exchanges, trade and military issues. Most existing group key exchange protocols establish multi-party or group key exchange protocols based on extending the two party well known Diffie- Hellman key exchanges. The security of these protocols is based on this assumption that difficulty of solving group Dif- fie-Hellman problem can be reduced to the difficulty of two party Diffie-Hellman problems. In spite of this assumption, Group key exchanges are not simply extension of two party protocols. In fact there are many differences and challenges that must be considered in design and implementation of these protocols. This difference is due to essential difference between peer to peer communication and group communication. In group communication in addition to considering the main goal e.g. obtaining group session key, consideration of group member changing is important too. In this paper, a Dynamic ID-based Group Key Agreement protocol based on Weil pairing is proposed. This complete ternary tree struc- ture is used and dynamic changes in group are considered too. Finally we show that the proposed protocol is more effi- cient than other protocols with similar structure and also satisfies all known security requirements .
Abstract An enhanced authentication key exchange protocol was proposed to exchange multiple session keys between two participants at a time. This paper shows that this enhanced protocol is insecure under the known session key attack, known long-term private key attack, signature forgery attack, and replay attack. This paper also proposes an enhanced and secure key agreement protocol for exchanging multiple session keys in one run of the protocol. The protocol is secure against the attacks mentioned above. Besides, a formal proof is given to guarantee the security of the proposed protocol under other potential attacks. Keywords Authentication, Diffie-Hellman key exchange, perfect forward secrecy, session key. 1.
The paper proposes a multi-party key exchange scheme with Perfect Forward Secrecy (PFS) which ensures that a session key derived from a set of long-term public and private keys used in the protocol to authenticate, does not compromise the secrecy of session key. In this protocol, each group establishes connection by communicating through a trusted third party. The trusted party acts as a group controller generates a public key and broadcasts it among the groups. Each group generate their public keys and send to trusted party. After receiving all the keys the group controller shares it among all the parties to generate the session key. Similarly, each group manager of individual group communicates with the members of the corresponding group. The security of the proposed scheme is analysed rigorously and proved to be resistant against non-repudiation attack, replay attack, chosen cipher attack, man-in-the middle attack. The scheme has wider applications such as, sending encrypted e-mail in a military environment to multiple users, securing submitted bids information in online tender, contract signing by many organizations, etc.
The authentication key exchange protocol enables communication participants to authenticate each other and agree on the session key over an insecure public network. Recently, a three-party authentication key exchange protocol based on Elliptic curve cryptograph is proposed. In this paper, we improve the three-party encrypted key exchange protocol by bilinear maps. The proposed threeparty authentication key exchange protocol is provable secure under Computational Diffie-Hellman assumptions in the standard model. Furthermore, the novel protocol is more efficient.
ABSTRACT Three‐party encrypted key exchange (3PEKE) enables two communicating parties to securely exchange confidential and authenticated information over an insecure network via a trusted server. This investigation presents a novel efficient and secure 3PEKE protocol using a super‐poly‐to‐one trapdoor function. The proposed protocol employs the Diffie–Hellman key exchange and adopts the technique that the clients can publicly exchange the factors for generating the session key without the help of the server to reduce the numbers of transmissions. A round‐efficient version of the proposed 3PEKE protocol is also described. Compared with related approaches, the proposed protocol not only retains security requirements and possesses lower computational cost but also has fewer transmissions and realizes the lower bounds of communications. Copyright © 2013 John Wiley & Sons, Ltd.