Show simple item record

An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes

dc.contributor.advisorBaras, John S.en_US
dc.contributor.authorPoovendran, R.en_US
dc.contributor.authorBaras, John S.en_US
dc.date.accessioned2007-05-23T10:08:15Z
dc.date.available2007-05-23T10:08:15Z
dc.date.issued1999en_US
dc.identifier.urihttp://hdl.handle.net/1903/6076
dc.description.abstractSeveral variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications. <p>In this paper, we show that by assigning probabilities for member revocations, the optimality, correctness, and the system requirements of some of these schemes can be systematically studied using information theoretic concepts.<p> Specifically, we show that the optimal average number of keys per member in a rooted tree is related to the entropy of the member revocation event.<p>Using our derivations, we show that (a) the key assignments in correspond to the maximum entropy solution, (b) and direct application of source coding will lead to member collusion (we present recently proposed solutions as examples of this) and a general criteria that admits member collusion. We also show the relationship between entropy of member revocation event and key length.<p><i>Crypto '99 :: 19th Annual IACR Crypto Conference</i>en_US
dc.format.extent648047 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1999-37en_US
dc.relation.ispartofseriesCSHCN; TR 1999-19en_US
dc.subjectcodingen_US
dc.subjectsecure multicasten_US
dc.subjectkey managementen_US
dc.subjectkey lengthen_US
dc.subjectGlobal Communication Systemsen_US
dc.titleAn Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution 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