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

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

Two Attacks on Dutta’s Dynamic Group Key Agreement Protocol

Hui Zhang, Chunxiang Xu, Chengbang Li, Abdur Rashid Sangi

Published Jan 1, 2012• 3 citations
Publisher
DOI
10.1007/978-3-642-29157-9_40

Related papers

Security Weaknesses in Harn-Lin and Dutta-Barua Protocols for Group Key Establishment

Junghyun Nam

Key establishment protocols are fundamental for establishing secure communication channels over public insecure networks.Security must be given the topmost priority in the design of a key establishment protocol.In this work, we provide a security analysis on two recent key establishment protocols: Harn and Lin's group key transfer protocol and Dutta and Barua's group key agreement protocol.Our analysis shows that both the Harn-Lin protocol and the Dutta-Barua protocol have a flaw in their design and can be easily attacked.The attack we mount on the Harn-Lin protocol is a replay attack whereby a malicious user can obtain the long-term secrets of any other users.The Dutta-Barua protocol is vulnerable to an unknown key-share attack.For each of the two protocols, we present how to eliminate their security vulnerabilities.We also improve Dutta and Barua's proof of security to make it valid against unknown key share attacks.

KSII Transactions on Internet and Information Systems•Jan 1, 2012•16 citations

Key agreement protocols and their security analysis

Simon Blake-Wilson⋆⋆, Don B. Johnson, Alfred Menezes

Lecture notes in computer science•Jan 1, 1997•601 citations

Analysis of an Authenticated 3-Round Identity-Based Group Key Agreement Protocol

Wei Yuan, Liang Qing Hu, Hongtu Li +1 more

Lecture notes in electrical engineering•Nov 28, 2011•1 citation

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

Chik-How Tan, Guomin Yang

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.

IEEE Transactions on Information Theory•Oct 20, 2010•6 citations

Vulnerability of two multiple-key agreement protocols

Mohammad Sabzinejad Farash, Majid Bayat, Mahmoud Ahmadian‐Attari

Computers & Electrical Engineering•Mar 1, 2011•25 citations

ID-Based Authenticated Key Agreement Protocol in Dynamic Peer Groups

Xiao Guo-zhen

The two round dynamic group key agreement protocol(DB08 protocol) proposed by Dutta and Barua doesn't provide key independence.To improve DB08 protocol,an ID-based authenticated key agreement protocol in dynamic peer groups is presented by using Sakai R and Kasahara M's key construction.To avoid the correlation of the sub-keys for different sessions,hash functions and session identifiers are included while computing the sub-keys in the new protocol.So the new protocol achieves key independence,and it provides perfect forward secrecy,KGC-forward secrecy and resistance to passive and active attacks as well.Compared with DB08 protocol,the computation and communication costs are greatly reduced in the new protocol.So the new protocol is more efficient and applicable for dynamic peer network.

Journal of Wuhan University•Jan 1, 2008•0 citations
Key establishment protocols are fundamental for establishing secure communication channels over public insecure networks.Security must be given the topmost priority in the design of a key establishment protocol.In this work, we provide a security analysis on two recent key establishment protocols: Harn and Lin's group key transfer protocol and Dutta and Barua's group key agreement protocol.Our analysis shows that both the Harn-Lin protocol and the Dutta-Barua protocol have a flaw in their design and can be easily attacked.The attack we mount on the Harn-Lin protocol is a replay attack whereby a malicious user can obtain the long-term secrets of any other users.The Dutta-Barua protocol is vulnerable to an unknown key-share attack.For each of the two protocols, we present how to eliminate their security vulnerabilities.We also improve Dutta and Barua's proof of security to make it valid against unknown key share attacks.
The two round dynamic group key agreement protocol(DB08 protocol) proposed by Dutta and Barua doesn't provide key independence.To improve DB08 protocol,an ID-based authenticated key agreement protocol in dynamic peer groups is presented by using Sakai R and Kasahara M's key construction.To avoid the correlation of the sub-keys for different sessions,hash functions and session identifiers are included while computing the sub-keys in the new protocol.So the new protocol achieves key independence,and it provides perfect forward secrecy,KGC-forward secrecy and resistance to passive and active attacks as well.Compared with DB08 protocol,the computation and communication costs are greatly reduced in the new protocol.So the new protocol is more efficient and applicable for dynamic peer network.