By Topic

Minimum redundancy tree for key distribution in secure multicast

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

2 Author(s)
Siu-Ping Chan ; Dept. of Electr. & Electron. Eng., Hong Kong Univ. of Sci. & Technol., Kowloon, China ; Chi-Wah Kok

This paper proposes a "minimum redundancy tree" (MRT) for key distribution in secure multicast. The MRT is optimal in terms of minimum rekeying costs by keeping the minimum average number of keys to be updated for each member and maintaining minimum average tree height for each member. We also propose to combine MRT and subgrouping to generate multiple MRTs such that the rekeying costs can be further minimized when compared to that of other key management schemes.

Published in:

Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on

Date of Conference:

27 June-2 July 2004