MétaCan
Menu
Back to cohort

Encryption-Key Hopping: An Anonymous and Dynamic Encryption-Key Generation and Sharing Model for 5G and 6G Networks Security

2024· preprint· en· W4404205014 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicAdvanced Authentication Protocols Security
Canadian institutionsCarleton University
Fundersnot available
KeywordsEncryptionKey (lock)Computer securityComputer scienceKey generationComputer network

Abstract

fetched live from OpenAlex

In cellular network technologies like 5G and 6G, achieving high data rates, exceptional reliability, and minimal latency is paramount. The continuous expansion of smart wireless technologies, sensors, and communication systems has led to an exponential increase in data traffic, which increases the demand for enhanced privacy and security solutions that are efficient and reliable as attackers get more aggressive. While numerous authentication and encryption methods have been proposed in the literature to safeguard communication, the landscape of threats and attacks continues to evolve, jeopardizing the security of network entities. In response to this evolving threat landscape, my research introduces an innovative solution to enhance security measures. My approach hinges on dynamic and unpredictable key generation and utilization, setting a new strategy for safeguarding against network breaches. Notably, this work marks the first instance of introducing this mechanism and concept (Key Hopping), promising a more resilient security paradigm. Simulation results demonstrate a high-security performance in most security aspects.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.802
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.034
GPT teacher head0.314
Teacher spread0.280 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it