2015 54th IEEE Conference on Decision and Control (CDC) 2015
DOI: 10.1109/cdc.2015.7403131
|View full text |Cite
|
Sign up to set email alerts
|

A divide-and-conquer approach to distributed attack identification

Abstract: Identifying attacks is key to ensure security in cyber-physical systems. In this note we remark upon the computational complexity of the attack identification problem by showing how conventional approximation techniques may fail to identify attacks. Then, we propose decentralized and distributed monitors for attack identification with performance guarantees and low computational complexity. The proposed monitors rely on the geometric framework proposed in [1], yet require only local knowledge of the system dyn… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(18 citation statements)
references
References 17 publications
0
18
0
Order By: Relevance
“…with a coupling gain κγ = 1, even when some sensor banks or local observers intermittently join or leave the network as long as the proposed assumptions are maintained. Now, if we additionally assume that the initial condition is in some compact set K as in Theorem 2, then each agent can calculate T that guarantees (13) with the prespecified . Then, by each agent constructing their partial observer fast enough so that (14) is satisfied for the same T when s l i = 1 and a i ≡ 0, they can also calculate T > T such that…”
Section: Special Case: Lyapunov Stable Systemmentioning
confidence: 99%
See 1 more Smart Citation
“…with a coupling gain κγ = 1, even when some sensor banks or local observers intermittently join or leave the network as long as the proposed assumptions are maintained. Now, if we additionally assume that the initial condition is in some compact set K as in Theorem 2, then each agent can calculate T that guarantees (13) with the prespecified . Then, by each agent constructing their partial observer fast enough so that (14) is satisfied for the same T when s l i = 1 and a i ≡ 0, they can also calculate T > T such that…”
Section: Special Case: Lyapunov Stable Systemmentioning
confidence: 99%
“…Rather than presenting a majority voting algorithm in a distributed/cooperative manner, they assume that each local unit can collect a large number of measurements and then carry out the voting by itself. As a result, in order to locally identify q sensor attacks, they assumed that each local unit of sensors contains at least 2q + 1 sensors [8], [13], or has at least 2q + 1 neighboring sensor nodes [10]- [12]. On the other hand, a fully distributed attack identification scheme is made in [14], but it is only for the case when the state has constant scalar value and it assumes only up to 30% of measurements can be compromised.…”
Section: Introductionmentioning
confidence: 99%
“…Pasqualetti et al . [ 60 ] studied the distributed identification of attacks on a CPS. They modeled the state attack and the output attack as false data injection.…”
Section: Cyber-physical Systems Securitymentioning
confidence: 99%
“…Distributed Secure State Estimation: Distributed processing mitigates the computation load by getting rid of the fusion center in centralized fusion and estimation. Pasqualetti et al [16] propose a fully decentralized solution for attack identification. However, they only consider noiseless systems.…”
Section: Introductionmentioning
confidence: 99%