Show simple item record

dc.contributor.authorRodeh, Ohaden_US
dc.contributor.authorBirman, Kennethen_US
dc.contributor.authorDolev, Dannyen_US
dc.description.abstractIn 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.en_US
dc.format.extent335249 bytes
dc.format.extent640687 bytes
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleUsing AVL Trees for Fault Tolerant Group Key Managementen_US
dc.typetechnical reporten_US

Files in this item


This item appears in the following Collection(s)

Show simple item record