A Secure Key Agreement Protocol for Dynamic Group
Muhammad Bilal, Shin-Gak Kang

TL;DR
This paper introduces a novel, efficient group key agreement protocol for dynamic environments that leverages state vectors, enabling secure, scalable, and flexible subgroup communication with minimal rekeying overhead.
Contribution
It proposes a new methodology using state vectors for secure, scalable group key agreement in dynamic multicast groups, improving efficiency and security.
Findings
Protocol is secure and efficient in communication and computation.
Supports multiple subgroup multicast keys derived from local state vectors.
Reduces rekeying frequency in dynamic group environments.
Abstract
To accomplish secure group communication, it is essential to share a unique cryptographic key among group members. The underlying challenges to group key agreement are scalability, efficiency, and security. In a dynamic group environment, the rekeying process is more frequent; therefore, it is more crucial to design an efficient group key agreement protocol. Moreover, with the emergence of various group-based services, it is becoming common for several multicast groups to coexist in the same network. These multicast groups may have several shared users; a join or leave request by a single user can trigger regeneration of multiple group keys. Under the given circumstances the rekeying process becomes a challenging task. In this work, we propose a novel methodology for group key agreement which exploits the state vectors of group members. The state vector is a set of randomly generated…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
