scispace - formally typeset
Open AccessJournal ArticleDOI

Attack Detection and Identification in Cyber-Physical Systems

TLDR
In this article, a mathematical framework for cyber-physical systems, attacks, and monitors is proposed, and fundamental monitoring limitations from both system-theoretic and graph-based perspectives are characterized.
Abstract
Cyber-physical systems are ubiquitous in power systems, transportation networks, industrial control processes, and critical infrastructures. These systems need to operate reliably in the face of unforeseen failures and external malicious attacks. In this paper: (i) we propose a mathematical framework for cyber-physical systems, attacks, and monitors; (ii) we characterize fundamental monitoring limitations from system-theoretic and graph-theoretic perspectives; and (ii) we design centralized and distributed attack detection and identification monitors. Finally, we validate our findings through compelling examples.

read more

Content maybe subject to copyright    Report

Attack Detection and Identification in
Cyber-Physical Systems
Fabio Pasqualetti, Florian D
¨
orfler, and Francesco Bullo
Abstract
Cyber-physical systems are ubiquitous in power systems, transportation networks, industrial process
control and critical infrastructures. These systems need to operate reliably in the face of unforeseen
failures and external malicious attacks. In this paper (i) we propose a mathematical framework for cyber-
physical systems, attacks, and monitors; (ii) we characterize fundamental monitoring limitations from
system-theoretic and graph-theoretic perspectives; and (iii) we design centralized and distributed attack
detection and identification monitors. Finally, we validate our findings through compelling examples.
I. INTRODUCTION
Cyber-physical systems integrate physical processes, computational resources, and communi-
cation capabilities. Examples of cyber-physical systems include transportation networks, power
generation and distribution networks, water and gas distribution networks, and advanced com-
munication systems. As recently highlighted by the Maroochy water breach [1] in March 2000,
multiple recent power blackouts in Brazil [2], the SQL Slammer worm attack on the Davis-Besse
nuclear plant in January 2003 [3], the StuxNet computer worm [4] in June 2010, and by various
industrial security incidents [5], cyber-physical systems are prone to failures and attacks on their
physical infrastructure, and cyber attacks on their data management and communication layer.
Concerns about security of control systems are not new, as the numerous manuscripts on
systems fault detection, isolation, and recovery testify [6], [7]. Cyber-physical systems, however,
suffer from specific vulnerabilities which do not affect classical control systems, and for which
This material is based upon work supported in part by NSF grant CNS-1135819 and by the Institute for Collaborative
Biotechnologies through grant W911NF-09-0001 from the U.S. Army Research Office.
Fabio Pasqualetti, Florian D
¨
orfler, and Francesco Bullo are with the Center for Control, Dynamical Systems and Computation,
University of California at Santa Barbara, {fabiopas,dorfler,bullo}@engineering.ucsb.edu.

appropriate detection and identification techniques need to be developed. For instance, the
reliance on communication networks and standard communication protocols to transmit measure-
ments and control packets increases the possibility of intentional and worst-case attacks against
physical plants. On the other hand, information security methods, such as authentication, access
control, and message integrity, appear inadequate for a satisfactory protection of cyber-physical
systems. Indeed, these security methods do not exploit the compatibility of the measurements
with the underlying physical process or the control mechanism, and they are therefore ineffective
against insider attacks targeting the physical dynamics [1].
Related work. The analysis of vulnerabilities of cyber-physical systems to external attacks has
received increasing attention in the last years. The general approach has been to study the
effect of specific attacks against particular systems. For instance, in [8] deception and denial
of service attacks against a networked control system are defined, and, for the latter ones, a
countermeasure based on semi-definite programming is proposed. Deception attacks refer to the
possibility of compromising the integrity of control packets or measurements, and they are cast
by altering the behavior of sensors and actuators. Denial of service attacks, instead, compromise
the availability of resources by, for instance, jamming the communication channel. In [9] false
data injection attacks against static state estimators are introduced. False data injection attacks
are specific deception attacks in the context of static estimators. It is shown that undetectable
false data injection attacks can be designed even when the attacker has limited resources. In a
similar fashion, stealthy deception attacks against the Supervisory Control and Data Acquisition
system are studied, among others, in [10]. In [11] the effect of replay attacks on a control
system is discussed. Replay attacks are cast by hijacking the sensors, recording the readings
for a certain amount of time, and repeating such readings while injecting an exogenous signal
into the system. It is shown that these attacks can be detected by injecting a signal unknown
to the attacker into the system. In [12] the effect of covert attacks against control systems is
investigated. Specifically, a parameterized decoupling structure allows a covert agent to alter
the behavior of the physical plant while remaining undetected from the original controller. In
[13] a resilient control problem is studied, in which control packets transmitted over a network
are corrupted by a human adversary. A receding-horizon Stackelberg control law is proposed to
stabilize the control system despite the attack. Recently the problem of estimating the state of a
linear system with corrupted measurements has been studied [14]. More precisely, the maximum

