MétaCan
Menu
Back to cohort

Robust Deep Learning-Based Secret Key Generation in Dynamic LiFi Networks Against Concept Drift

2024· article· en· W4392932250 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
Typearticle
Languageen
FieldComputer Science
TopicChaos-based Image/Signal Encryption
Canadian institutionsWestern University
FundersNational Science Foundation
KeywordsComputer scienceKey (lock)Deep learningArtificial intelligenceComputer security

Abstract

fetched live from OpenAlex

This paper explores secret key generation in 5G and beyond LiFi networks using visible light in the downlink and infrared in the uplink. Unlike the existing works, we focus on a realistic indoor environment with multi-user mobility. Given inaccuracies in high-frequency channel models, we introduce the first deep learning model that combines the channel probing and quantization phases to generate initial secret keys with a minimal key disagreement rate (KDR) of 16% between the uplink and downlink, leading to a key generation rate (KGR) of 79 bits/s after information reconciliation. We show that LiFi channel statistics suffer from concept drifts with user density changes in the room. This increases the KDR by 28% - 44% and the generated keys fail to pass the NIST randomness tests. As a countermeasure, we introduce a voting ensemble model that mitigates concept drifts, maintaining a stable 16% KDR, 79 bits/s KGR, and passing NIST tests, despite the varying user densities.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.964
Threshold uncertainty score0.884

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0000.000
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.014
GPT teacher head0.228
Teacher spread0.214 · 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

Quick stats

Citations4
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicChaos-based Image/Signal EncryptionFrench-language works237,207