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

Computer Communications

An efficient fault-tolerant group key agreement protocol

Jianjie Zhao, Dawu Gu, Yali Li

Published Jan 15, 2010• 26 citations
Publisher
DOI
10.1016/j.comcom.2010.01.001

Related papers

A Practical and Secure Fault-Tolerant Conference-Key Agreement Protocol

Wen-Guey Tzeng

Lecture notes in computer science•Jan 1, 2000•37 citations

A conference key agreement protocol with fault-tolerant capability

Kuo‐Hsuan Huang, Yu‐Fang Chung, Hsiu-Hui Lee +2 more

Computer Standards & Interfaces•May 19, 2008•31 citations

A communication-efficient and fault-tolerant conference-key agreement protocol with forward secrecy

Yuh‐Min Tseng

Journal of Systems and Software•Dec 13, 2006•34 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

A Provable Secure Group Key Agreement Protocol with Fault-Tolerant

Lansheng Han

This paper indicates that Burmester et al.'s group key agreement protocol which based on the authenticated broadcast channel is unable to withstand the disruption attack and key-control attack of malicious participants in group.These two attacks lead that other honest participants will compute different session key and other honest participants compute the fixed session key which is determined previously by malicious participants,respectively.In this paper,a fault-tolerant group key agreement(FT-GKA) protocol is proposed.Even if there are malicious participants trying to attack the establishment of a session key,all other honest participants following the proposed protocol are still able to compute the correct session key using the digital signature technology.Paper proves the protocol can withstand the passive attack of adversary under the DDH assumption,and the protocol can withstand the interrupted attack and key-control attack from malicious participants under the DL assumption and the random oracle model.Furthermore,the proposed protocol possesses both constant number of rounds and lower computation overhead.

Dianzi xuebao•Jan 1, 2009•0 citations

A Framework for Robust Group Key Agreement

Jens-Matthias Bohli

Lecture notes in computer science•Jan 1, 2006•27 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.
This paper indicates that Burmester et al.'s group key agreement protocol which based on the authenticated broadcast channel is unable to withstand the disruption attack and key-control attack of malicious participants in group.These two attacks lead that other honest participants will compute different session key and other honest participants compute the fixed session key which is determined previously by malicious participants,respectively.In this paper,a fault-tolerant group key agreement(FT-GKA) protocol is proposed.Even if there are malicious participants trying to attack the establishment of a session key,all other honest participants following the proposed protocol are still able to compute the correct session key using the digital signature technology.Paper proves the protocol can withstand the passive attack of adversary under the DDH assumption,and the protocol can withstand the interrupted attack and key-control attack from malicious participants under the DL assumption and the random oracle model.Furthermore,the proposed protocol possesses both constant number of rounds and lower computation overhead.