number of tolerable faulty sensors is characterized, and a decoding algorithm is proposed to detect
corrupted measurements. Finally, security issues of specific cyber-physical systems have received
considerable attention, such as power networks [15]–[19], linear networks with misbehaving
components [20], [21], and water networks [22], [23].
Contributions. The contributions of this paper are as follows. First, we describe a unified
modeling framework for cyber-physical systems and attacks (Section II). Motivated by existing
cyber-physical systems and existing attack scenarios, we model a cyber-physical system under
attack as a descriptor system subject to unknown inputs affecting the state and the measurements.
For our model, we define the notions of detectability and identifiability of an attack by its effect
on output measurements. Informed by the classic work on geometric control theory [24], [25],
our framework includes the deterministic static detection problem considered in [9], [10], and
the prototypical deception and denial of service [8], stealth [16], (dynamic) false-data injection
[26], replay attacks [11], and covert attacks [12] as special cases.
Second, we show the fundamental limitations of a class of monitors (Section III-A). This
class includes the widely-studied static, dynamic, and active monitors. We prove that (i) a cyber-
physical attack is undetectable by our monitors if and only if the attackers’ signal excites uniquely
the zero dynamics of the input/output system, and (ii) that undetectable and unidentifiable attacks
can be cast without knowing monitoring signals or the system noise.
Third, we provide a graph-theoretic characterization of undetectable attacks (Section III-B).
We borrow some tools from the theory of structured systems, and we identify conditions on the
system interconnection structure for the existence of undetectable attacks. These conditions are
generic, in the sense that they hold for almost all numerical systems with the same structure, and
they can be efficiently verified. As a complementary result, we extend a result of [27] on structural
left-invertibility to regular descriptor systems. Finally, with respect to our earlier work [20], [21],
we consider continuous-time descriptor systems, and we include parameters constraints.
Fourth, we design centralized and distributed monitors (Section IV). Our centralized monitors
and our distributed detection monitor are complete, in the sense that they detect and identify
every (detectable and identifiable) attack. Our centralized monitors are designed by leveraging
on tools from geometric control theory, while our distributed detection monitor relies upon
techniques from distributed control and parallel computation. Additionally, we characterize the
computational complexity of the attack identification problem.

Fifth and finally, we illustrate the potential impact of our theoretical findings through com-
pelling examples. In particular, (i) we design an undetectable state attack to destabilize the
WSSC 3-machine 6-bus power system, (ii) we characterize the resilience to output attacks of the
IEEE 14 bus system, (iii) we show the detection performance of our distributed monitor on the
IEEE 118 bus system, and (iv) we use the RTS 96 network model to illustrate that our methods
are effective also in the presence of system noise, nonlinearities, and modeling uncertainties.
Through these examples we show the advantages of dynamic monitors against static ones, and
we provide insight on the design of attacks.
II. PROBLEM SETUP AND PRELIMINARY RESULTS
In this paper we model cyber-physical systems under attack as linear time-invariant descriptor
systems subject to unknown inputs. This simplified model neglects system nonlinearities and the
presence of noise in the dynamics and the measurements. Nevertheless, such a simplified model
has long proven useful in studying stability, faults, and attacks in, for instance, power networks,
sensor networks, and water networks. It is our premise that more detailed models are unlikely
to change the basic conclusions of this work.
Model of cyber-physical systems under attack. We consider the descriptor system
1
E ˙x(t) = Ax(t) + Bu(t),
y(t) = Cx(t) + Du(t),
(1)
where x(t) R
n
, u(t) R
m
, y(t) R
p
, E R
n×n
, A R
n×n
, B R
n×m
, C R
p×n
, and D
R
p×m
. Here the matrix E is possibly singular, and the inputs Bu and Du are unknown signals
describing disturbances affecting the plant. Besides reflecting the genuine failure of systems
components, these disturbances model the effect of attacks against the cyber-physical system.
Without loss of generality, we assume that each state and output variable can be independently
compromised by an attacker, and we let B = [I
n×n
0
n×p
] and D = [0
p×n
I
p×p
].
The attack signal t 7→ u(t) R
n+p
depends upon the specific attack strategy. In particular, if
K {1, . . . , n + p} is the attack set, with |K| = k, then all (and only) the entries of u indexed
by K are nonzero over time, that is, for each i K, there exists a time t such that u
i
(t) 6= 0,
1
The results stated in this paper for continuous-time descriptor systems hold also for discrete-time descriptor systems and
nonsingular systems. Moreover, due to linearity of (1), known inputs do not affect our results.

