Information Theoretic Data Injection Attacks with Sparsity Constraints
원문 초록
Information theoretic sparse attacks that minimize simultaneously the information obtained by the operator and the probability of detection are studied in a Bayesian state estimation setting. The attack construction is formulated as an optimization problem that aims to minimize the mutual information between the state variables and the observations while guaranteeing the stealth of the attack. Stealth is described in terms of the Kullback-Leibler (KL) divergence between the distributions of the observations under attack and without attack. To overcome the difficulty posed by the combinatorial nature of a sparse attack construction, the attack case in which only one sensor is compromised is analytically solved first. The insight generated in this case is then used to propose a greedy algorithm that constructs random sparse attacks. The performance of the proposed attack is evaluated in the IEEE 30 Bus Test Case.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
From Models To Experiments: Shallow Recurrent Decoder Networks on the DYNASTY Experimental Facility
Recursive KalmanNet: Deep Learning-Augmented Kalman Filtering for State Estimation with Consistent Uncertainty Quantification
Benchmarking Spatiotemporal Reasoning in LLMs and Reasoning Models: Capabilities and Challenges
UMotion: Uncertainty-driven Human Motion Estimation from Inertial and Ultra-wideband Units
Contrastive Cross-Course Knowledge Tracing via Concept Graph Guided Knowledge Transfer
Secure Safety Filter Design for Sampled-data Nonlinear Systems under Sensor Spoofing Attacks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.