arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.00065eess.SYcs.SY
收藏

稀疏约束下的隐形数据注入攻击

Stealth Data Injection Attacks with Sparsity Constraints

Xiuzhen Ye, Iñaki Esnaola, Samir M. Perlaza, Robert F. Harrison

摘要:

稀疏隐形攻击的结构,最大限度地减少状态变量和观测值之间的互信息。攻击构造被公式化为多变量高斯分布的设计,该多变量高斯分布的目的是最小化互信息,同时限制受攻击的观测值的分布与未受攻击的观测值的分布之间的Kullback-Leibler发散。稀疏性约束作为攻击分布的支持度约束。提出了两种启发式贪婪攻击构造算法。第一个算法假设攻击向量由独立的条目组成,因此,不需要不同的攻击位置之间的通信。第二种算法考虑了攻击向量条目之间的相关性,从而以不同位置之间的协调为代价获得更好的攻击性能。我们在IEEE测试系统上数值评估了所提出的攻击结构的性能,并表明构建隐形攻击是可行的,该攻击可以在少量受损传感器的情况下产生显著的中断。

英文摘要:

Sparse stealth attack constructions that minimize the mutual information between the state variables and the observations are proposed. The attack construction is formulated as the design of a multivariate Gaussian distribution that aims to minimize the mutual information while limiting the Kullback-Leibler divergence between the distribution of the observations under attack and the distribution of the observations without attack. The sparsity constraint is incorporated as a support constraint of the attack distribution. Two heuristic greedy algorithms for the attack construction are proposed. The first algorithm assumes that the attack vector consists of independent entries, and therefore, requires no communication between different attacked locations. The second algorithm considers correlation between the attack vector entries which results in better attack performance at the expense of coordination between different locations. We numerically evaluate the performance of the proposed attack constructions on IEEE test systems and show that it is feasible to construct stealth attacks that generate significant disruption with a low number of compromised sensors.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