By Topic

Combinatorial optimization of multicast key management

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Morales, L. ; Dept. of Comput. Sci. & Inf. Syst., Texas A&M Univ., Commerce, TX, USA ; Sudborough, I.H. ; ElToweissy, M. ; Heydari, M.H.

There are numerous applications that require secure group communication. Much recent attention has been focused on secure multicasting over the Internet. When such systems are required to manage large groups which undergo frequent fluctuations in group membership, the need for efficient encryption key management becomes critical. This paper presents a combinatorial formulation of the multicast key management problem that is applicable not only to the specific problem of multicast key management, but also 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, show exactly when they exist, and demonstrate that such systems represent improvements over the current binary tree-based key management systems and other related systems.

Published in:

System Sciences, 2003. Proceedings of the 36th Annual Hawaii International Conference on

Date of Conference:

6-9 Jan. 2003