Stealth Attacks on the Smart Grid

08/13/2018
by   Ke Sun, et al.
0

Random attacks that jointly minimize the amount of information acquired by the operator about the state of the grid and the probability of attack detection are presented. The attacks minimize the information acquired by the operator by minimizing the mutual information between the observations and the state variables describing the grid. Simultaneously, the attacker aims to minimize the probability of attack detection by minimizing the Kullback-Leibler (KL) divergence between the distribution when the attack is present and the distribution under normal operation. The resulting cost function is the weighted sum of the mutual information and the KL divergence mentioned above. The tradeoff between the probability of attack detection and the reduction of mutual information is governed by the weighting parameter on the KL divergence term in the cost function. The probability of attack detection is evaluated as a function of the weighting parameter. A sufficient condition on the weighting parameter is given for achieving an arbitrarily small probability of attack detection. The attack performance is numerically assessed on the IEEE 30-Bus and 118-Bus test systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2021

Asymptotic Learning Requirements for Stealth Attacks

Information-theoretic stealth attacks are data injection attacks that mi...
research
09/26/2014

Generalized Twin Gaussian Processes using Sharma-Mittal Divergence

There has been a growing interest in mutual information measures due to ...
research
05/02/2019

Estimating Kullback-Leibler Divergence Using Kernel Machines

Recently, a method called the Mutual Information Neural Estimator (MINE)...
research
03/06/2018

Deep Information Networks

We describe a novel classifier with a tree structure, designed using inf...
research
09/27/2016

Task Specific Adversarial Cost Function

The cost function used to train a generative model should fit the purpos...
research
03/15/2012

Inference by Minimizing Size, Divergence, or their Sum

We speed up marginal inference by ignoring factors that do not significa...
research
07/02/2021

Minimizing couplings in renormalization by preserving short-range mutual information

The connections between renormalization in statistical mechanics and inf...

Please sign up or login with your details

Forgot password? Click here to reset