Distributed compressive detection with perfect secrecy

Bhavya Kailkhura, Thakshila Wimalajeewa, Lixin Shen, Pramod K. Varshney

Research output: Chapter in Book/Entry/PoemConference contribution

3 Scopus citations

Abstract

This paper considers the problem of distributed compressive detection under a perfect secrecy constraint. More specifically, we consider the problem where the distributed inference network operates in the presence of an eavesdropper who wants to discover the state of the nature being monitored by the system. It is shown that perfect secrecy can be achieved by using cooperating trustworthy nodes that assist the Fusion Center (FC) by providing falsified data to the eavesdroppers. We also consider the problem of determining optimal system parameters which maximize the detection performance at the FC, while ensuring perfect secrecy at the eavesdropper.

Original languageEnglish (US)
Title of host publicationProceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages674-679
Number of pages6
ISBN (Electronic)9781479960354
DOIs
StatePublished - Feb 6 2015
Event11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014 - Philadelphia, United States
Duration: Oct 28 2014Oct 30 2014

Publication series

NameProceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014

Other

Other11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014
Country/TerritoryUnited States
CityPhiladelphia
Period10/28/1410/30/14

Keywords

  • Compressive detection
  • data falsification
  • eavesdropping attack
  • friendly Byzantines
  • random projections

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Distributed compressive detection with perfect secrecy'. Together they form a unique fingerprint.

Cite this