learning-based attacks in cyber-physical systemsmjkhojas/papers/lb-slide.pdfthe man in the middle...

Post on 10-Jul-2020

5 Views

Category:

Documents

0 Downloads

Preview:

Click to see full reader

TRANSCRIPT

Learning-based Attacks in

Cyber-Physical Systems

1

Mohammad Javad (MJ) Khojasteh

Center for Autonomous Systems and Technologies (CAST)

California Institute of Technology

Joint work with:

• Anatoly Khina, Tel Aviv University

• Massimo Franceschetti, University of California, San Diego

• Tara Javidi, University of California, San Diego

Cloud robots and automation systems

MJ Khojasteh 2

Security

MJ Khojasteh 3

We need to address physical security in addition to cyber security

News reports

4MJ Khojasteh

News reports

“It has changed the way we view the security threat”

5MJ Khojasteh

ff

The man in the middle

Plant Controller

A malicious controller

for the plant

A fictitious plant for

the controller

6MJ Khojasteh

Mathematical formulation

• Linear dynamical system

• The controller, at time , observes and generates a control signal

as a function of all past observations .

• The attacker feeds a malicious input to the plant.

• How can the controller detect that the system is under attack?

Under normal operation

Under attack

7

are i.i.d.

MJ Khojasteh

Anomaly detection

• The controller is armed with a detector that tests for anomalies in

the observed history .

• Under legitimate system operation we expect

• The detector performs the variance test

• What kind of attacks can we detect?

8

i.i.d.

MJ Khojasteh

B. Satchidanandan,

P. R. Kumar (2017)

R. S. Smith (2011)

The man in the middle attack types

Replay attack

Statistical-duplicate attack

Learning-based attack

9

Y. Mo, B. Sinopoli (2009)

MJ Khojasteh

MJ Khojasteh et al.

(2020)

Stuxnet

• The attacker has access to both and and knows the

distribution of and of the initial condition , but it should learn

the open loop gain of the plant.

• For analysis purposes, we can assume the open loop gain of the plant

is a random variable with a distribution known to the attacker and

for any event we let

Learning-based attack

10MJ Khojasteh

Two phases of the learning-based attack

Learning (exploration)

phase

Hijacking (exploitation)

phase

Eavesdropping and learning Hijacking the system

11MJ Khojasteh

Learning (exploration) phase

• For , the attacker observes the plant state and control input,

and tries to learn the open-loop gain .

12MJ Khojasteh

Hijacking (exploitation) phase

• For , the attacker feeds the fake signal to the

controller, reads the next input , and drives the system to an

undesired state by feeding to the plant.

13MJ Khojasteh

• The controller uses to construct an estimate of

according to the variance test

Detecting the attack

14

• Let be the indicator of the attack at any time before

• Define the deception probabilities

• Assume the power of the fictitious sensor reading converges a.s.

MJ Khojasteh

Results

15

• We provide lower and upper bounds on the deception probability

• The lower bound is based on a given learning algorithm and holds

for any measurable control policy

• The upper bound holds for any learning algorithm, and any

measurable control policy

MJ Khojasteh

• Assuming the attacker uses a least-square learning algorithm to learn

the plant, such that

• This algorithm is consistent, namely

Lower bound

16

as

K. J. Åström, P. Eykhoff (1971), L Ljung (1982)

MJ Khojasteh

Lower bound

17

• On the other hand, for any fixed L the deception probability

depends on the ability to learn the plant, and we can show

Using concentration bound

of A. Rantzer 2018

MJ Khojasteh

Comparison with a replay attack

18MJ Khojasteh

MJ Khojasteh et al.

(2020)

Upper bound on the deception probability

• If is distributed uniformly in , then letting

, we have

• The numerator represents the information revealed about from

the observation of the random variable

• The denominator represents the intrinsic uncertainty of when it is

observed at resolution corresponding to the entropy of

the quantized random variable

19MJ Khojasteh

• In addition, if is a Markov chain for all

, then

Upper bound on the deception probability

any sequence of probability measures , provided

for all

20MJ Khojasteh

• The freedom in choosing the auxiliary probability measure

make the second bound a useful bound.

The Gaussian case

21

• Gaussian plant disturbance

• By choosing we have

where

MJ Khojasteh

Impede the learning process of the attacker

Privacy-enhancing signal

22MJ Khojasteh

Nominal control policy

Privacy-enhancing signal

23

• Injecting a strong noise may in fact speed up the learning process

• Carefully crafted watermarking signals provide better guarantees

on the deception probability

?

Privacy-enhancing signal

MJ Khojasteh

24

Defense against learning-based attack

MJ Khojasteh

MJ Khojasteh et al.

(2020)

Vector systems

25MJ Khojasteh

Learning-based attack: vector systems

26

MJ Khojasteh et al.

(2020)

MJ Khojasteh

Defense against vector learning-based attack

27MJ Khojasteh

Nonlinear learning-based attack

28MJ Khojasteh

Reproducing Kernel Hilbert Space (RKHS)

Linear regression Bayesian learning: Gaussian processes (GP)

Vulnerable region

Lower attacker's

success rate

References

29MJ Khojasteh

• Khojasteh MJ, Khina A, Franceschetti M, Javidi T.

Authentication of cyber-physical systems under learning-based attacks.

IFAC-PapersOnLine. 2019 Jan 1; 52(20): 369-74.

• Khojasteh, M.J., Khina, A., Franceschetti, M. and Javidi, T.

Learning-based attacks in cyber-physical systems.

arXiv preprint arXiv:1809.06023, 2020.

top related