Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1005.5063 · IEEE Transactions on Information Forensics and Security

Keys Through ARQ: Theory and Practice

Yara Abdallah, Mohamed Abdel Latif, Moustafa A. Youssef, Ahmed Sultan, Hesham El Gamal

Published Mar 7, 2011• 46 citations
arXivHTMLPDF

Abstract

This paper develops a novel framework for sharing secret keys using the Automatic Repeat reQuest (ARQ) protocol. We first characterize the underlying information theoretic limits, under different assumptions on the channel spatial and temporal correlation function. Our analysis reveals a novel role of “dumb antennas” in overcoming the negative impact of spatial correlation on the achievable secrecy rates. We further develop an adaptive rate allocation policy, which achieves higher secrecy rates in temporally correlated channels, and explicit constructions for ARQ secrecy coding that enjoy low implementation complexity. Building on this theoretical foundation, we propose a unified framework for ARQ-based secrecy in Wi-Fi networks. By exploiting the existing ARQ mechanism in the IEEE 802.11 standard, we develop security overlays that offer strong security guarantees at the expense of only minor modifications in the medium access layer. Our numerical results establish the achievability of nonzero secrecy rates even when the eavesdropper channel is less noisy, on the average, than the legitimate channel, while our Linux-based prototype demonstrates the efficiency of our ARQ overlays in mitigating all known, passive and active, Wi-Fi attacks at the expense of a minimal increase in the link setup time and a small loss in throughput.

DOI
10.1109/tifs.2011.2123093

Related papers

Keys through ARQ

Mohamed Abdel Latif, Ahmed Sultan, Hesham El Gamal

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 secrecy rates. We further develop an adaptive rate allocation policy which achieves higher secrecy rates by exploiting the channel temporal correlation. Finally, our theoretical claims are validated by numerical results that establish the achievability of non-zero secrecy rates even when the eavesdropper channel is less noisy, on the average, than the legitimate channel.

arXiv:0908.0014•Aug 1, 2009•1 citation

ARQ-Based Secret Key Sharing

Ghany, Mohamed Abdel, Ahmed Sultan, Hesham El Gamal

This paper develops a novel framework for sharing secret keys using existing Automatic Repeat reQuest (ARQ) protocols. Our approach exploits the multi-path nature of the wireless environment to hide the key from passive eavesdroppers. The proposed framework does not assume the availability of any prior channel state information (CSI) and exploits only the one bit ACK/NACK feedback from the legitimate receiver. Compared with earlier approaches, the main innovation lies in the distribution of key bits among multiple ARQ frames. Interestingly, this idea allows for achieving a positive secrecy rate even when the eavesdropper experiences more favorable channel conditions, on average, than the legitimate receiver. In the sequel, we characterize the information theoretic limits of the proposed schemes, develop low complexity explicit implementations, and conclude with numerical results that validate our theoretical claims.

arXiv:0810.1319•Oct 7, 2008•2 citations

ARQ secrecy over correlated fading channels

Mohamed Abdel Latif, Ahmed Sultan, Hesham El Gamal

In this paper, we develop novel Automatic Repeat reQuest (ARQ) key sharing protocols for correlated fading channels. In particular, a novel role of “dumb antennas” in overcoming the negative impact of spatial correlation, on the achievable secrecy rates, is unveiled. We further develop an adaptive rate allocation policy which achieves higher secrecy rates by exploiting the channel temporal correlation. The performance gains offered by the proposed schemes are demonstrated by a comprehensive set of numerical results.

IEEE Information Theory Workshop (ITW)•Jan 1, 2010•4 citations

ARQ-Based Secret Key Sharing

M. Abdel Latif, Ahmed Sultan, H. El Gamal

This paper develops a novel framework for sharing secret keys using existing automatic repeat request (ARQ) protocols. Our approach exploits the multi-path nature of the wireless environment to hide the key from passive eavesdroppers. The proposed framework does not assume the availability of any prior channel state information (CSI) and exploits only the one bit ACK/NACK feedback from the legitimate receiver. Compared with earlier approaches, the main innovation lies in the distribution of key bits among multiple ARQ frames. Interestingly, this idea allows for achieving a positive secrecy rate even when the eavesdropper experiences more favorable channel conditions, on average, than the legitimate receiver. In the sequel, we characterize the information theoretic limits of the proposed schemes, develop low complexity explicit implementations, and conclude with numerical results that validate our theoretical claims.

