Efficient Group Key Management Protocol Research Articles

ALMS: Asymmetric Lightweight Centralized Group Key Management Protocol for VANETs

Vehicular ad hoc networks (VANETs) were initially designed to assist in traffic management and delivery of safety messages. Due to the significant evolution in modern vehicles, the features offered by VANETs have expanded to include comfort and entertainment relevant services. This expansion has further increased the need to secure them. The security of VANETs is mainly dependent on sharing a cryptographic group key confidentially. Due to the frequent change in group membership, there is a need to update the group key repeatedly, which is difficult in highly dynamic networks like VANETs. Therefore, designing a secure, scalable, and efficient group key management protocol is challenging. Existing group key management protocols introduce a variety of limitations, including high computational cost for both group key computation and retrieval, additional computational and communication overhead when the membership in the group changes, and collusion among receiving vehicles. To overcome these limitations, this paper introduces a novel group key management protocol, ALMS. Performance analysis reveals that, compared to existing protocols, ALMS is more scalable since it introduces a low computational overhead for both the Trusted Authority (TA) and the receiving vehicles. Also, it does not suffer from the key distribution limitation as symmetric key management protocols do. Moreover, ALMS introduces only a light overhead on the TA for group membership change. This is achieved by decoupling the initialization from group key computation and performing it offline without affecting the size of the encrypted group key.

A Secure and Efficient Group Key Management Protocol with Cooperative Sensor Association in WBANs.

The wireless body area network (WBAN) is considered as one of the emerging wireless techniques in the healthcare system. Typical WBAN sensors, especially implantable sensors, have limited power capability, which restricts their wide applications in the medical environment. In addition, it is necessary for the healthcare center (HC) to broadcast significant notifications to different patient groups. Considering the above issues, in this paper, the novel practical WBAN system model with group message broadcasting is built. Subsequently, a secure and efficient group key management protocol with cooperative sensor association is proposed. In the proposed protocol, the Chinese remainder theorem (CRT) is employed for group key management between HC and the personal controller (PC), which also supports batch key updating. The proposed sensor association scheme is motivated by coded cooperative data exchange (CCDE). The formal security proofs are presented, indicating that the proposed protocol can achieve the desired security properties. Moreover, performance analysis demonstrates that the proposed protocol is efficient compared with state-of-the-art group key management protocols.

A Centralized Key Table based Communication Efficient Group Key Management Protocol

Group key management is an integral part of secure multicast. Minimizing the number of rekeying messages, maintaining the forward and backward secrecy has always been a challenging task. Though there are many solutions which reduce the rekeying messages from O(n) to O(log2n), they increase with the increase in group size. In this paper, we present a centralized key table based communication efficient group key management protocol in which number of rekeying messages is independent of the group size. In this protocol key management server (KMS) divides a group of n members into n subgroups of size n−1 and maintains a table of n subkeys along with member ID and one group key. Each member has n−1 subkeys, which is a subset of n subkeys of KMS and one group key. The proposed protocol requires only one multicast rekeying message per joining of a new member as well as per eviction of any existing member. As the number of rekeying messages is not dependent on group size, it requires less computation. Index Terms—Group key management, rekeying, subkeys, secure multicast, forward and backward secrecy.

An Efficient Group Key Management Using Code for Key Calculation for Simultaneous Join/Leave: CKCS

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.

An efficient group key management protocol using code for key calculation: CKC

This paper presents a new group key management protocol, CKC (Code for Key Calculation) for secure IP multicast. In this protocol which is based on logical key hierarchy, only the group key needs to be sent to new member at join. Then, using the group key current members and the new member calculate the necessary keys by node codes and one-way hash function. A node code is a random number assigned to each node to help users calculate necessary keys. Again, at leave server just sends the new group key to the remaining members. By this key, members calculate necessary keys using node codes and one-way hash function. The security of the keys is based on one-wayness of hash function. The results show that CKC reduces computational and communication overhead, and message size largely at join without increasing them at leave.