Security Allocation in Networked Control Systems under Stealthy Attacks
This paper considers the problem of security allocation in a networked control system under stealthy attacks. The system is comprised of interconnected subsystems represented by vertices. A malicious adversary selects a single vertex on which to conduct a stealthy data injection attack with the purpose of maximally disrupting a distant target vertex while remaining undetected. Defense resources against the adversary are allocated by a defender on several selected vertices. First, the objectives of the adversary and the defender with uncertain targets are formulated in a probabilistic manner, resulting in an expected worst-case impact of stealthy attacks. Next, we provide a graph-theoretic necessary and sufficient condition under which the cost for the defender and the expected worst-case impact of stealthy attacks are bounded. This condition enables the defender to restrict the admissible actions to dominating sets of the graph representing the network. Then, the security allocation problem is solved through a Stackelberg game-theoretic framework. Finally, the obtained results are validated through a numerical example of a 50-vertex networked control system.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Scalable and Optimal Security Allocation in Networks against Stealthy Injection Attacks
This paper addresses the security allocation problem in a networked control system under stealthy injection attacks. The networked system is comprised of interconnected subsystems which are represented by nodes in a digr…
A Survey of Graph-Theoretic Approaches for Analyzing the Resilience of Networked Control Systems
As the scale of networked control systems increases and interactions between different subsystems become more sophisticated, questions of the resilience of such networks increase in importance. The need to redefine class…
MiscellaneousDeep reinforcement learning for scheduling in large-scale networked control systems
This work considers the problem of control and resource scheduling in networked systems. We present DIRA, a Deep reinforcement learning based Iterative Resource Allocation algorithm, which is scalable and control-aware. …
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)+1Conformal Lyapunov Optimization: Optimal Resource Allocation under Deterministic Reliability Constraints
This paper introduces conformal Lyapunov optimization (CLO), a novel resource allocation framework for networked systems that optimizes average long-term objectives, while satisfying deterministic long-term reliability c…
Image SegmentationSemantic SegmentationBilateral Cognitive Security Games in Networked Control Systems under Stealthy Injection Attacks
This paper studies a strategic security problem in networked control systems under stealthy false data injection attacks. The security problem is modeled as a bilateral cognitive security game between a defender and an a…