Skip to main content
Log in

Using AVL trees for fault-tolerant group key management

  • Regular contribution
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract.

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 Internet-protocol 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 log2n of them. 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Published online: 26 October 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rodeh, O., Birman, K. & Dolev, D. Using AVL trees for fault-tolerant group key management. IJIS 1, 84–99 (2002). https://doi.org/10.1007/s102070100008

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s102070100008

Navigation