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

IEEE Transactions on Information Theory

Comments on "Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting

Chik-How Tan, Guomin Yang

Published Oct 20, 2010• 6 citations
Publisher

Abstract

In a recent paper, Dutta and Barua presented a group key agreement protocol in dynamic setting. The protocol allows users to efficiently join or leave a group and was believed to be provably secure. In this letter, we point out a flaw in the Dutta-Barua dynamic group key agreement protocol.
DOI
10.1109/tit.2010.2070590

Related papers

Security Analysis of Provably Secure Constant Round Dynamic Group Key Agreement

J. C. M. TEO, Chaowei Tan, J.M. Ng

Recently, Dutta and Barua proposed provably secure constant round authenticated group key agreement protocols in dynamic scenario. In this letter, we show that their Leave Protocol does not provide forward secrecy, that is, a leaving user can still obtain the new session key used in subsequent sessions.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Nov 1, 2006•6 citations

Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting

Ratna Dutta, Rana Barua

In this paper, we present and analyze a variant of Burmester-Desmedt group key agreement protocol (BD) and enhance it to dynamic setting where a set of users can leave or join the group at any time during protocol execution with updated keys. In contrast to BD protocol, let us refer to our protocol as DB protocol. Although the DB protocol is similar to BD protocol, there are subtle differences between them: 1) Key computation in DB protocol is different and simpler than in BD protocol with same complexity of BD protocol; 2) Number of rounds required in our authenticated DB protocol is one less than that in authenticated BD protocol introduced by Katz-Yung; 3) DB protocol is more flexible than BD protocol in the sense that DB protocol is dynamic. The reusability of user's precomputed data in previous session enables the join and leave algorithms of our DB protocol to reduce most user's computation complexities which can be useful in real life applications; and 4) DB protocol has the ability to detect the presence of corrupted group members, although one can not detect who among the group members are behaving improperly.

IEEE Transactions on Information Theory•Apr 28, 2008•104 citations

Provable Secure Constant-Round Group Key Agreement Protocol Based on Secret Sharing

Ruxandra F. Olimid

Advances in intelligent systems and computing•Aug 8, 2013•3 citations

Two Attacks on Dutta’s Dynamic Group Key Agreement Protocol

Hui Zhang, Chunxiang Xu, Chengbang Li +1 more

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2012•3 citations

Cryptanalysis of an ID-based Authenticated Dynamic Group Key Agreement with Optimal Round

Qingfeng Cheng, Chunming Tang

Recently, Teng, Wu and Tang proposed a new ID-based authenticated dynamic group key agreement (DGKA) protocol. They claimed that leaving users cannot calculate subsequent group session keys and joining users cannot calculate previous group session keys. In this paper, we will show that Teng et al.’s protocol cannot provide forward condentiality or backward condentiality.

International journal of network security•Jan 1, 2015•6 citations

Provably secure one-round certificateless authenticated group key agreement protocol for secure communications

SK Hafizul Islam, Abhishek Kumar Singh

Wireless Personal Communications•Jun 23, 2015•15 citations
In this paper, we present and analyze a variant of Burmester-Desmedt group key agreement protocol (BD) and enhance it to dynamic setting where a set of users can leave or join the group at any time during protocol execution with updated keys. In contrast to BD protocol, let us refer to our protocol as DB protocol. Although the DB protocol is similar to BD protocol, there are subtle differences between them: 1) Key computation in DB protocol is different and simpler than in BD protocol with same complexity of BD protocol; 2) Number of rounds required in our authenticated DB protocol is one less than that in authenticated BD protocol introduced by Katz-Yung; 3) DB protocol is more flexible than BD protocol in the sense that DB protocol is dynamic. The reusability of user's precomputed data in previous session enables the join and leave algorithms of our DB protocol to reduce most user's computation complexities which can be useful in real life applications; and 4) DB protocol has the ability to detect the presence of corrupted group members, although one can not detect who among the group members are behaving improperly.