An information theoretic approach to secure multicast key management

Author

Poovendran, R. ; Baras, J.S.

Author_Institution

Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA

fYear

1999

fDate

1999

Firstpage

36

Abstract

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

Keywords

cryptography; maximum entropy methods; multicast communication; source coding; telecommunication security; trees (mathematics); information theoretic approach; maximum entropy scenario; member revocation events; optimal source coding; rooted tree based secure multicast key revocation schemes; secure multicast key management; worst case scenario; Cryptography; Decoding; Educational institutions; Engineering management; Entropy; Multicast communication; Source coding; Statistical distributions;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory and Networking Workshop, 1999

Conference_Location

Metsovo

Print_ISBN

0-7803-5954-2

Type

conf

DOI

10.1109/ITNW.1999.814346

Filename

814346