Cyber Attack-Aware Security Hardening of Time Synchronization Technologies in WAMPAC Systems
Bibliographic record
Abstract
Synchrophasor-based wide-area monitoring, protection, and control (WAMPAC) applications have been recently prevalent in modern power systems to counteract system-wide operational concerns. However, the functionality of the WAMPAC application is significantly contingent on the precision and integrity of time-synchronization mechanisms which are vulnerable to time-synchronization attacks (TSAs). To counter TSAs targeting WAMPAC applications, this paper proposes a preventive countermeasure by attack-aware security hardening of time synchronization technologies (TSTs) in substations houses critical phasor measurement units (PMUs). The attack-aware security hardening problem is formulated as a bi-level operator-attack model. This model aims to minimize post-TSA error of the PMU-based AC state estimation (ACSE), a critical module for a majority of WAMPAC applications, by optimal allocating a set of security hardening respecting the limited operator budget. The operator layer obtains security hardening strategy and under-TSA system states while the attacker layer optimizes attack vector and manipulated phasor measurements. Using the Karush-Kuhn-Tucker (KKT) approach, the developed model is recast to a single-level quadratic mixed-integer linear problem tackle-able using mathematical solvers. The numerical results on the IEEE 39-Bus test system demonstrate that the proposed preventive countermeasure can significantly reduce the attacker’s ability to maliciously impact ACSE module.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".