Optimal Linear Encryption Against Stealthy Attacks on Remote State Estimation
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
Defending against malicious attacks has become increasingly important in various cyber-physical systems. This article presents an encryption-based countermeasure against stealthy attacks on remote state estimation. Smart sensors transmit data to a remote estimator through a wireless communication network, in which data packets can be intercepted and compromised by attackers. The remote end is equipped with a false data detector that monitors the system. To avoid being detected, the attack should follow the stealthiness constraint. A linear encryption scheme is proposed to reduce the influence of potential stealthy attacks. For arbitrary linear encryption, the worst-case linear attack that yields the largest estimation error is derived. Accordingly, the optimal linear encryption, which minimizes the worst-case estimation error, is designed based on the Stackelberg game analysis. The above optimal strategies are considered in both the complete and partial measurement information scenarios for the attacker. Moreover, the generalization to nonlinear encryption strategies is also discussed. Comparisons of attack and encryption strategies through numerical examples are provided to illustrate 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.000 | 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.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
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