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

Computers & Security

Constant round group key agreement protocols

MakriEleftheria, KonstantinouElisavet

Published Nov 1, 2011• 0 citations
OpenAlex

Abstract

The scope of this paper is to review and evaluate all constant round Group Key Agreement (GKA) protocols proposed so far in the literature. We have gathered all GKA protocols that require 1,2,3,4 a...

Related papers

A Survey of Group Key Agreement Protocols with Constant Rounds

Hu Xiong, Yan Xuan Wu, Zhenyu Lu

Group key agreement (shorten as GKA) protocol enables a group of users to negotiate a one-time session key and protect the thereafter group-oriented communication with this session key across an unreliable network. The number of communication rounds is one of the main concern for practical applications where the cardinality of group participants involved is considerable. It is critical to have fixed constant rounds in GKA protocols to secure these applications. In light of overwhelming variety and multitude of constant-round GKA protocols, this article surveys these protocols from a series of perspectives to supply better comprehension for researchers and scholars. Concretely, this article captures the state of the art of constant-round GKA protocols by analyzing the design rationale, examining the framework and security model, and evaluating all discussed protocols in terms of efficiency and security properties. In addition, this article discusses the extension of constant-round GKA protocols including dynamic membership updating, password-based, affiliation-hiding, and fault-tolerance. In conclusion, this article also points out a number of interesting future directions.

ACM Computing Surveys•Jun 18, 2019•31 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

A Secure Constant Round Authenticated Group Key Agreement for Dynamic Groups

Lili Yan, Yan Chang

International Journal of Digital Content Technology and its Applications•Mar 15, 2013•0 citations

Constant Round Authenticated Group Key Agreement via Distributed Computation

Emmanuel Bresson, Dario Catalano

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

Constant Round Dynamic Group Key Agreement

Ratna Dutta, Rana Barua

Lecture notes in computer science•Jan 1, 2005•59 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
Group key agreement (shorten as GKA) protocol enables a group of users to negotiate a one-time session key and protect the thereafter group-oriented communication with this session key across an unreliable network. The number of communication rounds is one of the main concern for practical applications where the cardinality of group participants involved is considerable. It is critical to have fixed constant rounds in GKA protocols to secure these applications. In light of overwhelming variety and multitude of constant-round GKA protocols, this article surveys these protocols from a series of perspectives to supply better comprehension for researchers and scholars. Concretely, this article captures the state of the art of constant-round GKA protocols by analyzing the design rationale, examining the framework and security model, and evaluating all discussed protocols in terms of efficiency and security properties. In addition, this article discusses the extension of constant-round GKA protocols including dynamic membership updating, password-based, affiliation-hiding, and fault-tolerance. In conclusion, this article also points out a number of interesting future directions.