@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}
}
@conference {
	title = {An Information Theoretic approach to Secure Multicast Key Management},
	author = {Poovendran, Radha., Baras, John S.},
	year = {1999},
	month = {06/1999},
	abstract = {New results are presented for recently proposed rooted tree based secure multicast key revocation scheme [1,2] 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 solution correspond to the worst case or the maximum entropy scenario. It is shown that the proposed key assignment in [2] corresponds to optimal source coding and is susceptible to attack by compromise or collusion of multiple members.},
	address = {Metsovo, Greece},
	booktitle = {1999 IEEE International Symposium on Information Theory},
	pages = {pp.36}
}
@conference {
	title = {A Private Scheme for distributed ,Shared Secret Generation},
	author = {Poovendran, Radha., Corson, Scott M., Baras, John S.},
	year = {1999},
	month = {06/1999},
	abstract = {We present a scheme for shared secret generations by n members that combines the contributions the members in a fashion such that the individual contribution of each member is not exposed to anyone- including other members. We note that for an external attacker trying to break the n L-bit secrets of the members, the effective search space dimension is~nL, meaning that all n keys must be broken simultaneously in order to crack system integrity. We also note that the scheme provides "Unconditional Secrecy"[1].},
	address = {Kruger National Park, South Africa},
	booktitle = {1999 IEEE Information Theory and Communications Workshop},
	pages = {pp.8}
}
@conference {
	title = {Optimal Scaleable Security Architectures in the presence of Colluding Mobile Traitors},
	author = {Poovendran, Radha., Baras, John S.},
	year = {1999},
	month = {04/1999},
	abstract = {We present the issues related to secure multicast communication,in the presence of members who may collaborate to compromise the integrity of the system{\textquoteright}s security. We also show that the ability to compartmentalize the system compromise depends on the availability of trusted intermediate nodes.We also note that some variations of the recently proposed tree based schemes don{\textquoteright}t provide the required level of security and may be compromised if two appropriate members are compromised. We present the analysis of the weakness of these schemes here. We further note that the currently available tree based key distribution schemes are not optimal, and choose the worst case solution for key assignment. We note that the claims, including the collusion, can be formally proved using basic concepts from source coding theory and entropy as in [4].},
	address = {Richardson, Texas},
	booktitle = {1999 Emerging Technologies Symposium on Wireless Communications and Wireless systems},
	pages = {pp.1-5}
}
@conference {
	title = {Dynamic Elgamal Public Key Generation with Tight Binding},
	author = {Poovendran, Radha., Corson, Scott M., Baras, John S.},
	year = {1999},
	month = {02/1999},
	abstract = {We present a new distributed ,group ElGamal public key generation algorithm which also permits maintenance of a group specific, dynamic,individual ElGamal public key infrastructure. We parameterize the group with a time varying quantity that serves as a distributed mechansim for controlling key generation privilege. Our scheme can be viewed as an alternative to polynomial schemes where, at the time of secret construction step,there has to be a thrid party or black box to combine the shares. Also, in polynomial schemes, at the time of combining, the individual shares of the secret have to be revealed the third party. In our scheme, the common secret can be generated without ever exposing the individual shares constructing it. We note that many of the ~proposed distributed key management [2-4] schemes need such group keys for certification and signing process.},
	booktitle = {3rd Annual Conference on Advanced Telecommunications and Information Distribution Research Program(ATIRP)},
	pages = {pp. 471-475}
}
