Authenticated Secure Quantum-Based Communication Scheme in Internet-of-Drones Deployment
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
The rapid advance of manufacturing Unmanned Aerial Vehicles (UAVs, aka drones) has led to a rise in the use of their civilian and commercial applications. The access of these drones to controlled airspace can be efficiently coordinated through particular layered network architecture, often referred to as the Internet-of-Drones (IoD). The nature of IoD, which is deployed in an open-access environment, brings significant safety and security concerns. Classical cryptosystems such as elliptic curve cryptography, Rivest-Shamir-Adleman, and Diffie-Hellman are essential building blocks to secure communication in the IoD. However, with the rapid development of quantum computing, it will be easy to break public-key cryptosystems using efficient quantum algorithms like Shor’s algorithm. Thus, building quantum-safe solutions to enhance IoD security has become imperative. Fortunately, quantum technologies can provide unconditional security solutions to protect data and communications in the IoD environment. This paper proposes a quantum-based scheme to prevent unauthorized drones from accessing a specific flight zone and authenticates the identities and shared secret messages of involved entities. To do so, we used a quantum channel to encode the private information based on a pre-shared key and a random key generated in session. The involved entities also perform mutual authentication and share a secret key. We also provide the security proofs and analysis of the proposed scheme that indicates its resistance to well-known attacks.
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.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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 0.001 |
| 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 it