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

Dynamic Group Key Agreement in Tree-Based Setting.

Ratna Dutta, Rana Barua

Published Jan 1, 2005• 0 citations
OpenAlex

Related papers

Dynamic Group Key Agreement in Tree-Based Setting

Ratna Dutta, Rana Barua

Lecture notes in computer science•Jan 1, 2005•48 citations

Provably Secure Authenticated Tree Based Group Key Agreement

Ratna Dutta, Rana Barua, Palash Sarkar

Lecture notes in computer science•Jan 1, 2004•44 citations

Constant Round Dynamic Group Key Agreement.

Ratna Dutta, Rana Barua

•Jan 1, 2005•0 citations

Dynamic tree-based authenticated group key exchange protocol

Hui Li, Chuan-Kun Wu, JiKai Teng

Science China Information Sciences•Jul 8, 2010•2 citations

Constant Round Dynamic Group Key Agreement

Ratna Dutta, Rana Barua

Lecture notes in computer science•Jan 1, 2005•59 citations

A fault‐tolerant group key agreement protocol exploiting dynamic setting

Zi‐Yao Cheng, Yun Liu, Chin‐Chen Chang +1 more

SUMMARY A fault‐tolerant group key agreement is an essential infrastructure for Internet communication among all involved participants; it can establish a secure session key no matter how many malicious participants exit simultaneously in an effort to disrupt the key agreement process. Recently, Zhao et al. proposed an efficient fault‐tolerant group key agreement protocol named efficient group key agreement that can resist denial‐of‐service attacks, reply attacks, man‐in‐middle attacks, and common modulus attacks; it can also preserve forward secrecy with lower computational cost than previous protocols. We show that it is still vulnerable to active attacks by malicious participants and modify the corresponding security weakness adaptively. Furthermore, we propose an efficient fault‐tolerant group key agreement based on a binary tree structure and enhance it to a dynamic setting where participants can leave or join the group arbitrarily according to their preferences with instant session key refreshment. Additionally, our session key refreshment is based on secure key updating to protect forward/backward confidentiality and is resistant to active/passive attacks. The performance analysis shows that our proposed protocol has lower computational cost and little additional communication cost exploiting dynamic setting. Copyright © 2013 John Wiley & Sons, Ltd.

International Journal of Communication Systems•Jan 21, 2013•14 citations
SUMMARY A fault‐tolerant group key agreement is an essential infrastructure for Internet communication among all involved participants; it can establish a secure session key no matter how many malicious participants exit simultaneously in an effort to disrupt the key agreement process. Recently, Zhao et al. proposed an efficient fault‐tolerant group key agreement protocol named efficient group key agreement that can resist denial‐of‐service attacks, reply attacks, man‐in‐middle attacks, and common modulus attacks; it can also preserve forward secrecy with lower computational cost than previous protocols. We show that it is still vulnerable to active attacks by malicious participants and modify the corresponding security weakness adaptively. Furthermore, we propose an efficient fault‐tolerant group key agreement based on a binary tree structure and enhance it to a dynamic setting where participants can leave or join the group arbitrarily according to their preferences with instant session key refreshment. Additionally, our session key refreshment is based on secure key updating to protect forward/backward confidentiality and is resistant to active/passive attacks. The performance analysis shows that our proposed protocol has lower computational cost and little additional communication cost exploiting dynamic setting. Copyright © 2013 John Wiley & Sons, Ltd.