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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
