Scalable Rekeying Using Linked LKH Algorithm for Secure Multicast Communication

View Sample PDF

Author(s): Priyanka Ahlawat (National Institute of Technology, Kurukshetra, India)and Kanishka Tyagi (National Institute of Technology, Kurukshetra, India)
Copyright: 2022
Pages: 15
Source title: Advances in Malware and Data-Driven Network Security
Source Author(s)/Editor(s): Brij B. Gupta (National Institute of Technology, Kurukshetra, India)
DOI: 10.4018/978-1-7998-7789-9.ch007

Keywords: Cyber and Network Security / Information Science Reference / Information Security & Privacy / Security & Forensics

Purchase

View Scalable Rekeying Using Linked LKH Algorithm for Secure Multicast Communication on the publisher's website for pricing and purchasing information.

Abstract

In the real scenario, there is a large multicast group where nodes leave and join frequently, and also the number of nodes leaving and joining is also not proportionate. Hence, scalable rekeying process is an important issue that needs to be concerned for the secured group communication for dynamic groups. In basic rekeying scheme, which is based on the logical key hierarchy, the rekeying cost depends on the logarithm of the size of group for a join or depart request by the user. However, the memory efficiency of this group rekeying protocol (GREP) is a huge storage overhead over the system. The authors aim to provide a survey of various group key management schemes and then propose an efficient scalable solution based on linked LKH and the linked list data structure. Results have shown that the Linked LKH algorithm has a very low effective cost for rekeying the LKH as compared to the basic LKH algorithm (i.e., based on the number of new joined and departure requests).

The IRMA Community

Research IRM

Scalable Rekeying Using Linked LKH Algorithm for Secure Multicast Communication

Purchase

Abstract

Related Content

IRMA Sponsors