Abstract
Secure group key distribution is essential for many group-oriented applications such as sensor networks, multimedia broadcast services, and Internet of Things (IoT) scenarios. There are several challenges and requirements in designing secure group key distribution. Among them, computational efficiency, communication efficiency, adaptability to dynamic group membership change, robustness to various security threats, self-healing capacities, and source authentication are desirable. It is very challenging to design an efficient group distribution that satisfies all the requirements and challenges. Based on block codes, we propose an efficient self-healing group key distribution that facilitates both message source authentication and secure group key distribution, where the source identification and authentication can facilitate intrusion detection and identification. Both the privacy of the group key and the authentication of message sources are computationally secure. To the best of our knowledge, it is the first codes-based scheme that satisfies all the above requirements and facilitates message source authentication. The merits of the proposed scheme include the following: (1) it is highly efficient in terms of computation and communication, (2) it provides self-healing capacities for unstable environments, (3) it is very robust to various security threats and attacks, (4) it facilitates both message source authentication and secure group key distribution, and (5) it greatly improves the communication performance, compared to the state-of-the-art schemes. The security properties are analyzed, and the performance evaluations confirm its efficiency and practicality.
Highlights
Various group-oriented services such as audio/video broadcasting, conferencing, collective working, Internet-ofings (IoT) scenarios, military operations, and rescue missions have been popular, and many new group-oriented services such as location-based social services are booming
Is paper, based on block codes [9], proposes a new self-healing group key distribution scheme with the source authentication function. e merits of the scheme include the following: (1) it exhibits excellent performance in terms of computation and communication, (2) it supports dynamic membership, (3) it provides self-healing capacities to cope with unreliable connections, (4) it facilitates both group key distribution as well as source message authentication, and (5) it greatly improves communication performance, compared to the state-of-the-art schemes. e rest of this paper is organized as follows
Vijayakumar et al [30] proposed a Chinese Remainder eory-based distributed group key management scheme which supports the dynamic membership change for the unstructured peer-to-peer networks; the scheme reduces the computational complexity in each user side by slightly increasing the storage space of the peer users. e authors in [31] proposed a new Greatest Common Divisor-based key distribution protocol which aims at reducing the computational complexity and the amount of information stored in the Group Center and the group members; the self-healing function and the message source authentication function were not considered in the requirements
Summary
Various group-oriented services such as audio/video broadcasting, conferencing, collective working, Internet-ofings (IoT) scenarios, military operations, and rescue missions have been popular, and many new group-oriented services such as location-based social services are booming. For those services with dynamic membership, easy and efficient updating of the group keys for each session is necessary In those scenarios with dynamic membership and unreliable connections, the function of self-healing allows the authorized entities to recover the previous group keys when they reconnect the networks later. Is paper, based on block codes [9], proposes a new self-healing group key distribution scheme with the source authentication function. E merits of the scheme include the following: (1) it exhibits excellent performance in terms of computation and communication, (2) it supports dynamic membership, (3) it provides self-healing capacities to cope with unreliable connections, (4) it facilitates both group key distribution as well as source message authentication, and (5) it greatly improves communication performance, compared to the state-of-the-art schemes.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
