On confidentiality preserving monitoring of linear dynamic networks against inference attacks

Minghui Zhu, Yang Lu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

Distributed information sharing in dynamic networks is ubiquitous. It raises the concern that confidential information of dynamic networks could be leaked to malicious entities and further exploited in direct attacks. In this paper, we formulate the problem of competitive confidentiality preserving monitoring of linear dynamic networks against inference attacks. We show that the unstructured ℓ0 minimization is NP-hard. We then provide a SDP equivalence for the structured ℓ2 minimization.

Original languageEnglish (US)
Title of host publicationACC 2015 - 2015 American Control Conference
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages359-364
Number of pages6
ISBN (Electronic)9781479986842
DOIs
StatePublished - Jul 28 2015
Event2015 American Control Conference, ACC 2015 - Chicago, United States
Duration: Jul 1 2015Jul 3 2015

Publication series

NameProceedings of the American Control Conference
Volume2015-July
ISSN (Print)0743-1619

Other

Other2015 American Control Conference, ACC 2015
Country/TerritoryUnited States
CityChicago
Period7/1/157/3/15

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'On confidentiality preserving monitoring of linear dynamic networks against inference attacks'. Together they form a unique fingerprint.

Cite this