### Abstract

The security index problem for false data injection attacks on power systems is considered. In particular, the problem is to find the minimum cost set of bus injection meters and line flow meters that an attacker can seize so as to execute a false data injection. A polynomial-time algorithm is provided to solve this problem in certain settings, based on the principle of max-flow min-cut. The security index problem is shown to be equivalent to a min-cut problem, and that this problem can be solved using a generalization of the classic max-flow min-cut algorithm in which flows are successively augmented until doing so is no longer possible.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop |

Publisher | IEEE Computer Society |

Pages | 61-64 |

Number of pages | 4 |

ISBN (Print) | 9781479914814 |

DOIs | |

State | Published - 2014 |

Event | 2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014 - A Coruna, Spain Duration: Jun 22 2014 → Jun 25 2014 |

### Other

Other | 2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014 |
---|---|

Country | Spain |

City | A Coruna |

Period | 6/22/14 → 6/25/14 |

### Fingerprint

### ASJC Scopus subject areas

- Signal Processing
- Control and Systems Engineering
- Electrical and Electronic Engineering

### Cite this

*Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop*(pp. 61-64). [6882338] IEEE Computer Society. https://doi.org/10.1109/SAM.2014.6882338

**Max-flow min-cut for power system security index computation.** / Kosut, Oliver.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop.*, 6882338, IEEE Computer Society, pp. 61-64, 2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014, A Coruna, Spain, 6/22/14. https://doi.org/10.1109/SAM.2014.6882338

}

TY - GEN

T1 - Max-flow min-cut for power system security index computation

AU - Kosut, Oliver

PY - 2014

Y1 - 2014

N2 - The security index problem for false data injection attacks on power systems is considered. In particular, the problem is to find the minimum cost set of bus injection meters and line flow meters that an attacker can seize so as to execute a false data injection. A polynomial-time algorithm is provided to solve this problem in certain settings, based on the principle of max-flow min-cut. The security index problem is shown to be equivalent to a min-cut problem, and that this problem can be solved using a generalization of the classic max-flow min-cut algorithm in which flows are successively augmented until doing so is no longer possible.

AB - The security index problem for false data injection attacks on power systems is considered. In particular, the problem is to find the minimum cost set of bus injection meters and line flow meters that an attacker can seize so as to execute a false data injection. A polynomial-time algorithm is provided to solve this problem in certain settings, based on the principle of max-flow min-cut. The security index problem is shown to be equivalent to a min-cut problem, and that this problem can be solved using a generalization of the classic max-flow min-cut algorithm in which flows are successively augmented until doing so is no longer possible.

UR - http://www.scopus.com/inward/record.url?scp=84907383953&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84907383953&partnerID=8YFLogxK

U2 - 10.1109/SAM.2014.6882338

DO - 10.1109/SAM.2014.6882338

M3 - Conference contribution

AN - SCOPUS:84907383953

SN - 9781479914814

SP - 61

EP - 64

BT - Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop

PB - IEEE Computer Society

ER -