A New Rekeying Scheme for Multicast Based on LKH Tree
YU Mei-sheng
Abstract
YU Mei-sheng
Abstract
Secure multicast is a key issue to be solved that multicast technology can be widely deployed.When group members join or leave dynamically,the main research for secure multicast is how to design an efficient key management scheme.This paper proposes a rekeying scheme for multicast based on LKH tree.This protocol is based on a hierarchy approach in which the group is logically divided into subgroups,the exponential function and the random keys are also used to update the group key when a member leaves.Comparing with the traditional hierarchical key-tree,theory analysis shows that the solution efficiently decreases the communication cost of rekeying and the storage of group controller.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Secure multicast is a key issue to be solved that multicast technology can be widely deployed.When group members join or leave dynamically,the main research for secure multicast is how to design an efficient key management scheme.This paper proposes a rekeying scheme for multicast based on LKH tree.This protocol is based on a hierarchy approach in which the group is logically divided into subgroups,the exponential function and the random keys are also used to update the group key when a member leaves.Comparing with the traditional hierarchical key-tree,theory analysis shows that the solution efficiently decreases the communication cost of rekeying and the storage of group controller.
Key concepts: Rekeying, Multicast, Computer science, Secure multicast, Computer network, Xcast, Source-specific multicast, Distributed computing