International Conference on Communications•Jun 1, 2009•19 citations

ARQ-Based Symmetric-Key Generation Over Correlated Erasure Channels

Yahya S. Khiabani, Shuangqing Wei

This paper focuses on the problem of sharing secret keys using Automatic Repeat reQuest (ARQ) protocol. We consider cases where forward and feedback channels are erasure channels for a legitimate receiver (Bob) and an eavesdropper (Eve). In prior works, the wiretap channel is modeled as statistically independent packet erasure channels for Bob and Eve. In this paper, we go beyond the state-of-the-art by addressing correlated erasure events across the wiretap channel. The created randomness is shared between two legitimate parties through ARQ transmissions that is mapped into a destination set using a first-order digital filter with feedback. Then, we characterize Eve's information loss about this shared destination set, due to inevitable transmission errors. This set is then transformed into a highly secure key using privacy amplification in order to intensify and exploit Eve's lack of knowledge. We adopt two criteria for analysis and design of the system: secrecy outage probability as a measure of the secrecy quality, and secret key rate as a metric for efficiency. The resulting secrecy improvement is presented as a function of the correlation coefficients and the erasure probabilities for both channels. It is shown that secrecy improvement is achievable even when Eve has a better channel than legitimate receivers, and her channel conditions are unknown to legitimate users.

IEEE Transactions on Information Forensics and Security•May 21, 2013•5 citations

ARQ-based key scheduling algorithm over correlated erasure channels

Yahya S. Khiabani, Shuangqing Wei

This paper focuses on the problem of sharing secret keys using the Automatic Repeat reQuest (ARQ) protocol. We first model the forward and feedback channels as erasure channels for both legitimate receiver (Bob) and an eavesdropper (Eve). In prior works, wiretap channel is modeled as statistically independent packet erasure channels for Bob and Eve. In this paper, we go beyond the state-of-the-art by addressing correlated erasure events across the wiretap channel. The created randomness is shared between two legitimate parties through ARQ transmission that will be mapped into a destination set using the first order digital filter with feedback. Then, we characterize Eve's information loss about this shared destination set, due to inevitable transmission errors that will be manipulated by privacy amplification to generate a series of secret keys about which Eve's knowledge remains negligible. We define two metrics to measure secrecy enhancement: outage probability and secret key rate. The resulting secrecy improvement is presented as a function of the correlation coefficients and the erasure probabilities for both channels. It is shown that secrecy improvement is achievable even when Eve has a better channel than the legitimate receiver, and her channel condition is unknown.

