文献类型：期刊文献

英文题名：Stealthy Hacking and Secrecy of Controlled State Estimation Systems With Random Dropouts

作者：Lu, Jingyi[1];Quevedo, Daniel E. E.[2];Gupta, Vijay[3];Dey, Subhrakanti[4]

机构：[1]East China Univ Sci & Technol, Key Lab Smart Mfg Energy Chem Proc, Minist Educ, Shanghai 200237, Peoples R China;[2]Queensland Univ Technol QUT, Sch Elect Engn & Robot, Brisbane, Qld 4000, Australia;[3]Univ Notre Dame, Dept Elect Engn, Notre Dame, IN 46556 USA;[4]Maynooth Univ, Hamilton Inst, Maynooth W23F2K8, Kildare, Ireland

年份：2023

卷号：68

期号：1

起止页码：31

外文期刊名：IEEE TRANSACTIONS ON AUTOMATIC CONTROL

收录：;EI(收录号：20215011321529);WOS:【SCI-EXPANDED(收录号:WOS:000921346300004)】；

基金：The work of Jingyi Lu was supported by the German Research Foundation (DFG) under Grant 392194080.

语种：英文

外文关键词：Bilevel programming; constrained Markov decision process; remote state estimation; stealthy attack; system security and privacy

摘要：We study the maximum information gain that an adversary may obtain through hacking without being detected. Consider a dynamical process observed by a sensor that transmits a local estimate of the system state to a remote estimator according to some reference transmission policy across a packet-dropping wireless channel equipped with acknowledgments (ACK). An adversary overhears the transmissions and proactively hijacks the sensor to reprogram its transmission policy. We define perfect secrecy as keeping the averaged expected error covariance bounded at the legitimate estimator and unbounded at the adversary. By analyzing the stationary distribution of the expected error covariance, we show that perfect secrecy can be attained for unstable systems only if the ACK channel has no packet dropouts. In other situations, we prove that independent of the reference policy and the detection methods, perfect secrecy is not attainable. For this scenario, we devise a Stackelberg game to derive the optimal defensive reference policy for the legitimate estimator and present a branch-and-bound algorithm with global optimality to solve the proposed game.