Elimination of Undetectable Attacks on Natural Gas Networks
Bibliographic record
Abstract
Natural gas pipeline system operations rely heavily on Supervisory Control and Data Acquisition (SCADA) systems. While the SCADA systems introduce many advantages, they also introduce more vulnerabilities by providing opportunities for malicious cyber-attackers. If the cyber-attacks properly modify pressures, flows, and the topology the operator believes is present simultaneously, the cyber-attacks can be undetectable. While this topic has received attention for electrical grids, other cyber-physical systems have seen much less study on this topic. Natural gas networks are employed extensively to power generators in the electrical grid, so attacks on natural gas networks are very important. We have not seen any research on this topic for natural gas networks yet. The particular nonlinear equations which model natural gas networks make the analysis much more difficult. In this paper, we study undetectable attacks on natural gas networks in a signal processing perspective by describing the steady-state mathematical model and sensor measurements. We propose a countermeasure to eliminate undetectable attacks by protecting sensors in specific locations. We present an example that describes how an operator can be misled if the proposed countermeasure is not applied. In such cases, the operator could apply inappropriate control which could damage the system or cause a loss of critical gas supply to customers.
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.002 |
| 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".