An Efficient Group Key Management Using Code for Key Calculation for Simultaneous Join/Leave: CKCS
Melisa Hajyvahabzadeh, Elina Eidkhani, S. Anahita Mortazavi, Alireza, Nemaney Pour

TL;DR
The paper introduces CKCS, an efficient group key management protocol that minimizes overhead during simultaneous join and leave events in secure multicast groups by using node codes and hash functions.
Contribution
CKCS is a novel protocol that reduces computational and communication costs in group key management during simultaneous join/leave operations.
Findings
Reduces message size during join/leave
Decreases computational overhead
Enhances efficiency in secure multicast
Abstract
This paper presents an efficient group key management protocol, CKCS (Code for Key Calculation in Simultaneous join/leave) for simultaneous join/leave in secure multicast. This protocol is based on logical key hierarchy. In this protocol, when new members join the group simultaneously, server sends only the group key for those new members. Then, current members and new members calculate the necessary keys by node codes and one-way hash function. A node code is a random number which is assigned to each key to help users calculate the necessary keys. Again, at leave, the server just sends the new group key to remaining members. The results show that CKCS reduces computational and communication overhead, and also message size in simultaneous join/leave.
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.
