Finding the Worse Case: Undetectable False Data Injection with Minimized Knowledge and Resource
Bibliographic record
Abstract
Accurate state estimation is crucial to smart grid operations. Following the identification of false data injection attacks (FDIA), numerous research has been proposed, yet most of them assume the worst-case scenario where attackers face few constraints on the full knowledge of the system topology or on the attack resource they can leverage to compromise the meters. In this work, we formulate attacker's knowledge and resource as two critical constraints and propose an FDIA model that generates the attack vector with no prior knowledge of the grid topology and minimal access to the measurements. The work adopts the existing solution based on principal component analysis (PCA) to generate the stealth attack vector and leverages particle swarm optimization (PSO) to directly minimize the ℓ0-norm of the attack vector. Considering the feasibility of practical attacks, our work also enforces constraints on the convergence of state estimation and the significance of induced error, so that the generated attack vector is guaranteed undetectable yet impactful. Simulation results on the IEEE 30bus system have demonstrated the minimized sparsity with topology-blindness, attack-stealthiness, and significant impact on the state variables of the proposed FDIA scheme, which will help refine the risk evaluation and inform better mitigation efforts against such threats.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".