Show simple item record

dc.contributor.advisorBaras, John S.en_US
dc.contributor.authorR. Poovendranen_US
dc.contributor.authorBaras, John S.en_US
dc.date.accessioned2007-05-23T10:08:14Z
dc.date.available2007-05-23T10:08:14Z
dc.date.issued1999en_US
dc.identifier.urihttp://hdl.handle.net/1903/6075
dc.description.abstractRecent literature presents several rooted tree based member deletion/ revocation schemes trying to simultaneously minimize the key storage while providing efficient member deletion/revocation. Many of these approaches have different solutions and provide different values for the number of keys to be stored and distributed. <p>In this paper, we show that many of these papers can be systematically studied using basic concepts from information theory. In particular, we show that the entropy of member revocation event plays a major role in defining the key allocation requirements. <p>We then relate the entropy of member revocation event to provide bounds on the key length. We also show that the optimal Huffman coding strategy used leads to security weakness. A method for generating key management schemes with varying degrees of member collusion is also presented in this paper.<p><i>Journal of IEEE Transaction on Information Theory</i>en_US
dc.format.extent1487002 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1999-36en_US
dc.relation.ispartofseriesCSHCN; TR 1999-18en_US
dc.subjectSecure multicasten_US
dc.subjectcover free key distributionen_US
dc.subjectuser collusionen_US
dc.subjectGlobal Communication Systemsen_US
dc.titleAn Information Theoretic Approach for Design and Analysis of Rooted-Tree Based Multicast Key Management Schemesen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record