Key trees and the security of interval multicast

被引：9

作者：

Gouda, MG ^{[1
]}

Huang, CT ^{[1
]}

Elnozahy, EN ^{[1
]}

机构：

[1] Univ Texas, Dept Comp Sci, Austin, TX 78712 USA

来源：

22ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS | 2002年

关键词：

D O I：

10.1109/ICDCS.2002.1022293

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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 an), user in the group can use the different keys in the key, tree to securely multicasting data to different subgroups within the group. The cost of securely multicasting data to a subgroup whose users are "consecutive" is O(Iog 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.

引用

页码：467 / 468

页数：2