Optimal Tree Structure for Secure Group Communication Using LKH Approach
11 Pages Posted: 14 Jul 2020 Last revised: 20 Jul 2020
Date Written: June 1, 2020
Abstract
In secure Group communication for applications such as pay per view, teleconferencing, and video conferencing, key management method with logarithmic computation, storage time and bandwidth efficiency are expected. Major aspects with key management are initializing the group with a group key and rekeying the group. The server maintains a key tree. Rekeying is mandatory due to dynamic group nature (join/leave operations) or periodic rekeying. Logical Key Hierarchy has a logarithmic rekeying cost if the key tree is balanced, over multiple rekeying operations key tree is not balanced and LKH yields worst Rekeying cost. To achieve logarithmic cost either keep the key tree balanced or restructure the key tree in such a way that it will still result in the best rekeying cost. This paper explores tree structures using the Logical Key Hierarchy (LKH) approach to find an optimal tree structure for an application.
Keywords: Secure multicast, Rekeying, LKH, forward secrecy, backward secrecy, optimal tree structure, NSBHO tree, AVL tree, optimal level homogeneous tree
JEL Classification: C00,L15
Suggested Citation: Suggested Citation