Dynamic Balanced Key Tree Management for Secure Multicast Communications
IEEE Transactions on Computers
Group key management in wireless mesh networks
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
Enabling secure multicast using a new java LKH rekeying tool
ICWE'03 Proceedings of the 2003 international conference on Web engineering
DAKS: an efficient batch rekeying scheme for departure-aware multicast services
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A benchmarking environment for performance evaluation of tree-based rekeying algorithms
Journal of Systems and Software
Non-split balancing higher order tree for multi-privileged groups
WSEAS TRANSACTIONS on COMMUNICATIONS
Balanced key tree management for multi-privileged groups using (N, T) policy
Security and Communication Networks
| Hi-index | 0.00 |
Perfect Secrecy can only be achieved in multicastgroups by ciphering data sent to the group with adifferent key every time a member joins or leaves thegroup. A Key Server must send the new key to all theremaining members so bandwidth efficiency concernsappear. Logical Key Tree algorithms reduce the numberof messages to be sent, but in many scenarios, rekeyingafter each membership change has no sense. Batchrekeying algorithms are proposed as a solution to theseproblems. However such methods need to maintain theLogical Key Tree balanced all the time in order toachieve maximum bandwidth efficiency. This paperpresents a new technique for multicast batch rekeying.This technique reallocates the tree nodes in order to keepthe tree balanced all the time.