Optimization of Message Cost for Tree Based Secure Group Communication Using LKH Approach

Abstract

Many newWeb and Internet applications use a group communication model, newlinein which packets are sent from one or more sources to a group of destinations. newlinePackets are distributed to a group of users using multicast. Multicast packets newlinemust be transmitted safely to avoid eavesdropping and to protect the content newlineof multicast traffic. Multicast groups are dynamic in nature, meaning newlinethat new members can join at any time and current members can leave at newlineany time. As a result, the provision for confidentiality covers both backward newlineand forward secrecy. Backward confidentiality guarantees that newly added newlinemembers are unable to access previous Multicast messages. Forward secrecy newlineensures that any current or potential multicast messages cannot be decoded newlineby an old member who has quit the group. newlineThe use of a group key to encrypt group communication is an easy solution newlinefor achieving secure multicast. The group key must be updated when a new newlinemember joins the group or a current member leaves. The server keeps track newlineof current group members in a tree. A new group key is created and distributed newlineto all group members during the rekeying process. Rekeying costs newlineare high due to regular join/leave operations. To achieve logarithmic rekeying newlinecosts, the hierarchical key-tree approach is commonly used. The main newlinetree must be balanced to achieve logarithmic rekeying cost. newlineKey management methods with logarithmic computation, storage and bandwidth newlineefficiency, are required in secured Group communication. Pay-perview, newlineteleconferencing, and video conferencing are examples of group networking newlineapplications. The establishment of a group key with the current newlinegroup members and updating the group key with any change in group members newlineare two major aspects of key management. Due to frequent join/leave newlineoperations or periodic interval rekeying, rekeying is necessary. The cost of newlinerekeying in the Logical Key Hierarchy is logarithmic. This study examines newlineLogical Key Hierarchy in detail. LKH and it s variants with centralised and newlinedecentralised approach are studied