Physical Layer Secure Information Exchange Protocol for MIMO Ad Hoc Networks against Passive Attacks
Bibliographic record
Abstract
In this paper, we propose a secure transmission protocol for two users exchanging their respective information in an n-hop MIMO Ad hoc network. By exploiting the properties of the transmission medium in the physical layer, three channel models are utilized to provide secure transmission, namely one-way relay channel, two-way untrusted relay channel, and multiple access channel. Using these channel models, we design a basic protocol with a minimized time slot cost, i.e. n+1. Based on this basic protocol, we show that the attacker, either untrusted relay or external eavesdropper, can only obtain a summed signal in each time slot, and this summed signal cannot be decomposed to recover the individual information from the users. We then present cryptographic analysis for the first time to identify a weakness which is common for all known security schemes based on the summed signal. Thirdly, we introduce an evolutionary protocol proposed with two rounds of interlaced information exchange, which defeats this weakness. Finally, the simulation is performed to demonstrate the theoretical analysis.
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 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".