This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Balanced Key Tree Management for Secure Multicast Communications
May 2007 (vol. 56 no. 5)
pp. 590-605
A secure multicast communication is important for applications such as pay-per-view and secure videoconferencing. A key tree approach has been proposed by other authors to distribute the multicast group key in such a way that the rekeying cost scales with the logarithm of the group size for a join or depart request. The efficiency of this key tree approach critically depends on whether the key tree remains balanced over time as members join or depart. In this paper, we present two Merging Algorithms suitable for batch join requests. To additionally handle batch depart requests, we extend these two algorithms to a Batch Balanced Algorithm. Simulation results show that our three algorithms not only maintain a balanced key tree, but their rekeying costs are lower compared with those of existing algorithms.
Index Terms:
Multicast security, group key management, secure group communication.
Citation:
Wee Hock Desmond Ng, Michael Howarth, Zhili Sun, Haitham Cruickshank, "Dynamic Balanced Key Tree Management for Secure Multicast Communications," IEEE Transactions on Computers, vol. 56, no. 5, pp. 590-605, May 2007, doi:10.1109/TC.2007.1022
Usage of this product signifies your acceptance of the Terms of Use.