Jamming Aided Generalized Data Attacks: Exposing Vulnerabilities in Secure Estimation

Jamming refers to the deletion, corruption or damage of meter measurements that prevents their further usage. This is distinct from adversarial data injection that changes meter readings while preserving their utility in state estimation. This paper presents a generalized attack regime that uses jamming of secure and insecure measurements to greatly expand the scope of common 'hidden' and 'detectable' data injection attacks in literature. For 'hidden' attacks, it is shown that with jamming, the optimal attack is given by the minimum feasible cut in a specific weighted graph. More importantly, for 'detectable' data attacks, this paper shows that the entire range of relative costs for adversarial jamming and data injection can be divided into three separate regions, with distinct graph-cut based constructions for the optimal attack. Approximate algorithms for attack design are developed and their performances are demonstrated by simulations on IEEE test cases. Further, it is proved that prevention of such attacks require security of all grid measurements. This work comprehensively quantifies the dual adversarial benefits of jamming: (a) reduced attack cost and (b) increased resilience to secure measurements, that strengthen the potency of data attacks.

[1]  Sriram Vishwanath,et al.  Attacking power grids with secure meters: The case for breakers and Jammers , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[2]  Peng Ning,et al.  False data injection attacks against state estimation in electric power grids , 2009, CCS.

[3]  Bruno Sinopoli,et al.  False Data Injection Attacks in Electricity Markets , 2010, 2010 First IEEE International Conference on Smart Grid Communications.

[4]  Lang Tong,et al.  Limiting false data attacks on power system state estimation , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[5]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[6]  Sriram Vishwanath,et al.  Data attack on strategic buses in the power grid: Design and protection , 2014, 2014 IEEE PES General Meeting | Conference & Exposition.

[7]  A. G. Expósito,et al.  Power system state estimation : theory and implementation , 2004 .

[8]  A. Monticelli State estimation in electric power systems : a generalized approach , 1999 .

[9]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[10]  Stephen P. Boyd Convex optimization: from embedded real-time to large-scale distributed , 2011, KDD.

[11]  H. Vincent Poor,et al.  Strategic Protection Against Data Injection Attacks on Power Grids , 2011, IEEE Transactions on Smart Grid.

[12]  Henrik Sandberg,et al.  Network-Aware Mitigation of Data Integrity Attacks on Power System State Estimation , 2012, IEEE Journal on Selected Areas in Communications.

[13]  Peter Xiaoping Liu,et al.  Denial-of-Service (dos) attacks on load frequency control in smart grids , 2013, 2013 IEEE PES Innovative Smart Grid Technologies Conference (ISGT).

[14]  Sriram Vishwanath,et al.  One breaker is enough: Hidden topology attacks on power grids , 2015, 2015 IEEE Power & Energy Society General Meeting.

[15]  Florian Dörfler,et al.  Attack Detection and Identification in Cyber-Physical Systems -- Part II: Centralized and Distributed Monitor Design , 2012, ArXiv.

[16]  Lang Tong,et al.  Data framing attack on state estimation with unknown network parameters , 2013, 2013 Asilomar Conference on Signals, Systems and Computers.

[17]  A.G. Phadke,et al.  Synchronized phasor measurements in power systems , 1993, IEEE Computer Applications in Power.

[18]  Sriram Vishwanath,et al.  Optimal data attacks on power grids: Leveraging detection & measurement jamming , 2015, 2015 IEEE International Conference on Smart Grid Communications (SmartGridComm).

[19]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[20]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Sriram Vishwanath,et al.  Optimal hidden SCADA attacks on power grid: A graph theoretic approach , 2014, 2014 International Conference on Computing, Networking and Communications (ICNC).