Using AVL trees for fault-tolerant group key management

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 log2 n. 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.

• Type: Journal
• Year: 2002
• Where: IJISEC
• Authors: Ohad Rodeh, Kenneth P. Birman, Danny Dolev
• Keywords: Efficient Algorithm, Group Communication Systems, IJISEC 2002, Large Ip-multicast Groups