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

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

Further Analysis of ID-Based Authenticated Group Key Agreement Protocol from Bilinear Maps

K.-A. SHIM

Published Jan 1, 2007• 24 citations
Publisher

Abstract

Recently, Choi et al. proposed an ID-based authenticated group key agreement with bilinear maps. Subsequently, Zhang and Chen showed that the protocol does not provide authenticity as claimed by replaying transcripts of the past session. To prevent those replay attacks, they suggest adding a time parameter to the message being signed. However, despite of such a modification, we show that the protocol is still insecure against insider colluding attacks without replaying transcripts of the past session.

DOI
10.1093/ietfec/e90-a.1.295

Related papers

ID-Based Authenticated Group Key Agreement Secure against Insider Attacks

Kyu Young Choi, June Hwang, Dong Hoon Lee

In 2004, Choi et al. proposed an ID-based authenticated group key agreement. Unfortunately, their protocol was found to be vulnerable to the insider attacks by Zhang, Chen and Shim. To prevent insider attacks, Shim presented a modification of Choi et al.'s protocol. In this letter, we first show that Shim's modification is still insecure against insider attacks. We then present a modification of Choi et al.'s protocol that resists insider attacks. The counter-measure uses an ID-based signature on transcripts in order to bind them in a session. This prevents any replay of transcripts. Especially, by applying ID-based batch verification, the proposed one still consists of two rounds and is computationally efficient.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jul 1, 2008•26 citations

Comments on an ID-Based Authenticated Group Key Agreement Protocol with Withstanding Insider Attacks

Tsu‐Yang Wu, Yuh‐Min Tseng

In PKC 2004, Choi et al. proposed an ID-based authenticated group key agreement (AGKA) protocol using bilinear pairings. Unfortunately, their protocol suffered from an impersonation attack and an insider colluding attack. In 2008, Choi et al. presented an improvement to resist insider attacks. In their modified protocol, they used an ID-based signature scheme on transcripts for binding them in a session to prevent replay of transcripts. In particular, they smartly used the batch verification technique to reduce the computational cost. In this paper, we first show that Choi et al.'s modified AGKA protocol still suffers from an insider colluding attack. Then, we prove that the batch verification of the adopted ID-based signature scheme in their modified protocol suffers from a forgery attack.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2009•9 citations

Identity-based group key exchange protocols resistant to colluding attacks

Yunjie Jiang

An ID-based authenticated group key agreement (AGKA) protocol allows a group of members to share a key and provide an assurance of key sharing with an intended group with the user's identity, which is used for conferencing environments. In 2004, Choi et al proposed an ID-based authenticated group key agreement with bilinear maps (also called CHL protocols), which was extended from Burmester and Desmedt conference key agreement protocols. Unfortunately, their protocols were found to be vulnerable to the insider attacks in which cases that the two malicious users have the previous authentication transcripts of the party by Zhang, Chen and Shim. In this paper, we proposed an improved ID-based AGKA. In our scheme, each session has a unique session identity which is published by Key Generation Center. With such unique session identity binding to each session, our protocols can prevent the insider attack. Especially, our protocols can not enhance the computationally cost and it is still efficient.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jan 11, 2012•0 citations

Improving Choi et al.'s ID-based Authenticated Group Key Agreement Scheme at PKC2004

Hyewon Park, Kyusuk Han, Chan Yeob Yeun +1 more

In modern network computing, authenticated group key agreement (AGKA) is important for conferencing. After Shamir [2] proposed the ID-based cryptosystem in 1984, the various applications on the ID-based cryptosystem have been actively studied, due to the simple key management complexity. For the AGKA, Choi et al. [16] proposed an ID-based authenticated group key agreement with bilinear maps, which was extended from Burmester and Desmedt conference key agreement protocol [5]. After that, Zhang and Chen [15] showed that the impersonation attack on Choi et al. protocol is feasible when two malicious users have the previous authentication transcripts of the entity. Shim [19] showed that the insider colluding attacks can be done without the previous transcripts. In this paper, we propose an improved ID-based AGKA. In our scheme, Key Generation Center (KGC) keeps the list of randomized user index instead of only generating private key. The random user indexing means KGC shuffles the order of users’ indices by randomizing to hide it so that the malicious users cannot know the order. KGC also verify all users than only verifies 3 users in Choi et al.’s protocol. Our protocol can prevent replay attack of Zhang and Chen and insider colluding attack of Shim.

•Jan 1, 2008•3 citations

Attack on An ID-based Authenticated Group Key Exchange Protocol with Identifying Malicious Participants

Fushan Wei, Yun Wei, Chuangui Ma

An authenticated group key exchange (AGKE) protocol allows a group of participants to establish a common session key and then provides secure group communications in collaborative and distributed applications. Recently, Wu et al. proposed an ID-based authenticated group key exchange protocol based on bilinear pairings. They claimed that their protocol can detect and identify the malicious participants, which means it not only can check whether malicious participants exist in the protocol or not, but also can find out who the malicious participants are. However, their protocol is not as secure as claimed. In this letter, we show that Wu et al.'s protocol is insecure against an insider colluding attack. Two malicious participants can collude to impersonate several honest participants to the rest participants in the group. In addition, we also figure out what has gone wrong with Wu et al.'s protocol and how to fix it.