and u
j
(t) = 0 for all j 6∈ K and at all times. To underline this sparsity relation, we sometimes
use u
K
to denote the attack signal, that is the subvector of u indexed by K. Accordingly, the
pair (B
K
, D
K
), where B
K
and D
K
are the submatrices of B and D with columns in K, denote
the attack signature. Hence, Bu(t) = B
K
u
K
(t), and Du(t) = D
K
u
K
(t). Since the matrix E
may be singular, we make the following assumptions on system (1):
(A1) the pair (E, A) is regular, that is, the determinant |sE A| does not vanish identically;
(A2) the initial condition x(0) R
n
is consistent, that is, (Ax(0) + Bu(0)) Im(E); and
(A3) the input signal u(t) is smooth.
Assumption (A1) assures the existence of a unique solution x(t) to (1). Assumptions (A2) and
(A3) guarantee smoothness of the state trajectory x(t) and the measurements y(t), [28, Lemma
2.5]. If assumptions (A2) and (A3) are dropped, then there are inconsistent initial conditions and
impulsive inputs by which a powerful attacker can avoid detection; see Remark 4. Throughout
the paper, the cardinality k of the attack set, or an upper bound, is assumed to be known.
Remark 1: (Examples of cyber-physical systems requiring advanced security mechanisms)
Future power grids will combine physical dynamics with a sophisticated coordination infrastruc-
ture. The cyber-physical security of the grid has been identified as an issue of primary concern,
see [19], [29] and [10], [16]–[18], [30], [31].
Mass transport networks are cyber-physical systems, such as gas transmission and distribution
networks [32], large-scale process engineering plants [33], and water networks. Examples of
water networks include open channel flows [34] for irrigation purposes and municipal water
networks [35], [36]. The vulnerability of open channel networks to cyber-physical attacks has
been studied in [12], [22], and municipal water networks are also known to be susceptible to
attacks on the hydraulics [1] and biochemical contamination threats [23].
Power networks and mass transport network under attack can be modeled by descriptor systems
with unknown inputs. For instance, the small-signal version of the classical structure-preserving
power network model reads as [30], [31]
I 0 0
0 M
g
0
0 0 0
˙
δ(t)
˙ω(t)
˙
θ(t)
=
0 I 0
L
gg
D
g
L
gl
L
lg
0 L
ll
δ(t)
ω(t)
θ(t)
+
0
P
ω
(t)
P
θ
(t)
, (2)
where δ and ω denote the generator rotor angles and frequencies, θ are the voltage angles at the
buses, L =
h
L
gg
L
gl
L
lg
L
ll
i
is the network susceptance matrix, M
g
and D
g
are the diagonal matrices

Figures
Citations
More filters
Journal ArticleDOI

Input-to-State Stabilizing Control Under Denial-of-Service

TL;DR: This paper analyzes networked control systems in the presence of denial-of-service (DoS) attacks, namely attacks that prevent transmissions over the network, to characterize frequency and duration of the DoS attacks under which input-to-state stability (ISS) of the closed-loop system can be preserved.
Journal ArticleDOI

Survey of intrusion detection systems: techniques, datasets and challenges

TL;DR: A taxonomy of contemporary IDS is presented, a comprehensive review of notable recent works, and an overview of the datasets commonly used for evaluation purposes are presented, and evasion techniques used by attackers to avoid detection are presented.
Journal ArticleDOI

A survey on security control and attack detection for industrial cyber-physical systems

TL;DR: An overview of recent advances on security control and attack detection of industrial CPSs is presented, and robustness, security and resilience as well as stability are discussed to govern the capability of weakening various attacks.
Journal ArticleDOI

Networked control systems: a survey of trends and techniques

TL;DR: A survey of trends and techniques in networked control systems from the perspective of ‘ control over networks ’ is presented, providing a snapshot of five control issues: sampled-data control, quantization control, networking control, event-triggered control, and security control.
Journal ArticleDOI

Physical Authentication of Control Systems: Designing Watermarked Control Inputs to Detect Counterfeit Sensor Outputs

TL;DR: A wide variety of motivations exists for launching an attack on CPSs, ranging from economic reasons, such as obtaining a financial gain, all the way to terrorism, for instance, threatening an entire population by manipulating life-critical resources.
References
More filters
Journal ArticleDOI

Decoding by linear programming

TL;DR: F can be recovered exactly by solving a simple convex optimization problem (which one can recast as a linear program) and numerical experiments suggest that this recovery procedure works unreasonably well; f is recovered exactly even in situations where a significant fraction of the output is corrupted.
Journal ArticleDOI

MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education

