@conference {
	title = {An Information Theoretic Analysis of Rooted Tree Based Multicast Key Distribution Schemes},
	author = {Poovendran, Radha., Baras, John S.},
	year = {1999},
	month = {08/1999},
	abstract = {Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18 ,19,20,21] .In this paper we show that by assigning Probabilities for member revocations,the optimality correctness and the system requirements of some these schemes [18,19,20,21 ] can be systematically studied using information theoretic concepts. 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. Using our derivation we show that (a) the key assignments in [18, 21, 20, 19] corresponds to the maximum entropy solution, (b) and direct application of source coding will lead to member collusion (we present recently proposed solutions [21, 20] 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.},
	address = {Santa Barbara, CA},
	booktitle = {Crypto\&rsquo;99: 19th Annual IACR Crypto Conference},
	pages = {pp.624-638}
}