IEEE Military Communications Conference (MILCOM)•Oct 1, 2012•1 citation
This paper develops a novel framework for sharing secret keys using the Automatic Repeat reQuest (ARQ) protocol. We first characterize the underlying information theoretic limits, under different assumptions on the channel spatial and temporal correlation function. Our analysis reveals a novel role of “dumb antennas” in overcoming the negative impact of spatial correlation on the achievable secrecy rates. We further develop an adaptive rate allocation policy, which achieves higher secrecy rates in temporally correlated channels, and explicit constructions for ARQ secrecy coding that enjoy low implementation complexity. Building on this theoretical foundation, we propose a unified framework for ARQ-based secrecy in Wi-Fi networks. By exploiting the existing ARQ mechanism in the IEEE 802.11 standard, we develop security overlays that offer strong security guarantees at the expense of only minor modifications in the medium access layer. Our numerical results establish the achievability of nonzero secrecy rates even when the eavesdropper channel is less noisy, on the average, than the legitimate channel, while our Linux-based prototype demonstrates the efficiency of our ARQ overlays in mitigating all known, passive and active, Wi-Fi attacks at the expense of a minimal increase in the link setup time and a small loss in throughput.
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 secrecy rates. We further develop an adaptive rate allocation policy which achieves higher secrecy rates by exploiting the channel temporal correlation. Finally, our theoretical claims are validated by numerical results that establish the achievability of non-zero secrecy rates even when the eavesdropper channel is less noisy, on the average, than the legitimate channel.
This paper develops a novel framework for sharing secret keys using existing Automatic Repeat reQuest (ARQ) protocols. Our approach exploits the multi-path nature of the wireless environment to hide the key from passive eavesdroppers. The proposed framework does not assume the availability of any prior channel state information (CSI) and exploits only the one bit ACK/NACK feedback from the legitimate receiver. Compared with earlier approaches, the main innovation lies in the distribution of key bits among multiple ARQ frames. Interestingly, this idea allows for achieving a positive secrecy rate even when the eavesdropper experiences more favorable channel conditions, on average, than the legitimate receiver. In the sequel, we characterize the information theoretic limits of the proposed schemes, develop low complexity explicit implementations, and conclude with numerical results that validate our theoretical claims.
In this paper, we develop novel Automatic Repeat reQuest (ARQ) key sharing protocols for correlated fading channels. In particular, a novel role of “dumb antennas” in overcoming the negative impact of spatial correlation, on the achievable secrecy rates, is unveiled. We further develop an adaptive rate allocation policy which achieves higher secrecy rates by exploiting the channel temporal correlation. The performance gains offered by the proposed schemes are demonstrated by a comprehensive set of numerical results.
This paper develops a novel framework for sharing secret keys using existing automatic repeat request (ARQ) protocols. Our approach exploits the multi-path nature of the wireless environment to hide the key from passive eavesdroppers. The proposed framework does not assume the availability of any prior channel state information (CSI) and exploits only the one bit ACK/NACK feedback from the legitimate receiver. Compared with earlier approaches, the main innovation lies in the distribution of key bits among multiple ARQ frames. Interestingly, this idea allows for achieving a positive secrecy rate even when the eavesdropper experiences more favorable channel conditions, on average, than the legitimate receiver. In the sequel, we characterize the information theoretic limits of the proposed schemes, develop low complexity explicit implementations, and conclude with numerical results that validate our theoretical claims.
This paper focuses on the problem of sharing secret keys using Automatic Repeat reQuest (ARQ) protocol. We consider cases where forward and feedback channels are erasure channels for a legitimate receiver (Bob) and an eavesdropper (Eve). In prior works, the wiretap channel is modeled as statistically independent packet erasure channels for Bob and Eve. In this paper, we go beyond the state-of-the-art by addressing correlated erasure events across the wiretap channel. The created randomness is shared between two legitimate parties through ARQ transmissions that is mapped into a destination set using a first-order digital filter with feedback. Then, we characterize Eve's information loss about this shared destination set, due to inevitable transmission errors. This set is then transformed into a highly secure key using privacy amplification in order to intensify and exploit Eve's lack of knowledge. We adopt two criteria for analysis and design of the system: secrecy outage probability as a measure of the secrecy quality, and secret key rate as a metric for efficiency. The resulting secrecy improvement is presented as a function of the correlation coefficients and the erasure probabilities for both channels. It is shown that secrecy improvement is achievable even when Eve has a better channel than legitimate receivers, and her channel conditions are unknown to legitimate users.
This paper focuses on the problem of sharing secret keys using the Automatic Repeat reQuest (ARQ) protocol. We first model the forward and feedback channels as erasure channels for both legitimate receiver (Bob) and an eavesdropper (Eve). In prior works, wiretap channel is modeled as statistically independent packet erasure channels for Bob and Eve. In this paper, we go beyond the state-of-the-art by addressing correlated erasure events across the wiretap channel. The created randomness is shared between two legitimate parties through ARQ transmission that will be mapped into a destination set using the first order digital filter with feedback. Then, we characterize Eve's information loss about this shared destination set, due to inevitable transmission errors that will be manipulated by privacy amplification to generate a series of secret keys about which Eve's knowledge remains negligible. We define two metrics to measure secrecy enhancement: outage probability and secret key rate. The resulting secrecy improvement is presented as a function of the correlation coefficients and the erasure probabilities for both channels. It is shown that secrecy improvement is achievable even when Eve has a better channel than the legitimate receiver, and her channel condition is unknown.