### Skapa referens, olika format (klipp och klistra)

**Harvard**

Hendrickx, J., Johansson, K., Jungers, R., Sandberg, H. och Sou, K. (2014) *Efficient Computations of a Security Index for False Data Attacks in Power Networks*.

** BibTeX **

@article{

Hendrickx2014,

author={Hendrickx, Julien and Johansson, Karl Henrik and Jungers, Raphael and Sandberg, Henrik and Sou, Kin Cheong},

title={Efficient Computations of a Security Index for False Data Attacks in Power Networks},

journal={IEEE Transactions on Automatic Control},

issn={0018-9286},

volume={59},

issue={12},

pages={3194-3208},

abstract={The resilience of Supervisory Control and Data Acquisition (SCADA) systems for electric power networks for certain cyber-attacks is considered. We analyze the vulnerability of the measurement system to false data attack on communicated measurements. The vulnerability analysis problem is shown to be NP-hard, meaning that unless $P = NP$ there is no polynomial time algorithm to analyze the vulnerability of the system. Nevertheless, we identify situations, such as the full measurement case, where the analysis problem can be solved efficiently. In such cases, we show indeed that the problem can be cast as a generalization of the minimum cut problem involving nodes with possibly nonzero costs. We further show that it can be reformulated as a standard minimum cut problem (without node costs) on a modified graph of proportional size. An important consequence of this result is that our approach provides the first exact efficient algorithm for the vulnerability analysis problem under the full measurement assumption. Furthermore, our approach also provides an efficient heuristic algorithm for the general NP-hard problem. Our results are illustrated by numerical studies on benchmark systems including the IEEE 118-bus system.},

year={2014},

keywords={Mathematical programming; network theory (graph); power system security; SCADA systems; smart grids},

}

** RefWorks **

RT Journal Article

SR Electronic

ID 192521

A1 Hendrickx, Julien

A1 Johansson, Karl Henrik

A1 Jungers, Raphael

A1 Sandberg, Henrik

A1 Sou, Kin Cheong

T1 Efficient Computations of a Security Index for False Data Attacks in Power Networks

YR 2014

JF IEEE Transactions on Automatic Control

SN 0018-9286

VO 59

IS 12

SP 3194

OP 3208

AB The resilience of Supervisory Control and Data Acquisition (SCADA) systems for electric power networks for certain cyber-attacks is considered. We analyze the vulnerability of the measurement system to false data attack on communicated measurements. The vulnerability analysis problem is shown to be NP-hard, meaning that unless $P = NP$ there is no polynomial time algorithm to analyze the vulnerability of the system. Nevertheless, we identify situations, such as the full measurement case, where the analysis problem can be solved efficiently. In such cases, we show indeed that the problem can be cast as a generalization of the minimum cut problem involving nodes with possibly nonzero costs. We further show that it can be reformulated as a standard minimum cut problem (without node costs) on a modified graph of proportional size. An important consequence of this result is that our approach provides the first exact efficient algorithm for the vulnerability analysis problem under the full measurement assumption. Furthermore, our approach also provides an efficient heuristic algorithm for the general NP-hard problem. Our results are illustrated by numerical studies on benchmark systems including the IEEE 118-bus system.

LA eng

DO 10.1109/TAC.2014.2351625

LK http://dx.doi.org/10.1109/TAC.2014.2351625

OL 30