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 digraph. An adversary compromises the system by injecting false data into several nodes with the aim of maximally disrupting the performance of the network while remaining stealthy to a defender. To minimize the impact of such stealthy attacks, the defender, with limited knowledge about attack policies and attack resources, allocates several sensors on nodes to impose the stealthiness constraint governing the attack policy. We provide an optimal security allocation algorithm to minimize the expected attack impact on the entire network. Furthermore, under a suitable local control design, the proposed security allocation algorithm can be executed in a scalable way. Finally, the obtained results are validated through several numerical examples.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
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 …
Risk-based Security Measure Allocation Against Injection Attacks on Actuators
This article considers the problem of risk-optimal allocation of security measures when the actuators of an uncertain control system are under attack. We consider an adversary injecting false data into the actuator chann…
Risk assessment and optimal allocation of security measures under stealthy false data injection attacks
This paper firstly addresses the problem of risk assessment under false data injection attacks on uncertain control systems. We consider an adversary with complete system knowledge, injecting stealthy false data into an …
Security of Distributed Gradient Descent Against Byzantine Agents
This paper investigates the security of Decentralized Gradient Descent (DGD) algorithms on undirected graphs. Specifically, we consider Byzantine agents that inject stealthy attacks to degrade the performance of the DGD …
Stealthy Adversarial Attacks on Stochastic Multi-Armed Bandits
Adversarial attacks against stochastic multi-armed bandit (MAB) algorithms have been extensively studied in the literature. In this work, we focus on reward poisoning attacks and find most existing attacks can be easily …
Multi-Armed Bandits