Security Establishment in ADS-B by Format-Preserving Encryption and Blockchain Schemes
Bibliographic record
Abstract
In the next generation modernization plan, the automatic dependent surveillance-broadcast (ADS-B) system plays a pivotal role. However, the ADS-B’s low level of security and its vulnerabilities have raised valid concerns. The main objectives of this paper are to highlight the limitations of legacy ADS-B systems and to assess the feasibility of using Format-preserving (F), Feistel-based encryption (F), with multiple implementation variances (X) (FFX) algorithms, for enhancing ADS-B’s security. The offered solution is implemented in a standard software-defined radio (SDR) ADS-B to be utilized in real-time applications. Furthermore, a new proposed blockchain scheme is used as a secured database to manage the cipher key. The metric of message entropy is used to assess an algorithm’s ability to confuse and diffuse predictable ADS-B messages; correlation and serial correlation of plain data and cipher data are deployed to evaluate the proposed method’s security level. The authors provide both MATLAB simulations and flight test outcomes to demonstrate the feasibility of this approach. Based on our security analysis, ADS-B information can be kept confidential through our scheme. The performance evaluation results reveal that the proposed scheme is achievable, compatible, and efficient for the avionics industry.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".