International journal of network security•Mar 1, 2016•6 citations

A Dynamic ID-based Authenticated Group Key Agreement Protocol

Jun Zheng, Cheng Yang, Jinrong Xue +1 more

Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication.While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important.In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure.Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority.Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable.This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings.It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable.Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence.Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary. 1.

National Conference on Electrical, Electronics and Computer Engineering (NCEECE)•Jan 1, 2016•12 citations
Recently, Choi et al. proposed an ID-based authenticated group key agreement with bilinear maps. Subsequently, Zhang and Chen showed that the protocol does not provide authenticity as claimed by replaying transcripts of the past session. To prevent those replay attacks, they suggest adding a time parameter to the message being signed. However, despite of such a modification, we show that the protocol is still insecure against insider colluding attacks without replaying transcripts of the past session.
In 2004, Choi et al. proposed an ID-based authenticated group key agreement. Unfortunately, their protocol was found to be vulnerable to the insider attacks by Zhang, Chen and Shim. To prevent insider attacks, Shim presented a modification of Choi et al.'s protocol. In this letter, we first show that Shim's modification is still insecure against insider attacks. We then present a modification of Choi et al.'s protocol that resists insider attacks. The counter-measure uses an ID-based signature on transcripts in order to bind them in a session. This prevents any replay of transcripts. Especially, by applying ID-based batch verification, the proposed one still consists of two rounds and is computationally efficient.
In PKC 2004, Choi et al. proposed an ID-based authenticated group key agreement (AGKA) protocol using bilinear pairings. Unfortunately, their protocol suffered from an impersonation attack and an insider colluding attack. In 2008, Choi et al. presented an improvement to resist insider attacks. In their modified protocol, they used an ID-based signature scheme on transcripts for binding them in a session to prevent replay of transcripts. In particular, they smartly used the batch verification technique to reduce the computational cost. In this paper, we first show that Choi et al.'s modified AGKA protocol still suffers from an insider colluding attack. Then, we prove that the batch verification of the adopted ID-based signature scheme in their modified protocol suffers from a forgery attack.
An ID-based authenticated group key agreement (AGKA) protocol allows a group of members to share a key and provide an assurance of key sharing with an intended group with the user's identity, which is used for conferencing environments. In 2004, Choi et al proposed an ID-based authenticated group key agreement with bilinear maps (also called CHL protocols), which was extended from Burmester and Desmedt conference key agreement protocols. Unfortunately, their protocols were found to be vulnerable to the insider attacks in which cases that the two malicious users have the previous authentication transcripts of the party by Zhang, Chen and Shim. In this paper, we proposed an improved ID-based AGKA. In our scheme, each session has a unique session identity which is published by Key Generation Center. With such unique session identity binding to each session, our protocols can prevent the insider attack. Especially, our protocols can not enhance the computationally cost and it is still efficient.
In modern network computing, authenticated group key agreement (AGKA) is important for conferencing. After Shamir [2] proposed the ID-based cryptosystem in 1984, the various applications on the ID-based cryptosystem have been actively studied, due to the simple key management complexity. For the AGKA, Choi et al. [16] proposed an ID-based authenticated group key agreement with bilinear maps, which was extended from Burmester and Desmedt conference key agreement protocol [5]. After that, Zhang and Chen [15] showed that the impersonation attack on Choi et al. protocol is feasible when two malicious users have the previous authentication transcripts of the entity. Shim [19] showed that the insider colluding attacks can be done without the previous transcripts. In this paper, we propose an improved ID-based AGKA. In our scheme, Key Generation Center (KGC) keeps the list of randomized user index instead of only generating private key. The random user indexing means KGC shuffles the order of users’ indices by randomizing to hide it so that the malicious users cannot know the order. KGC also verify all users than only verifies 3 users in Choi et al.’s protocol. Our protocol can prevent replay attack of Zhang and Chen and insider colluding attack of Shim.
An authenticated group key exchange (AGKE) protocol allows a group of participants to establish a common session key and then provides secure group communications in collaborative and distributed applications. Recently, Wu et al. proposed an ID-based authenticated group key exchange protocol based on bilinear pairings. They claimed that their protocol can detect and identify the malicious participants, which means it not only can check whether malicious participants exist in the protocol or not, but also can find out who the malicious participants are. However, their protocol is not as secure as claimed. In this letter, we show that Wu et al.'s protocol is insecure against an insider colluding attack. Two malicious participants can collude to impersonate several honest participants to the rest participants in the group. In addition, we also figure out what has gone wrong with Wu et al.'s protocol and how to fix it.
Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication.While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important.In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure.Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority.Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable.This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings.It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable.Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence.Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary. 1.