Combinatorial optimization of group key management

被引：87

作者：

Eltoweissy M. ^{[1
]}

Heydari M.H. ^{[2
]}

Morales L. ^{[3
]}

Sudborough I.H. ^{[4
]}

机构：

[1] Dept. of Computer Science, Virginia Tech., Falls Church

[2] Dept. of Computer Science, James Madison University, Harrisonburg

[3] Dept. of Computer Science, Texas A and M University, Commerce

[4] Dept. of Computer Science, University of Texas, Dallas

来源：

Journal of Network and Systems Management | 2004年 / 12卷 / 1期

关键词：

Backward secrecy; Group communications; Key distribution; Multicast; Re-keying; Secure communications; Security;

D O I：

10.1023/B:JONS.0000015697.38671.ec

中图分类号：

学科分类号：

摘要：

Given the growing number of group applications in many existing and evolving domains recent attention has been focused on secure multicasting over the Internet. When such systems are required to manage large groups that undergo frequent fluctuations in group membership, the need for efficient encryption key management becomes critical. This paper presents a new key management framework based on a combinatorial formulation of the group multicast key management problem that is applicable to the general problem of managing keys for any type of trusted group communication, regardless of the underlying transmission method between group participants. Specifically, we describe Exclusion Basis Systems and show exactly when they exist. In addition, the framework separates key management from encrypted message transmission, resulting in a more efficient implementation of key management.

引用

页码：33 / 50

页数：17