Key trees and the security of interval multicast

Mohamed G. Gouda; Chin Tser Huang; E. N. Elnozahy

Key trees and the security of interval multicast

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

^*Corresponding author for this work

Research output: Contribution to conference › Paper › peer-review

22 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 language	English (US)
Pages	467-468
Number of pages	2
State	Published - 2002
Externally published	Yes
Event	22nd International Conference on Distributed Systems - Vienna, Austria Duration: Jul 2 2002 → Jul 5 2002

Other

Other	22nd International Conference on Distributed Systems
Country/Territory	Austria
City	Vienna
Period	07/2/02 → 07/5/02

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Cite this

@conference{de5ec2ad51f54d6b914d330e2891c0d2,

title = "Key trees and the security of interval multicast",

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.",

author = "Gouda, {Mohamed G.} and Huang, {Chin Tser} and Elnozahy, {E. N.}",

year = "2002",

language = "English (US)",

pages = "467--468",

note = "22nd International Conference on Distributed Systems ; Conference date: 02-07-2002 Through 05-07-2002",

}

TY - CONF

T1 - Key trees and the security of interval multicast

AU - Gouda, Mohamed G.

AU - Huang, Chin Tser

AU - Elnozahy, E. N.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036375297&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0036375297

SP - 467

EP - 468

T2 - 22nd International Conference on Distributed Systems

Y2 - 2 July 2002 through 5 July 2002

ER -

Key trees and the security of interval multicast

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this