On secret key generation from multiple observations of wireless channels
Bibliographic record
Abstract
Secret key generation at physical layer has attracted more and more attentions as an emerging cryptography method. Compared to traditional security approaches, secret key generation at physical layer not only avoids the problem of key distribution, but also holds high efficiency and low complexity in application. Based on the principle of channel reciprocity, Alice and Bob both estimate the channel conditions and extract shared keys from this source of common randomness. In this paper, we first analyze the basic steps (channel estimation, sample quantization and key reconciliation) of secret key generation, key match rate with different quantization levels and key reconciliation times are also simulated. While in practical situations, different non-reciprocity factors affect the channel estimation step, key match rate can be greatly decreased and hardly meet real time cryptography requirements. In order to increase the key match rate, the unified framework of physical layer key generation has been extended to utilizing multiple observations of wireless channels to generate secret keys. An improved key generation approach with multiple observations can well deal with discrepancies between transceivers and keep increasing the key match rate. Theoretical analysis and simulation results both validate the significant improvement due to multiple observations. With an increased number of observations on both sides, the desired key match rate can be achieved much greater than with a single observation, and also the probability of key recovery by Eve can be decreased.
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.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 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.001 | 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 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".