An Efficient Multi-Group Key Management Protocol for Internet of Things

Abstract

Internet of Things (IoT) is a network made up of a large number of devices which are able to automatically communicate to computer systems, people and each other providing various services for the benefit of society. One of the main challenges facing the IoT is how to secure communication between these devices. Among all the issues, the Group Key Management is one of the most difficult. Although different approaches have been proposed to solve it, most of them use the same security parameters to secure all communications. Thus, if several services are provided by the network, communications within a service will be accessible to all network members even those which did not subscribe to it. Moreover, the compromise of a member will jeopardize all services. In this paper, we propose a highly scalable Multi-Group Key Management protocol for IoT which ensures the forward and backward secrecy, efficiently recovers from collusion attacks and guarantees the secure coexistence of several services in a single network. To achieve this, our protocol manages several groups with independent security parameters.

Logical Tree Based Secure Rekeying Management for Smart Devices Groups in IoT Enabled WSN

“…In this section simulation results are presented for energy consumption, resilience and rekeying operations. We have compared results with base schemes GKM [13], RiSeG [15] and LNT [20]. The proposed scheme is simulated using NS2.35 with C language on Fedora core-16.…”

“…A highly scalable multi-group keying for IoT is proposed to ensure the backward and forward secrecy. It also ensures the co-existence of variety of related services in the same region along with independent security parameters [15]. Kung and Hsiao have presented a lightweight scheme for group key management in dynamic IoT scenarios.…”

A versatile Key Management protocol for secure Group and Device-to-Device Communication in the Internet of Things

“…Moreover, the capture of a member will jeopardize all services. In previous works [26,27], we proposed algorithms that provide various mechanisms to resolve some of these problems. However, these works do not consider Device-to-Device Communication.…”

“…Unlike most of the existing GKM schemes, our solution balances the loads between the heterogeneous devices of the network according to their capabilities. To illustrate this difference, we consider the protocols MGKMP [26] and GREP [45]. The authors show that their calculation and storage costs are proportional to O( √ n) for all the network members, while they are both proportional to the nodes' storage capability, using our solution.…”

“…For these reasons, we only need to analyze the storage costs to compare the efficiency and scalability of our solution to those of the existing schemes. We then take as example a TmoteSky sensor node and compare the storage cost of our solution to different existent GKM (MGKMP [26] and GREP [45] ) and PKM (Pairwise Key scheme [17], Trades [41] and Kronecker [46]) schemes. We consider keys of 256 bits (using AES-256 for example).…”