Undetectable Finite-Time Covert Attack on Constrained Cyber-Physical Systems
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In the last few decades, several cyber-threats against cyber-physical systems (CPSs) have been reported. Of particular interest are the classes of network attacks capable of affecting the control systems’ performance while remaining undetectable. In this article, under some conditions, we show the existence of a novel class of finite-time undetectable attacks against constrained CPSs. The proposed finite-time attack has the peculiar capability of not producing anomalies after its termination. This is particularly dangerous because it enables a malicious entity to repeatedly or intermittently affect the CPS without raising alarms. Such an attack is here designed by resorting to a set-theoretic approach that leverages robust reachability arguments. Moreover, given the desired attack duration, the set of initial states from which the attack is feasible is characterized. A numerical simulation example involving an industrial continuous-stirred tank reactor system is presented to support the theoretical results.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it