A Cross-Layer Defense Method for Blockchain Empowered CBTC Systems Against Data Tampering Attacks
Bibliographic record
Abstract
Due to the high integration of wireless communication and networking technologies, the communication-based train control (CBTC) systems are exposed to additional cyber-attack surfaces, allowing sophisticated attackers to combine cyber attack vectors with physical attack means to achieve malicious goals. Notably, the decentralized authentication features are missing in existing communication protocols which make the CBTC be easily compromised by data tampering attacks, and lead to serious operational accidents. With outstanding advantages in decentralized authentication, blockchain provides new effective solutions for decentralized identity authentication in CBTC. Consequently, it is critical to study the complex physical consequences of cyber breaches from a cross-layer defense perspective. In this paper, we propose a novel cross-layer defense method for cyber security in blockchain empowered CBTC against data tampering attacks. In the physical layer, the joint Kalman filter and <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> detector is proposed for the train state estimation and detection. In the cyber layer, an asymmetric encryption-based secure communication protocol with identity authentication and the blockchain-based distributed key management system with the adaptive consensus mechanism are designed for data communication security. Considering the unavailable direct observation of the CBTC cyber security states, a partially observable Markov (POMDP) decision model is constructed to derive the optimal adaptive consensus strategies for balancing cyber security and efficiency. Extensive simulation results show that the proposed blockchain empowered CBTC cross-layer defense method can effectively improve the cyber security protection capability and minimize the impact of data tampering attacks on the train operation.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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 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".