Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Backward Secrecy

Chapter 7
Advances in Malware and Data-Driven Network Security
It is characteristic of a rekeying process in a group communication where after joining a group, a new group key is generated and given to users of a group and to new user in order to prevent the new member to read old messages.
Published in Chapter:
Scalable Rekeying Using Linked LKH Algorithm for Secure Multicast Communication
Priyanka Ahlawat (National Institute of Technology, Kurukshetra, India) and Kanishka Tyagi (National Institute of Technology, Kurukshetra, India)
Copyright: © 2022 |Pages: 15
DOI: 10.4018/978-1-7998-7789-9.ch007
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).
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR