2014
DOI: 10.2514/1.i010201
|View full text |Cite
|
Sign up to set email alerts
|

Analysis and Design of Stealthy Cyber Attacks on Unmanned Aerial Systems

Abstract: Cyber security has emerged as one of the most important issues in unmanned aerial systems for which the functionality heavily relies on onboard automation and intervehicle communications. In this paper, potential cyber threats and vulnerabilities in the unmanned aerial system's state estimator to stealthy cyber attacks are identified, which can avoid being detected by the monitoring system. Specifically, this paper investigates the worst stealthy cyber attack that can maximize the state estimation error of the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
53
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 62 publications
(53 citation statements)
references
References 27 publications
0
53
0
Order By: Relevance
“…As shown in [22], [11], for LTI systems without any additional data integrity guarantees, the setR α = ∞ k=0R α k can be bounded or unbounded depending on the system dynamics and the set of compromised sensors K. From Theorem 2, this property is preserved for the set R as well. For this reason, we will be using the definition ofR α to analyze boundedness of R, and to simplify the notation due to linearity of the constraint we will assume that α = 1 -i.e., for this analysis we consider the stealthiness attack constraint as…”
Section: A Perfectly Attackable Systemsmentioning
confidence: 87%
See 4 more Smart Citations
“…As shown in [22], [11], for LTI systems without any additional data integrity guarantees, the setR α = ∞ k=0R α k can be bounded or unbounded depending on the system dynamics and the set of compromised sensors K. From Theorem 2, this property is preserved for the set R as well. For this reason, we will be using the definition ofR α to analyze boundedness of R, and to simplify the notation due to linearity of the constraint we will assume that α = 1 -i.e., for this analysis we consider the stealthiness attack constraint as…”
Section: A Perfectly Attackable Systemsmentioning
confidence: 87%
“…Here, T is the length of the detector's time window, and c i for i = 1, ..., T are predefined non-negative coefficients, with c T being strictly positive. The above formulation captures both fixed window size detectors, where T is a constant, as well as detectors where the time window size T satisfies T = k. Also, the definition of the detection function g k covers a wide variety of commonly used intrusion detectors, such as χ 2 and sequential probability ratio test (SPRT) detectors previously considered in these scenarios [20], [18], [23], [19], [11], [12]. The alarm is triggered when the value of the detection function g k satisfies that g k > threshold, (7) and the probability of the alarm at time k can be captured as…”
Section: A System Model Without Attacksmentioning
confidence: 99%
See 3 more Smart Citations