2018
DOI: 10.1016/j.automatica.2017.11.018
|View full text |Cite
|
Sign up to set email alerts
|

Worst-case stealthy innovation-based linear attack on remote state estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
78
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 207 publications
(80 citation statements)
references
References 19 publications
1
78
1
Order By: Relevance
“…Another example of attack analysis for introducing undetectable attack is discussed in [172]. In [225], [226], Kullback-Leibler divergence is employed to develop a stealthiness and obtain worst-case attack policies as a trade-off between system performance degradation and attack stealthiness. In [227], [228], worst case deception attacks are analyzed in stochastic systems and the number of sensors to secure the system using a Kalman filter approach is proposed.…”
Section: A Threat Assessmentmentioning
confidence: 99%
See 1 more Smart Citation
“…Another example of attack analysis for introducing undetectable attack is discussed in [172]. In [225], [226], Kullback-Leibler divergence is employed to develop a stealthiness and obtain worst-case attack policies as a trade-off between system performance degradation and attack stealthiness. In [227], [228], worst case deception attacks are analyzed in stochastic systems and the number of sensors to secure the system using a Kalman filter approach is proposed.…”
Section: A Threat Assessmentmentioning
confidence: 99%
“…In these works, a zero-dynamic output can be injected to the system so that while to the system operators it may appear that the output remains at zero, the actual system response is becoming unbounded. In [225], [237], the degradation of system performance under a linear attack policy on A 2 is analyzed. The timing of DoS attacks (A 1 ) is discussed in [238].…”
Section: A Threat Assessmentmentioning
confidence: 99%
“…Hence from [21, Theorem 1], we conclude that the proposed algorithm converges to a stationary point. The steps in (16) and (17) reduce the problem in (15) to that of solving a sequence of SDPs, which can be efficiently solved by interior-point methods.…”
Section: A Block-coordinate Descent (Bcd) Based Approachmentioning
confidence: 99%
“…In [14] the mean square error (MSE) performance of single sensor Kalman filter with data-falsification attacks was analyzed considering the Kullback-Leibler (KL) divergence as a measure of attack stealthiness. Similarly, in [15] it was shown that with KL divergence as the stealth metric, the worst-case linear attack strategy that maximizes the estimation error covariance is a zero-mean Gaussian distributed attack sequence. In [16], the authors propose algorithms to design attack sequence to move the state of a CPS to a target state while satisfying the probability of detection constraints.…”
Section: Introductionmentioning
confidence: 98%
“…Additionally, Kullback-Leibler (KL) divergence [27] is used to define a stealthiness constraint, which makes the framework independent of the choice of anomaly detector. Stealthiness constraints based on KL-divergence have been used in several works so far [28]- [31].…”
Section: Introductionmentioning
confidence: 99%