TL;DR: The details of the network modeling and problem formulations used by MATPOWER, including its extensible OPF architecture, are presented, which are used internally to implement several extensions to the standard OPF problem, including piece-wise linear cost functions, dispatchable loads, generator capability curves, and branch angle difference limits.
Journal ArticleDOI

The IEEE Reliability Test System-1996. A report prepared by the Reliability Test System Task Force of the Application of Probability Methods Subcommittee

TL;DR: In this article, an enhanced test system (RTS-96) is described for use in bulk power system reliability evaluation studies, which will permit comparative and benchmark studies to be performed on new and existing reliability evaluation techniques.
BookDOI

Power System State Estimation : Theory and Implementation

TL;DR: In this paper, Peters and Wilkinson this paper proposed a WLS state estimation algorithm based on the Nodal Variable Formulation (NVF) and the Branch Variable Factorization (BVF).
Proceedings ArticleDOI

False data injection attacks against state estimation in electric power grids

TL;DR: A new class of attacks, called false data injection attacks, against state estimation in electric power grids are presented, showing that an attacker can exploit the configuration of a power system to launch such attacks to successfully introduce arbitrary errors into certain state variables while bypassing existing techniques for bad measurement detection.
Related Papers (5)
Frequently Asked Questions (15)
Q1. What contributions have the authors mentioned in the paper "Attack detection and identification in cyber-physical systems" ?

In this paper ( i ) the authors propose a mathematical framework for cyberphysical systems, attacks, and monitors ; ( ii ) they characterize fundamental monitoring limitations from system-theoretic and graph-theoretic perspectives ; and ( iii ) they design centralized and distributed attack detection and identification monitors. 

Future and ongoing work includes ( i ) a detailed analysis of the convergence of their distributed monitor, ( ii ) the design of distributed identification monitors, and ( iii ) the design of monitors robust to system noise and unmodeled dynamics. 

Mass transport networks are cyber-physical systems, such as gas transmission and distributionnetworks [32], large-scale process engineering plants [33], and water networks. 

3. Let Gs = (V , E) be the directed sparsity graph associated with the pair (E,A), where the vertex set V = X corresponds to the system state, and the set of directed edges E = {(xj, xi) : eij 6= 0 or aij 6= 0} is induced by the sparsity pattern of E and A. 

For a linear descriptor system with smooth input and consistent initialcondition, the existence of zero dynamics is equivalent to the existence of invariant zeros asin (ii), see [28, Theorem 3.2 and Proposition 3.4]. 

To show stability of the error dynamics in the absence of attacks, the authors employ the small-gain approach to large-scale systems and rewrite the error dynamics (12) as the closed-loopinterconnection of the two subsystems Γ1 : Eė(t) = (AD + GC)e(t) + v(t) and Γ2 : v(t) = ACe(t). 

Theorem 3.5 extends the structural left-invertibility results known for nonsingular systems toregular descriptor systems, and its proof relies on classical concepts from structural analysis,algebraic geometry, and graph theory. 

Since the initial condition x(0) and the input uK are assumed to be consistent (A2) and non-impulsive (A3), the error system (6) has no invariant zeros if and only if [28, Proposition 3.4] there exists no triple (s, w̄, gK) ∈ C× Rn × Rp satisfying sE − (A+GC) BK +GDKC −DK w̄ gK = 0 0 . (7)The second equation of (7) yields Cw̄ = DKgK . 

Let V be partitioned into N disjoint subsets as V = V1 ∪ · · · ∪ VN , with |Vi| = ni, and let Gis = (Vi, Ei) be the i-th subgraph of Gs with vertices Vi and edges Ei = E ∩ (Vi × Vi). 

the matrix s[E]−[A] is structurally non-degenerate if the determinant |sE−A| 6= 0 for a generic realization of E and A, that is, |sE −A| 6= 0 holds in the whole parameter space of elements of E and A with exception of a low dimensional variety [24], [38]. 

For the ease of notation and without affecting generality, the third and final design step ofour attack identification filter is presented for the pre-conditioned system (25). 

The following centralized attack identification procedure consists of designing a residual filter to determine whether a predefined set coincides with theattack set. 

The vulnerability of open channel networks to cyber-physical attacks hasbeen studied in [12], [22], and municipal water networks are also known to be susceptible toattacks on the hydraulics [1] and biochemical contamination threats [23]. 

Remark 1: (Examples of cyber-physical systems requiring advanced security mechanisms)Future power grids will combine physical dynamics with a sophisticated coordination infrastruc-ture. 

Lemma 4.2: (Decentralized stabilization of the attack detection filter) Consider the descriptorsystem (1), and assume that the attack set K is detectable and that the network initial state x(0)is known.