By Topic

An information theoretic approach to secure 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

2 Author(s)
R. Poovendran ; Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA ; J. S. Baras

New results are presented for recently proposed rooted tree based secure multicast key revocation schemes by studying the information theoretic properties of member revocation events. It is shown that the optimal average number of keys per person is given by the entropy of the member revocation event and the currently available solutions correspond to the worst case or the maximum entropy scenario. It is shown that the previously proposed key assignment (Caronni et al., 1998) corresponds to optimal source coding and is susceptible to attack by compromise or collusion of multiple members

Published in:

Information Theory and Networking Workshop, 1999

Date of Conference: