@conference {
	title = {"Privacy Preserving Node Selection: A Physical Layer Approach (Summary)},
	author = {Jain, Shalabh., Baras, John S.},
	year = {2015},
	month = {03/2015},
	abstract = {Distributed monitoring and sensing networks are~ubiquitous in current technological systems. Security and efficiency~of the data aggregation and fusion process are key~determinants in the adoption of these systems. The principal~thesis investigated in this paper is the role of privacy in providing security guarantees for such networks. We demonstrate that two level~hierarchy (or partition) in information fusion networks~can be used to ensure security in several adversarial scenarios.~We propose a privacy preserving physical layer framework to~generate such a hierarchical structure. We illustrate the security~of this framework and its application to low power sensor~networks.},
	address = {Baltimore, MD},
	booktitle = {49th Annual Conference on Information Sciences and Systems},
	pages = {pp. 1-6}
}
@conference {
	title = {Physical Layer Methods for Privacy Provision in Distributed Control and Inference},
	author = {Jain, Shalabh., Ta, Tuan., Baras, John S.},
	year = {2014},
	month = {12/2014},
	abstract = {Distributed control, decision and inference schemes are ubiquitous in many current technological systems ranging from sensor networks, collaborative teams of humans and robots, and information retrieval systems. Privacy, both location and identity, is critical for many of these systems and applications. The principal thesis investigated in this paper is that the utilization of physical layer methods and implementation techniques substantially strengthens privacy in the associated algorithms and systems. In fact it is argued that without the utilization of such physical layer methods it may be expensive to have provable levels of security in these systems. We analyze the performance of such physical layer techniques. We then utilize these techniques to provide provable privacy in distributed control, decision and inference algorithms. We demonstrate the results in context of distributed Kalman filtering. We develop useful metrics to measure privacy in these distributed systems. We investigate quantitatively the effects of privacy loss on the performance of the systems.},
	address = {Los Angeles, California},
	booktitle = {53rd IEEE Conference on Decision and Control},
	pages = {pp. 1383-1388}
}
@conference {
	title = {Distributed Trust Based Routing in Mobile Ad-Hoc Networks},
	author = {Jain, Shalabh., Baras, John S.},
	year = {2013},
	month = {11/2013},
	abstract = {Establishing trust and security in ad-hoc networkshas been a long studied problem. Several methods have beenproposed for evaluation and dissemination of trust in suchnetworks, with the goal of providing secure data paths. Wepropose a mechanism to utilize trust metrics derived from variousmethods for secure routing. Our scheme can be used in withexiting on-demand routing protocols with minimal modification.We highlight scenarios that establish the need for associating trustwith a link, rather than just a node. Our scheme incorporatesboth link and node trust to avoid adversarial paths in adistributed manner. We validate via simulation, the securityproperties of our scheme in an ad-hoc network.},
	address = {San Diego, California},
	booktitle = {2013 Military Communications Conference (MILCOM 2013)},
	pages = {pp. 1801-1807}
}
@conference {
	title = {Wormhole Detection Using Channel Characteristics},
	author = {Jain, Shalabh., Ta, Tuan., Baras, John S.},
	year = {2012},
	month = {06/2012},
	abstract = {The potential applications and pervasive nature of mobile ad-hoc networks (MANETs) has made them an attractive target for attackers. The wireless medium of communication coupled with constrained resources enable attacks which can be executed by a weak adversary. A wormhole is one such attack which poses considerable threat, particularly to routing protocols. In this paper, we devise a novel scheme for detecting a wormhole by utilizing the inherent symmetry of electromagnetic wave propagation in the wireless medium. We demonstrate the loss of this symmetry in case of a wormhole attack and propose a method to detect and flag the adversary. We modify the insecure neighborhood discovery to incorporate authentication. We further extend this scheme to a trust system with low overhead.},
	address = {Ottawa, Canada},
	booktitle = {First IEEE International Workshop on Security and Forensics in Communication Systems (SFCS 2012)},
	pages = {pp. 6699-6704}
}
@conference {
	title = {Preventing Wormhole Attacks using Physical Layer Authentication},
	author = {Jain, Shalabh., Baras, John S.},
	year = {2012},
	month = {04/2012},
	abstract = {Mobile ad-hoc networks (MANETs) are a key enabler of pervasive computing. Constrained resources in mobile stations make it critical for nodes to be able to cooperate to enhance communication and computation capabilities. However, the wireless and dynamic nature of the links presents easy attack vectors for adversaries. The ability to securely discover and identify neighboring nodes (secure ND) is a fundamental building block for such networks. Even a relatively weak adversarial relay has the capability of distorting the network view and diverting significant amount of traffic. This can cause significant performance degradation. In this paper, we utilize the physical layer authentication scheme introduced by Yu, Baras and Sadler [1] to secure neighborhood discovery against adversarial relays. The proposed method incurs little performance overhead and requires no additional hardware. We provide analytical and simulation based performance evaluation of the security of our scheme.},
	address = {Paris, France},
	booktitle = {2012 IEEE Wireless Communications and Networking Conference (WCNC 2012)},
	pages = {pp. 2739-2744}
}
