@conference {
	title = {An Information-Theoretic Approach for Design and Analysis of Rooted-Tree-Based Multicast Key Management Schemes},
	author = {Poovendran, Radha., Baras, John S.},
	year = {2001},
	month = {11/2001},
	booktitle = {IEEE Transactions on Information Theory},
	pages = {pp.2824-2834}
}
@conference {
	title = {A decision-process analysis of implicit coscheduling},
	author = {Poovendran, Radha., Keleher, P. , Baras, John S.},
	year = {2000},
	month = {05/2000},
	abstract = {This paper presents a theoretical framework based on Bayesian decision theory for analyzing recently reported results on implicit coscheduling of parallel applications on clusters of workstations. Using probabilistic modeling, we show that the approach presented can be applied for processes with arbitrary communication mixes. We also note that our approach can be used for deciding the additional spin times in the case of spin-yield. Finally, we present arguments for the use of a different notion of fairness than assumed by prior work.},
	address = {Cancun, Mexico},
	booktitle = {International Parallel and Distributed Processing Symposium, IPDPS}
}
@conference {
	title = {Analysis and Design of Robust Key Schemes for Multicast Communications},
	author = {Poovendran, Radha., Baras, John S.},
	year = {2000},
	month = {03/2000},
	abstract = {Recent literature presents several rooted tree based member deletion/revocation schemes [5,6,7,8,1,2] 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.In this paper we show these problems can be systematically studied using basic concepts from information theory.},
	booktitle = {ATIRP 4th Annual Conference},
	organization = {University of Maryland}
}
@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}
}
@conference {
	title = {A Distributed Shared Key Generation Procedure Using Fractional Keys},
	author = {Poovendran, Radha., Corson, Scott M., Baras, John S.},
	year = {1998},
	month = {10/1998},
	abstract = {We present a new class of distributed key generation and recovery algorithms suitable for group communication systems where the group membership is either static or slowly time-varying, and must be tightly controlled. The proposed key generation approach allows entities which may have only partial trust in each other to jointly generate a shared key without the aid of an external third party. The group collectively generates and maintains a dynamic group parameter, and the shared key is generated using a pseudo random function using this parameter as a seed. The validity of key generation can be checked using veriable secret sharing techniques. The key retrieval method does not require the keys to be stored in an external retrieval center. We note that many Internet-based applications may have these requirements. Fulllment of these requirements is realized through the use of fractional keys-a distributed technique recently developed to enhance the security of distributed systems in a non-cryptographic manner.},
	address = {Bedford, MA},
	booktitle = {MILCOM\&rsquo;98},
	pages = {pp. 1-6}
}
@conference {
	title = {A Scalable Extension of Group Key Management Protocol},
	author = {Poovendran, Radha., Ahmed, S., Corson, Scott M., Baras, John S.},
	year = {1998},
	month = {02/1998},
	abstract = {This paper presents a robust, scalable extension to the recently proposed multicast Group Key Management Protocol (GKMP) ([1], [2]), in terms of security administration. The GKMP has two major security related problems: (a) lack of any mechanism to remove a compromised group administrator, and (b) lack of scalability. We are able to remove a compromised single panel member from generating the group keys by setting the panel members with shared authority to generate the group keys. We then introduce the sub-controllers who have all the functionalities of the group control panel except the authority to generate the group keys. The sub-control panel helps scalability of the network in terms of the security operations. The sub-controllers are chosen using a threshold-based clustering algorithm.},
	address = {College Park, Maryland},
	booktitle = {ARL Federated Laboratory 2nd Annual Conference},
	pages = {pp. 187-191},
	organization = {University of Maryland}
}
@article {
	title = {An Information Theoretic Approach for Design and Analysis of Rooted-Tree Based Multicast Key Management Schemes},
	author = {Poovendran, Radha., Baras, John S.},
	year = {2001},
	month = {11/2001},
	abstract = {Recent literature presents several seemingly different approaches to rooted-tree-based multicast key distribution schemes [6]{\textendash}[8], [28], [29] that try to minimize the user key storage while providing efficient member deletion. In this paper, we show that the user key storage on rooted trees can be systematically studied using basic concepts from information theory. We show that the rooted-tree-based multicast key distribution problem can be posed as an optimization problem that is abstractly identical to the optimal codeword length selection problem in information theory. In particular, we show that the entropy of member deletion statistics quantifies the optimal value of the average number of keys to be assigned to a member. We relate the sustainable key length to statistics of member deletion event and the hardware bit generation rate. We then demonstrate the difference between the key distribution on rooted trees and the optimal codeword length selection problem with an example of a key distribution scheme that attains optimality but fails to prevent user collusion [7], [8]},
	pages = {pp. 2824-2834},
	volume = {Vol. 47},
	number = {No. 7},
	journal = {IEEE Transactions on Information Theory}
}
@techreport {
	title = {A Decision-Process Analysis of Implicit Coscheduling},
	author = {Poovendran, Radha., Keleher, P. },
	year = {2000},
	month = {01/2000},
	abstract = {This paper presents a theoretical framework based on Bayesian decision theory for analyzing recently reported results on implicit coscheduling of parallel applications on clusters of workstations. Using probabilistic modeling, we show that the approach presented can be applied for processes with arbitrary communication mixes. We also note that our approach can be used for deciding the additional spin times in the case of spin-yield.Finally, we present arguments for the use of a different notion of fairness than assumed by prior work.},
	number = {Number: CSHCN TR 2000-12}
}
