Study on Probabilistic Organization of Key Tree in Batch Group Rekeying
Wei Zhang · Computer Technology and Development · 2007
Scalable group rekeying is one of the biggest challenges that need to be addressed to support secure communications for large and dynamic groups.Currently,the most efficient techniques for multicast key management are based on the logical key hierarchy(LKH) scheme and LKH trees are always organized as balanced binary trees.Based on batch group rekeying and group member's behavior,propose a new method:probabilistic organization of the key tree, combining star structure and tree structure.The method classifies the members based on their changing probability and each class corresponds to an optimal tree,so it further decreases the rekeying overhead.The method can solve much better the problemof group rekeying with heterogeneous group members.Simulation results show that the method is more generalizing than others.