Secure Group Communication Using Robust Contributory Key Agreement
IEEE Transactions on Parallel and Distributed Systems
Chinese remainder theorem based group key management
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
A benchmarking environment for performance evaluation of tree-based rekeying algorithms
Journal of Systems and Software
An efficient key tree management algorithm for LKH group key management
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
| Hi-index | 0.00 |
In this paper we describe an efficient algorithm for the management of group-keys for Group Communication Systems. Our algorithm is based on the notion of key-graphs, previously used for managing keys in large IP-multicast groups. The standard protocol requires a centralized key-server that has knowledge of the full key-graph. Our protocol does not delegate this role to any one process. Rather, members enlist in a collaborative effort to create the group key-graph. The key-graph contains n keys, of which each member learns log_2n. We show how to balance the key-graph, a result that is applicable to the centralized protocol. We also show how to optimize our distributed protocol and provide a performance study of its capabilities.