JET: Dynamic join-sexit-tree amortization and scheduling for contributory key management
Document Type
Article
Date of Original Version
10-1-2006
Abstract
In secure group communications, the time cost associated with key updates in the events of member join and departure is an important aspect of quality of service, especially in large groups with highly dynamic membership. To achieve better time efficiency, we propose a join-exit-tree (JET) key management framework. First, a special key tree topology with join and exit subtrees is introduced to handle key updates for dynamic membership. Then, optimization techniques are employed to determine the capacities of join and exit subtrees for achieving the best time efficiency, and algorithms are designed to dynamically update the join and exit trees. We show that, on average, the asymptotic time cost for each member join/departure event is reduced to O(log (log n)) from the previous cost of O(log n), where n is the group size. Our experimental results based on simulated user activities as well as the real MBone data demonstrate that the proposed JET scheme can significantly improve the time efficiency, while maintaining low communication and computation cost, of tree-based contributory key management. © 2006 IEEE.
Publication Title, e.g., Journal
IEEE/ACM Transactions on Networking
Volume
14
Issue
5
Citation/Publisher Attribution
Mao, Yinian, Yan Sun, Min Wu, and K. J. Liu. "JET: Dynamic join-sexit-tree amortization and scheduling for contributory key management." IEEE/ACM Transactions on Networking 14, 5 (2006): 1128-1140. doi: 10.1109/TNET.2006.882851.