@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 = {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}
}
@conference {
	title = {Hierarchical, Layered Modeling and Performance Evaluation of Hybrid Communication Networks},
	author = {Baras, John S., Corson, Scott M., Jang, Kap D., Liu, Mingyan., Misra, Archan., Xie, Hui.},
	year = {1997},
	month = {11/1997},
	abstract = {Commercial and military networks are rapidly becoming hybrid networks;~that is interconnected wireless terrestrial, wireline terrestrial and satellite networks. There is a great need for software tools to design, model and also do performance analysis efficiently for such large heterogeneous networks. This is the topic addressed in this paper. The hybrid network modeling and performance evaluation tool is currently under development at the University of Maryland. The tool consists of an algorithmic structure and a software architecture. The algorithm is hierarchical in form, deriving its structure from that of the network which follows the network{\textquoteright}s routing hierarchy. At each level, a node represents a set of nodes at a lower level. The boundary of a node is characterized by a set of statistical models. The statistics and their parametric representations for the models of the level 1 nodes are obtained from the OPNET simulations which are run offline. The model defines procedures that convey modeling, simulation and performance data up and down the hierarchy of models. We consider the following performance metrics only: end-to-end delay, throughput, blocking probabilities, cell or packet loss rate. We describe algorithms based on loss network approximations and fast progressive solutions of resulting fixed point equations.},
	address = {Monterey, CA},
	booktitle = {MILCOM \&rsquo;97},
	pages = {1-5}
}
@conference {
	title = {Fast Asymmetric Internet Over Wireless Satellite-Terrestrial Networks},
	author = {Baras, John S., Corson, Scott M., Papademetriou, Spyro., Secka, Isatou., Suphasindhu, Narin.},
	year = {1997},
	month = {11/1997},
	abstract = {We describe our recent work on the design and implementation of high perfomrnace Internet services over networks consisting of interconnected Direct Broadcast (Satellite) hosts and terrestrial wireless LANs with various capabilities. The network uses receive only satellite links for downstream data delivery and wireless and wireline terrestrial links for the upstream path. A key concept in our work is that of a hybrid terminal which is a PC connected to a DBS antenna and to the local wireless LAN. The hybrid terminal uses a modem connection for outgoing traffic while receiving incoming information through the VSAT.},
	address = {Monterey, CA},
	booktitle = {MILCOM \&rsquo;97},
	pages = {372-377}
}
@conference {
	title = {Tactical and Strategic Communication Network Simulation and Performance Analysis},
	author = {Baras, John S., Corson, Scott M., Doan, Khoa., Jang, Kap D., Liu, Mingyan., Misra, Archan., Xie, Hui.},
	year = {1997},
	month = {01/1997},
	abstract = {We describe a framework for the efficient modeling and performance evaluation of large networks consisting of a mixture of strategic and tactical components. The method emphasizes hierarchical, layered techniques that are fed parametric models at the lower level. In addition to the algorithmic structure, and some initial algorithms we describe an object-oriented software architecture that is under development to support these algorithmic methods in a distributed environment.},
	address = {College Park, MD},
	booktitle = {First ATIRP Annual Conference: Advanced Telecommunications/Information Distribution Research Program},
	pages = {pp. 343-347},
	organization = {University of Maryland}
}
