Keys through ARQ
Mohamed Abdel Latif, Ahmed Sultan, and Hesham El Gamal

TL;DR
This paper introduces a new key sharing protocol using ARQ feedback that enhances secrecy rates without prior channel knowledge, leveraging channel correlations and adaptive strategies to mitigate secrecy outages.
Contribution
The paper presents a novel ARQ-based key sharing scheme that exploits opportunistic secrecy gains and channel correlations, with explicit implementations and theoretical analysis.
Findings
Achieves non-zero secrecy rates even when eavesdropper's channel is better on average.
Utilizes channel temporal correlation for higher secrecy rates.
Mitigates secrecy outage phenomena observed in previous schemes.
Abstract
This paper develops a novel framework for sharing secret keys using the well-known Automatic Repeat reQuest (ARQ) protocol. The proposed key sharing protocol does not assume any prior knowledge about the channel state information (CSI), but, harnesses the available opportunistic secrecy gains using only the one bit feedback, in the form of ACK/NACK. The distribution of key bits among multiple ARQ epochs, in our approach, allows for mitigating the secrecy outage phenomenon observed in earlier works. We characterize the information theoretic limits of the proposed scheme, under different assumptions on the channel spatial and temporal correlation function, and develop low complexity explicit implementations. Our analysis reveals a novel role of "dumb antennas" in overcoming the negative impact of spatial correlation, between the legitimate and eavesdropper channels, on the achievable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLibrary Science and Information Systems
