.png){kind=icon}
.png){kind=icon}
Return
Process Resilience under Optimal Data Injection Attacks
.png){kind=icon}
OA
AI
DOI：10.1002/aic.18896.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, we study the resilience of process systems in an information-theoretic framework, from the perspective of an attacker capable of optimally constructing data injection attacks. The attack aims to distract the stationary distributions of process variables and stay stealthy, simultaneously. The problem is formulated as designing a multivariate Gaussian distribution to maximize the Kullback-Leibler divergence between the stationary distributions of states and state estimates under attacks and without attacks, while minimizing that between the distributions of sensor measurements. When the attacker has limited access to sensors, sparse attacks are proposed by incorporating a sparsity constraint. We conduct theoretical analysis on the convexity of the attack construction problem and present a greedy algorithm, which enables systematic assessment of measurement vulnerability, thereby offering insights into the inherent resilience of process systems. We numerically evaluate the performance of proposed constructions on a two-reactor process.
Keywords:
cybersecurity
data injection attacks
information-theoretic measures
process resilience
vulnerability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
1.1W
Citations:
2.9W
Organization
No organization information available