Cited 0 time in webofscience Cited 1 time in scopus

A Graph-Theoretic Characterization of Perfect Attackability for Secure Design of Distributed Control Systems

Title
A Graph-Theoretic Characterization of Perfect Attackability for Secure Design of Distributed Control Systems
Authors
Weerakkody, SeanLiu, XiaofeiSon, Sang HyukSinopoli, Bruno
DGIST Authors
Son, Sang Hyuk
Issue Date
2017
Citation
IEEE Transactions on Control of Network Systems, 4(1), 60-70
Type
Article
Article Type
Article
Keywords
Control SystemsCyber Physical Systems (CPSs)Cyberphysical SystemsData AcquisitionDetection of AttacksDetectorsDetectorsDistributed Control SystemsDistributed Parameter Control SystemsEmbedded SystemsGraph TheoryHeterogeneous ComponentIndependent AgentsMulti Agent SystemsMultiagent SystemsNetwork DesignNetwork DesignNetwork SecurityOptimizationOptimization ProblemsPolynomial ApproximationRobustnessRobustness (Control Systems)Scada SystemsSecuritySeparatorsSupervisory Control and Data Acquisition (SCADA) SystemsSupervisory Control and Data Acquisition (SCADA) Systems
ISSN
2325-5870
Abstract
This paper considers secure design in distributed control systems to ensure the detection of stealthy integrity attacks. Distributed control systems consist of many heterogeneous components, such as sensors, controllers, and actuators and may contain several independent agents. The presence of many components and agents in a system increases the attack surfaces for potential adversaries, making distributed control systems vulnerable to malicious behavior. The goal of this paper is to consider the design of distributed control systems to ensure the deterministic detection of attacks. To do this, we leverage existing results which relate the deterministic detection of a fixed set of malicious nodes to structural left invertibility. We extend the notion of structural left invertibility to consider attacks from all possible sets of malicious nodes using vertex separators. Vertex separators are then used to solve optimization problems which aim to minimize communication networks while also ensuring that a resource limited adversary cannot generate perfect attacks. Optimal bounds on communication and sensing are obtained and polynomial time design algorithms are provided. © 2016 IEEE.
URI
http://hdl.handle.net/20.500.11750/4290
DOI
10.1109/TCNS.2016.2573741
Publisher
Institute of Electrical and Electronics Engineers Inc.
Related Researcher
  • Author Son, Sang Hyuk RTCPS(Real-Time Cyber-Physical Systems Research) Lab
  • Research Interests
Files:
There are no files associated with this item.
Collection:
ETC1. Journal Articles


qrcode mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE