Show simple item record

On a Recent Problem of Communication-Storage Tradeoffs for Secure Multicast for Large Networks

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:35Z
dc.date.available2007-05-23T10:08:35Z
dc.date.issued1999en_US
dc.identifier.urihttp://hdl.handle.net/1903/6094
dc.description.abstractA variety of rooted tree-based secure multicast networks with different efficiencies and storage requirements that are linear in group size have been proposed. <p>Recently, Canetti et. al. presented a scheme based on clustering that had sub-linear storage requirements at the group controller. However, they were unable to prove or disprove that the scheme was optimal, and posed it as an open question. <p>In this paper we answer the question with affirmative NO! Additionally we use our results to show that the optimal clustering in this context is related to maximum entropy of member revocation event, and corresponding optimal strategy is to partition members such that each cluster has the same probability of being revoked.<p><i>Second Workshop on Security in Communication Networks</i>en_US
dc.format.extent710394 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1999-78en_US
dc.relation.ispartofseriesCSHCN; TR 1999-37en_US
dc.subjectkey storage,en_US
dc.titleOn a Recent Problem of Communication-Storage Tradeoffs for Secure Multicast for Large Networksen_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