Key trees and the security of interval multicast

Mohamed G. Gouda*, Chin Tser Huang, E. N. Elnozahy

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

19 Scopus citations

Abstract

A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys in the key tree to securely multicast data to different subgroups within the group. The cost of securely multicasting data to a subgroup whose users are "consecutive" is O(log n) encryptions, where n is the total number of users in the group. The cost of securely multicasting data to an arbitrary subgroup is O(n/2) encryptions. However, this cost can be reduced to one encryption by introducing an additional key tree to the group.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Distributed Computing Systems
Pages467-468
Number of pages2
StatePublished - 2002
Externally publishedYes
Event22nd International Conference on Distributed Systems - Vienna, Austria
Duration: Jul 2 2002Jul 5 2002

Other

Other22nd International Conference on Distributed Systems
CountryAustria
CityVienna
Period07/2/0207/5/02

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Key trees and the security of interval multicast'. Together they form a unique fingerprint.

Cite this