Algorithms for dynamic multicast key distribution
Journal of Experimental Algorithmics (JEA)
Minimizing Eavesdropping Risk by Transmission Power Control in Multihop Wireless Networks
IEEE Transactions on Computers
Energy and bandwidth-efficient key distribution in wireless ad hoc networks: a cross-layer approach
IEEE/ACM Transactions on Networking (TON)
Approximation Algorithms for Key Management in Secure Multicast
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Pay per view – a multimedia multicast application with effective key management
International Journal of Mobile Network Design and Innovation
An optimal key distribution scheme for secure multicast group communication
INFOCOM'10 Proceedings of the 29th conference on Information communications
Keeping group communications private: An up-to-date review on centralized secure multicast
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Quantifying information leakage in tree-based hash protocols (short paper)
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Cryptanalysis of two group key management protocols for secure multicast
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
N-ary tree based key distribution in a network as a service provisioning model
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
| Hi-index | 754.84 |
Previous literature presents several seemingly different approaches to rooted-tree-based multicast key distribution schemes that try to minimize the user key storage while providing efficient member deletion. In this paper, we show that the user key storage on rooted trees can be systematically studied using basic concepts from information theory. We show that the rooted-tree-based multicast key distribution problem can be posed as an optimization problem that is abstractly identical to the optimal codeword length selection problem in information theory. In particular, we show that the entropy of member deletion statistics quantifies the optimal value of the average number of keys to be assigned to a member. We relate the sustainable key length to statistics of member deletion event and the hardware bit generation rate. We then demonstrate the difference between the key distribution on rooted trees and the optimal codeword length selection problem with an example of a key distribution scheme that attains optimality but fails to prevent user collusion