A graph theoretic characterization of perfect attackability and detection in Distributed Control Systems

Sean Weerakkody; Xiaofei Liu; Sang H. Son; Bruno Sinopoli

doi:10.1109/ACC.2016.7525076

A graph theoretic characterization of perfect attackability and detection in Distributed Control Systems

Sean Weerakkody
, Xiaofei Liu
, Sang H. Son
, Bruno Sinopoli

Department of Electrical Engineering and Computer Science

Carnegie Mellon University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Abstract

This paper is concerned with the analysis and design of secure distributed control systems (DCS) in the face of integrity attacks on sensors and controllers by external attackers or insiders. In general a DCS consists of many heterogenous components and agents including sensors, actuators, and controllers. Due to its distributed nature, some agents may start misbehaving to disrupt the system. This paper first reviews necessary and sufficient conditions for deterministic detection of integrity attacks carried out by any number of malicious agents, based on the concept of left invertibility of structural control systems. It then develops a notion equivalent to structural left invertibility in terms of vertex separators of a graph, which allows a designer to efficiently determine if a network is perfectly attackable. This tool is then leveraged to design minimal communication networks for DCSs, which ensure that an adversary cannot generate undetectable attacks. Numerical examples are included to illustrate these results.

Original language	English
Title of host publication	2016 American Control Conference, ACC 2016
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1171-1178
Number of pages	8
ISBN (Electronic)	9781467386821
DOIs	https://doi.org/10.1109/ACC.2016.7525076
State	Published - 28 Jul 2016
Event	2016 American Control Conference, ACC 2016 - Boston, United States Duration: 6 Jul 2016 → 8 Jul 2016

Publication series

Name	Proceedings of the American Control Conference
Volume	2016-July
ISSN (Print)	0743-1619

Conference

Conference	2016 American Control Conference, ACC 2016
Country/Territory	United States
City	Boston
Period	6/07/16 → 8/07/16

Bibliographical note

Publisher Copyright:
© 2016 American Automatic Control Council (AACC).

Access to Document

10.1109/ACC.2016.7525076

Cite this

Weerakkody, S., Liu, X., Son, S. H., & Sinopoli, B. (2016). A graph theoretic characterization of perfect attackability and detection in Distributed Control Systems. In 2016 American Control Conference, ACC 2016 (pp. 1171-1178). Article 7525076 (Proceedings of the American Control Conference; Vol. 2016-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ACC.2016.7525076

@inproceedings{7666ab86e94949229ba45a1ac4290ea9,

title = "A graph theoretic characterization of perfect attackability and detection in Distributed Control Systems",

abstract = "This paper is concerned with the analysis and design of secure distributed control systems (DCS) in the face of integrity attacks on sensors and controllers by external attackers or insiders. In general a DCS consists of many heterogenous components and agents including sensors, actuators, and controllers. Due to its distributed nature, some agents may start misbehaving to disrupt the system. This paper first reviews necessary and sufficient conditions for deterministic detection of integrity attacks carried out by any number of malicious agents, based on the concept of left invertibility of structural control systems. It then develops a notion equivalent to structural left invertibility in terms of vertex separators of a graph, which allows a designer to efficiently determine if a network is perfectly attackable. This tool is then leveraged to design minimal communication networks for DCSs, which ensure that an adversary cannot generate undetectable attacks. Numerical examples are included to illustrate these results.",

author = "Sean Weerakkody and Xiaofei Liu and Son, \{Sang H.\} and Bruno Sinopoli",

note = "Publisher Copyright: {\textcopyright} 2016 American Automatic Control Council (AACC).; 2016 American Control Conference, ACC 2016 ; Conference date: 06-07-2016 Through 08-07-2016",

year = "2016",

month = jul,

day = "28",

doi = "10.1109/ACC.2016.7525076",

language = "English",

series = "Proceedings of the American Control Conference",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1171--1178",

booktitle = "2016 American Control Conference, ACC 2016",

}

Weerakkody, S, Liu, X, Son, SH & Sinopoli, B 2016, A graph theoretic characterization of perfect attackability and detection in Distributed Control Systems. in 2016 American Control Conference, ACC 2016., 7525076, Proceedings of the American Control Conference, vol. 2016-July, Institute of Electrical and Electronics Engineers Inc., pp. 1171-1178, 2016 American Control Conference, ACC 2016, Boston, United States, 6/07/16. https://doi.org/10.1109/ACC.2016.7525076

A graph theoretic characterization of perfect attackability and detection in Distributed Control Systems. / Weerakkody, Sean; Liu, Xiaofei; Son, Sang H. et al.
2016 American Control Conference, ACC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1171-1178 7525076 (Proceedings of the American Control Conference; Vol. 2016-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A graph theoretic characterization of perfect attackability and detection in Distributed Control Systems

AU - Weerakkody, Sean

AU - Liu, Xiaofei

AU - Son, Sang H.

AU - Sinopoli, Bruno

PY - 2016/7/28

Y1 - 2016/7/28

N2 - This paper is concerned with the analysis and design of secure distributed control systems (DCS) in the face of integrity attacks on sensors and controllers by external attackers or insiders. In general a DCS consists of many heterogenous components and agents including sensors, actuators, and controllers. Due to its distributed nature, some agents may start misbehaving to disrupt the system. This paper first reviews necessary and sufficient conditions for deterministic detection of integrity attacks carried out by any number of malicious agents, based on the concept of left invertibility of structural control systems. It then develops a notion equivalent to structural left invertibility in terms of vertex separators of a graph, which allows a designer to efficiently determine if a network is perfectly attackable. This tool is then leveraged to design minimal communication networks for DCSs, which ensure that an adversary cannot generate undetectable attacks. Numerical examples are included to illustrate these results.

AB - This paper is concerned with the analysis and design of secure distributed control systems (DCS) in the face of integrity attacks on sensors and controllers by external attackers or insiders. In general a DCS consists of many heterogenous components and agents including sensors, actuators, and controllers. Due to its distributed nature, some agents may start misbehaving to disrupt the system. This paper first reviews necessary and sufficient conditions for deterministic detection of integrity attacks carried out by any number of malicious agents, based on the concept of left invertibility of structural control systems. It then develops a notion equivalent to structural left invertibility in terms of vertex separators of a graph, which allows a designer to efficiently determine if a network is perfectly attackable. This tool is then leveraged to design minimal communication networks for DCSs, which ensure that an adversary cannot generate undetectable attacks. Numerical examples are included to illustrate these results.

UR - https://www.scopus.com/pages/publications/84992151626

U2 - 10.1109/ACC.2016.7525076

DO - 10.1109/ACC.2016.7525076

M3 - Conference contribution

AN - SCOPUS:84992151626

T3 - Proceedings of the American Control Conference

SP - 1171

EP - 1178

BT - 2016 American Control Conference, ACC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 American Control Conference, ACC 2016

Y2 - 6 July 2016 through 8 July 2016

ER -

A graph theoretic characterization of perfect attackability and detection in Distributed Control Systems

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this