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

CRC Press eBooks

New secure explicitly authenticated key agreement protocols

Y. Abouelseoud & M. Nabil

Published Apr 7, 2014• 0 citations
Publisher

Abstract

The first efficient tripartite key agreement protocol was developed by Joux (2000). It is a oneround key agreement protocol based on bilinear maps. Tripartite key agreement protocols are useful in e-commerce transactions and in auditing services. However, this scheme does not authenticate the identities of the participants, just like the Diffie-Hellman protocol.

DOI
10.1201/b16763-41

Related papers

An Efficient Tripartite Identity-Based Authenticated Key Agreement Protocol

Xiaotong Fu, Shufang Guo, Ruijun Shi

In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2013•2 citations

A New Identity-Based Tripartite Authenticated Key Agreement Protocol

Hongyuan Wang

Now,most of the tripartite authenticated key agreement protocols have been proven to be insecure.We design the new identity-based tripartite authenticated key agreement protocol,it is based on the secure IBE scheme by Peng.This protocol's security based on bilinear decisional Diffie-Hellman assumption.This protocol could provide known key security,PKG forward secrecy,key-compromise impersonation resilience and unknown key-share resilience,so it's a secure tripartite authenticated key agreement protocol.

Microelectronics & Computer•Jan 1, 2011•0 citations

Insider Impersonation Attack on a Tripartite ID-Based Authenticated Key Agreement Protocol with Bilinear Pairings

Meng-Hui Lim, Sang-Gon Lee, Hoon Jae Lee

A key agreement protocol is designed for two or more entities to agree upon a shared secret key, which can subsequently be used to preserve confidentiality and data integrity over an open network. Since Joux has pioneered the notion of pairing-based tripartite key agreement protocol, various group key agreement schemes have been proposed after then. In 2003, Liu et al. proposed a tripartite identity-based authenticated key agreement protocol using bilinear pairings. Although the scheme is claimed to be efficient and secure, we discover that it is in fact breakable. In this paper, we highlight the flaw by demonstrating an insider impersonation attack on the scheme and suggest a few enhancements to conquer the defect.

International Conference on Next Generation Web Services Practices•Oct 1, 2008•1 citation

An Improvement of Certification-based One-Round Tripartite Key Agreement Protocols

Kambombo Mtong, Eun‐Jun Yoon

Key agreement protocols allow multi-parties exchanging public information to create a common secret key that is known only to those entities over an insecure network. Since Joux first published the pairing-based one round tripartite key agreement protocol, many authenticated protocols have been proposed. Unfortunately, many of them have been broken while others have been shown to be deficient in some desirable security attributes. In 2004, Cheng et al. presented two protocols aimed at strengthening Shim’s certificate-based and Zhang et al.’s tripartite identitybased protocols. This paper reports that 1) In Cheng et al.’s identity-based protocol, an adversary can extract long-term private keys of all the parties involved; and 2) Cheng et al.’s certificationbased protocol is weak against key integrity attacks. This paper suggests possible remedies for the security flaws in both protocols and then presents a modified Cheng et al.’s identity-based, oneround tripartite protocol that is more secure than the original protocol.

IEIE Transactions on Smart Processing and Computing•Oct 1, 2013•0 citations

ID-based Tripartite Multiple Key Agreement Protocol Facilitating Computer Auditing and Transaction Refereeing

Hung‐Yu Chien

Computer auditing and transaction refereeing require the system to keep genuine records. However, it is difficult for an auditor or a referee to on-line audit the contents or involve in the communication while the communication is kept confidential from others. This problem has a promising solution, when Joux proposed the first efficient tripartite key agreement protocol that enables three parties (that might include one referee) to establish a secure session key. However, several published schemes are not secure. This paper examines the weaknesses, and then proposes an ID-based tripartite multiple key agreement protocol to raise the level of security and improve the efficiency. The security is proved in a modified Bellare-Pointcheval-Rogaway model.

•Oct 1, 2006•4 citations

ID-based tripartite key agreement with signatures.

Divya Nalla

This paper proposes a new identity based tripartite key agreement protocol which is more efficient than the existing ID-based tripartite protocol. This protocol is based on the Joux's protocol for key agreement, and introduces signature along with key agreement to overcome man-in-the-middle attacks and to provide authentication. The new protocol resists existential forgeries against adaptively chosen message attacks under the random oracle model.

•Jan 1, 2003•34 citations
The first efficient tripartite key agreement protocol was developed by Joux (2000). It is a oneround key agreement protocol based on bilinear maps. Tripartite key agreement protocols are useful in e-commerce transactions and in auditing services. However, this scheme does not authenticate the identities of the participants, just like the Diffie-Hellman protocol.
In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.
Now,most of the tripartite authenticated key agreement protocols have been proven to be insecure.We design the new identity-based tripartite authenticated key agreement protocol,it is based on the secure IBE scheme by Peng.This protocol's security based on bilinear decisional Diffie-Hellman assumption.This protocol could provide known key security,PKG forward secrecy,key-compromise impersonation resilience and unknown key-share resilience,so it's a secure tripartite authenticated key agreement protocol.
A key agreement protocol is designed for two or more entities to agree upon a shared secret key, which can subsequently be used to preserve confidentiality and data integrity over an open network. Since Joux has pioneered the notion of pairing-based tripartite key agreement protocol, various group key agreement schemes have been proposed after then. In 2003, Liu et al. proposed a tripartite identity-based authenticated key agreement protocol using bilinear pairings. Although the scheme is claimed to be efficient and secure, we discover that it is in fact breakable. In this paper, we highlight the flaw by demonstrating an insider impersonation attack on the scheme and suggest a few enhancements to conquer the defect.
Key agreement protocols allow multi-parties exchanging public information to create a common secret key that is known only to those entities over an insecure network. Since Joux first published the pairing-based one round tripartite key agreement protocol, many authenticated protocols have been proposed. Unfortunately, many of them have been broken while others have been shown to be deficient in some desirable security attributes. In 2004, Cheng et al. presented two protocols aimed at strengthening Shim’s certificate-based and Zhang et al.’s tripartite identitybased protocols. This paper reports that 1) In Cheng et al.’s identity-based protocol, an adversary can extract long-term private keys of all the parties involved; and 2) Cheng et al.’s certificationbased protocol is weak against key integrity attacks. This paper suggests possible remedies for the security flaws in both protocols and then presents a modified Cheng et al.’s identity-based, oneround tripartite protocol that is more secure than the original protocol.
Computer auditing and transaction refereeing require the system to keep genuine records. However, it is difficult for an auditor or a referee to on-line audit the contents or involve in the communication while the communication is kept confidential from others. This problem has a promising solution, when Joux proposed the first efficient tripartite key agreement protocol that enables three parties (that might include one referee) to establish a secure session key. However, several published schemes are not secure. This paper examines the weaknesses, and then proposes an ID-based tripartite multiple key agreement protocol to raise the level of security and improve the efficiency. The security is proved in a modified Bellare-Pointcheval-Rogaway model.