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

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

Hung‐Yu Chien

Published Oct 1, 2006• 4 citations
Publisher

Abstract

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.

DOI
10.6382/jim.200610.0016

Related papers

An Efficiency Improved ID-based Tripartite Key Agreement Protocol

Park Young-Ho, Rhee Kyung-Hyune

As the ID-based public key cryptosystems become a very active research area, a number of ID-based key agreement protocols have been proposed, but unfortunately many of them were analyzed that there were some security flaws in the protocols. In addition to key agreement protocols, in recent, Liu et al. and Kim et al. proposed the key agreement protocols that multiple session keys are established at once among participated entities. In this paper, we propose an ID-based tripartite key agreement protocol that establishes 8 keys by improving the efficiency of the Liu et al's. Moreover, the proposed protocol can be used in the situation where multiple different private key generators(PKG) are involved. Therefore, because the private key issued by different PKGs belonging to each entity's domain can be used, our proposed scheme is more efficiently applicable to the practical applications.

Information Security and Cryptology•Jan 1, 2005•0 citations

New secure explicitly authenticated key agreement protocols

Y. Abouelseoud & M. Nabil

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.

CRC Press eBooks•Apr 7, 2014•0 citations

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

An Improved One-Round ID-Based Tripartite Authenticated Key Agreement Protocol.

Meng-Hui Lim, Sang-Gon Lee

Abstract. A tripartite authenticated key agreement protocol is generally designed to accommodate the need of three speci c entities in communicating over an open network with a shared secret key, which is used to preserve con dentiality and data integrity. Since Joux initiates the development of tripartite key agreement protocol, many prominent tripartite schemes have been proposed subsequently. In 2005, Tso et al. have proposed an ID-based non-interactive tripartite key agreement scheme with k-resilience. Based on this scheme, they have further proposed another one-round tripartite application scheme. Although they claimed that both schemes are e cient and secure, we discover that both schemes are in fact breakable. In this paper, we impose several impersonation attacks on Tso et al.s schemes in order to highlight their aws. Subsequently, we propose an enhanced scheme which will not only conquer their defects, but also preserve the desired security attributes of a key agreement protocol. 1

•Jan 1, 2007•6 citations

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

Pairing-Based Two-Party Authenticated Key Agreement Protocol.

Rongxing Lu, Zhenfu Cao, Renwang Su +1 more

Abstract. To achieve secure data communications, two parties should be authenticated by each other and agree on a secret session key by exchanging messages over an insecure channel. In this paper, based on the bilinear pairing, we present a new two-party authenticated key agreement protocol, and use the techniques from provable security to examine the security of our protocol within Bellare-Rogaway model. 1

•Jan 1, 2005•6 citations
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.
As the ID-based public key cryptosystems become a very active research area, a number of ID-based key agreement protocols have been proposed, but unfortunately many of them were analyzed that there were some security flaws in the protocols. In addition to key agreement protocols, in recent, Liu et al. and Kim et al. proposed the key agreement protocols that multiple session keys are established at once among participated entities. In this paper, we propose an ID-based tripartite key agreement protocol that establishes 8 keys by improving the efficiency of the Liu et al's. Moreover, the proposed protocol can be used in the situation where multiple different private key generators(PKG) are involved. Therefore, because the private key issued by different PKGs belonging to each entity's domain can be used, our proposed scheme is more efficiently applicable to the practical applications.
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.
Abstract. A tripartite authenticated key agreement protocol is generally designed to accommodate the need of three speci c entities in communicating over an open network with a shared secret key, which is used to preserve con dentiality and data integrity. Since Joux initiates the development of tripartite key agreement protocol, many prominent tripartite schemes have been proposed subsequently. In 2005, Tso et al. have proposed an ID-based non-interactive tripartite key agreement scheme with k-resilience. Based on this scheme, they have further proposed another one-round tripartite application scheme. Although they claimed that both schemes are e cient and secure, we discover that both schemes are in fact breakable. In this paper, we impose several impersonation attacks on Tso et al.s schemes in order to highlight their aws. Subsequently, we propose an enhanced scheme which will not only conquer their defects, but also preserve the desired security attributes of a key agreement protocol. 1
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.