Fast Attack Detection for Cyber–Physical Systems Using Dynamic Data Encryption
Bibliographic record
Abstract
To defend the cyber–physical system (CPSs) from cyber-attacks, this work proposes an unified intrusion detection mechanism which is capable to fast hunt various types of attacks. Focusing on securing the data transmission, a novel dynamic data encryption scheme is developed and historical system data is used to dynamically update a secret key involved in the encryption. The core idea of the dynamic data encryption scheme is to establish a dynamic relationship between original data, secret key, ciphertext and its decrypted value, and in particular, this dynamic relationship will be destroyed once an attack occurs, which can be used to detect attacks. Then, based on dynamic data encryption, a unified fast attack detection method is proposed to detect different attacks, including replay, false data injection (FDI), zero-dynamics, and setpoint attacks. Extensive comparison studies are conducted by using the power system and flight control system. It is verified that the proposed method can immediately trigger the alarm as soon as attacks are launched while the conventional <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\chi^{2}$</tex-math> </inline-formula> detection could only capture the attacks after the estimation residual goes over the predetermined threshold. Furthermore, the proposed method does not degrade the system performance. Last but not the least, the proposed dynamic encryption scheme turns to normal operation mode as the attacks stop.
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 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.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 teacher head, 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".