Leveraging Convex Relaxation to Identify the Feasibility of Conducting AC False Data Injection Attack in Power Systems
FDI (False Data Injection) attacks are critical to address as they can compromise the integrity and reliability of data in cyber-physical systems, leading to potentially severe consequences in sectors such as power systems. The feasibility of FDI attacks has been extensively studied from various perspectives, including access to measurements and sensors, knowledge of the system, and design considerations using residual-based detection methods. Most research has focused on DC-based FDI attacks; however, designing AC FDI attacks involves solving a nonlinear optimization problem, presenting additional challenges in assessing their feasibility. Specifically, it is often unclear whether the infeasibility of some designed AC FDI attacks is due to the nonconvexity and nonlinearity inherent to AC power flows or if it stems from inherent infeasibility in specific cases, with local solvers returning infeasibility. This paper addresses this issue by leveraging the principle that if a convexified AC FDI attack design problem is infeasible, the attack design itself is infeasible, irrespective of nonlinear solution challenges. We propose an AC FDI attack design based on convexified power flow equations and assess the feasibility of the proposed attack by examining the extent of the attackable region. This approach utilizes a Quadratic Convex (QC) relaxation technique to convexify AC power flows. To evaluate the proposed method, we implement it on the IEEE 118-bus test system and assess the feasibility of an AC FDI attack across various attack zones.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Safe Screening for Unbalanced Optimal Transport
This paper introduces a framework that utilizes the Safe Screening technique to accelerate the optimization process of the Unbalanced Optimal Transport (UOT) problem by proactively identifying and eliminating zero elemen…
Interior-Point Vanishing Problem in Semidefinite Relaxations for Neural Network Verification
Semidefinite programming (SDP) relaxation has emerged as a promising approach for neural network verification, offering tighter bounds than other convex relaxation methods for deep neural networks (DNNs) with ReLU activa…
Convex Relaxations of Convolutional Neural Nets
We propose convex relaxations for convolutional neural nets with one hidden layer where the output weights are fixed. For convex activation functions such as rectified linear units, the relaxations are convex second orde…
Detection and Mitigation of Position Spoofing Attacks on Cooperative UAV Swarm Formations
Detecting spoofing attacks on the positions of unmanned aerial vehicles (UAVs) within a swarm is challenging. Traditional methods relying solely on individually reported positions and pairwise distance measurements are i…
PositionOn Quadratic Convergence of DC Proximal Newton Algorithm in Nonconvex Sparse Learning
We propose a DC proximal Newton algorithm for solving nonconvex regularized sparse learning problems in high dimensions. Our proposed algorithm integrates the proximal newton algorithm with multi-stage convex relaxation …
Sparse Learning