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

Rate-adaptive Secure HARQ Protocol for Block-Fading Channels

Zeina Mheich, Florence Alberge, Maël Le Treust, Pierre Duhamel, Leszek Szczeciński

Published Sep 1, 2014• 12 citations
OpenAlex

Abstract

This paper analyzes the achievable secrecy throughput in incremental redundancy secure HARQ protocols for communication over block-fading wiretap channels (WTC). The transmitter has no instantaneous channel state information (CSI) but can receive an outdated version of CSI from both legitimate receiver and eavesdropper through reliable multibit feedback channels. Using outdated CSI, the transmitter can adapt the coding rates. Since the transmitter cannot adapt the coding rates to the instantaneous channel conditions, we consider the outage performance of secure HARQ protocols. We show how to find the optimal rate-adaptation policies to maximize the secrecy throughput under constraints on outage probabilities. Numerical results for a Rayleigh-fading WTC show that the rate-adaptation using multilevel feedbacks provides important gains in secrecy throughput comparing to the non-adaptive model. The fact that the eavesdropper also feedbacks information may seem unrealistic, but obtained results can be understood as an upper limit of the possible secrecy throughput improvements.

Related papers

Rate Adaptation for Incremental Redundancy Secure HARQ

Zeina Mheich, Maël Le Treust, Florence Alberge +1 more

This paper studies secure communication based on incremental redundancy (INR) secure hybrid automatic retransmission request (HARQ) protocol over block-fading wiretap channels. The transmitter has no instantaneous channel state information (CSI) available from either main channel or the eavesdropper channel, hence the coding rates cannot be adapted to instantaneous channel conditions. We investigate the outage performance for two schemes of INR secure HARQ protocols: case 1) when there exists two reliable multibit feedback channels from both legitimate receiver and eavesdropper to the transmitter carrying a function of outdated CSI, and case 2) when there is a multibit feedback channel only from legitimate receiver. In both cases, we demonstrate that using the information carried via multibit feedback channels, the transmitter can adapt the coding rates in order to achieve a better secrecy throughput using a smaller number of transmissions comparing to the ACK/NACK feedback channel model. For some parameters, our rate adaptation protocol achieves a strictly positive secrecy throughput whereas it is equal to zero for the protocol with ACK/NACK feedback. We show that for some set of parameters, the loss of secrecy throughput between case 1 and case 2 is very small compared to the gain provided by both protocols.

IEEE Transactions on Communications•Jan 4, 2016•15 citations

An Achievable Secrecy Throughput of Hybrid-ARQ Protocols for Block Fading Channels

Xiaojun Tang, Ruoheng Liu, Predrag Spasojević

In applications of wireless packet-oriented data networks, a special coding scheme, the hybrid automatic retransmission request (HARQ) exhibits high throughput efficiency by adapting its error correcting code redundancy to channel conditions. Motivated by the increasing importance of secure communication over wireless networks, we investigate secure packet communication based on HARQ over block-fading (BF) channels. More specifically, we consider two legitimate users communicating over a BF channel in the presence of a passive eavesdropper who intercepts the transmission through another independent BF channel. We assume that the transmitter can obtain a 1-bit ACK/NACK feedback from the receiver via a reliable public channel. Under this setting, we consider incremental redundancy (IR) and repetition time diversity (RTD) HARQ schemes based on rate-compatible Wyner secrecy codes from an information theoretic point of view. We study a good Wyner code sequence, with which the legitimate receiver can decode the message and the eavesdropper can be perfectly confused. For a given pair of reliability/secrecy outage probabilities, we derive an achievable secrecy throughput of HARQ protocols for block-fading channels. Finally, we illustrate numerically that HARQ can benefit both throughput and secrecy.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•7 citations

On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels

Xiaojun Tang, Ruoheng Liu, Predrag Spasojević +1 more

The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. Thehybridautomaticretransmission request (HARQ) protocol is revisited for a block-fading wiretap channel. Here, two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who intercepts the transmissions through an independent block-fading channel. In this model, the transmitter obtains a 1-bit ACK/NACK feedback from the legitimate receiver via an error-freepublicchannel. Both reliability and confidentiality of secure HARQ protocols are studied through the joint consideration of channel coding, secrecy coding, and retransmission protocols. In particular, the error and secrecy performance ofrepetition time diversity(RTD) andincremental redundancy(INR) protocols are investigated based on Wyner code sequences. These protocols ensure that the confidential message is decoded successfully by the legitimate receiver and is kept completely secret from the eavesdropper for a set of channel realizations. This paper illustrates that there exists a rate-compatible Wyner code family which ensures a secure INR protocol. Further, it defines theconnection outageandsecrecy outageprobabilities to characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdropper's link. For a given connection/secrecy outage probability pair, an achievable throughput of secure HARQ protocols is derived for block-fading channels. Finally, both asymptotic analysis and numerical calculations demonstrate the benefits of HARQ protocols to throughput and secrecy.

arXiv:0712.4135•IEEE Transactions on Information Theory•Mar 19, 2009•144 citations

A new scheme to improve the secrecy throughput under the constraints of secrecy outage probability and average transmit power

Pengcheng Mu, Peizhi Yang, Bo Wang +2 more

The issue of physical layer security for the wireless communication with slow fading is addressed in this paper, and the secrecy outage performance is concerned. The system is modeled as a wiretap channel, and each of the transmitter and receivers is equipped with a single antenna. The channel state information (CSI) about the channel from the transmitter to the legitimate receiver (the main channel) is assumed to be perfectly known by the transmitter and the receivers, while the transmitter does not know the CSI about the channel from the transmitter to the eavesdropper (the eavesdropper's channel) but its probability density function (PDF). Differing from the fixed secrecy rate scheme and the on/off scheme in the literature, this paper adaptively chooses the secrecy rate. The secrecy rate for each value of the main channel gain is determined by the required secrecy outage probability and the PDF of the eavesdropper's channel, and the secrecy throughput is maximized under the constraint of the transmit power for the required secrecy outage probability. The quasi-static Rayleigh fading channel is used to compare our scheme with the two existing schemes, and simulation results show that our scheme outperforms them when small secrecy outage probabilities are required.

IEEE International Conference on Communications workshops•Jun 1, 2014•5 citations

Rate Adaptation for Secure HARQ Protocols

Maël Le Treust, Leszek Szczeciński, Fabrice Labeau

This paper investigates the incremental-redundancy hybrid-automatic repeat request (IR-HARQ) transmission over independent block-fading channels in the presence of an eavesdropper, where the secrecy of the transmission is ensured via introduction of dummy messages. Since the encoder only knows the statistics of the channel state, the secrecy and the reliability are defined in a probabilistic framework. Unlike previous works on this subject, we design a coding strategy tailored to IR-HARQ by splitting the dummy-message rate over several rate parameters. These additional degrees of freedom improve the match between the dummy-message rates and the realizations of the eavesdropper channels. We evaluate the performance in terms of secrecy outage probability, connection outage probability, and throughput and compare it with the benchmark paper by Tang et al. Numerical examples illustrate that, comparing to existing alternatives, splitting of the dummy-message rate provides higher throughput and lower expected duration/average delay.

arXiv:1611.09143•IEEE Transactions on Information Forensics and Security•May 7, 2018•13 citations

Communicating over wireless channels with information-theoretic secrecy

Xiaojun Tang

Wireless systems are susceptible to eavesdropping as an unwelcome result of the broadcast nature of the wireless medium. Fortunately, the wireless medium also provides endowments including the temporal dispersion, the capability of signal superposition and other properties, to facilitate defending against eavesdropping. The focus of the thesis is to provide schemes for utilizing these properties at the physical layer and their performance analysis from an information-theoretic secrecy perspective. The work is based on Wyner's results on the wire-tap channel, in which the transmission between two legitimate users (Alice and Bob) is eavesdropped upon by Eve. The secrecy level is measured by the equivocation rate at Eve. The system performance is measured by the secrecy capacity. This is the maximum rate at which a message can be sent from Alice to Bob, while constraining the equivocation rate at Eve equal to the communication rate, and thus ensuring that Eve cannot deduce any useful information asymptotically. First, the scenario where a secret message needs to be delivered to the intended receiver within a given delay constraint and without the knowledge of the channel state information (CSI) at the transmitter is considered. In particular, hybrid automatic retransmission request (HARQ) protocols are revisited for a block-fading wire-tap channel via a joint consideration of channel coding, secrecy coding, and retransmission protocols. Two secure HARQ protocols: a repetition time diversity (RTD) scheme with maximal-ratio combining, and an incremental redundancy (INR) scheme based on ratecompatible Wyner secrecy codes are analyzed via an outage-based formulation. The throughput of RTD and INR protocols under probabilistic outage requirements is derived. Asymptotic analysis and numerical computations are given to demonstrate both the benefits of HARQ protocols and the tradeoff between reliability and confidentiality in delay-constrained communications. Second, the effects of interference on information-theoretic secret communication is considered. More specifically, the wiretap channel with a helping interferer (WT-HI) is proposed and studied. Here, an interferer, which does not know the confidential message, helps in ensuring the secrecy of the message by sending independent signals. Achievable secrecy rates and upper bounds on the secrecy capacity are given for both discrete memoryless and Gaussian channels. Interference has conventionally been regarded as a harmful phenomenon that leads to decreasing the rate and the reliability performance of wireless systems. In this work, it is shown that interference can be exploited to assist wireless secrecy. Lastly, the problem of secret key generation over fading channels, in which there exists an additional authenticated, public and error-free feedback channel from Bob to Alice, is considered. A key generation scheme consisting of a communication phase and a key-generation phase is presented. The communication phase is based on layered broadcast coding, which adapts the decoded rate at Bob to the actual channel state without requiring CSI available at Alice. The key-generation phase is based on the messages decoded by Bob after the communication phase and the public feedback. The achievable secrecy key rate and the optimal power distribution over coded layers for maximizing the secrecy key rate are characterized. Theoretical and numerical results show that the broadcast approach outperforms the single-level-coding based approach significantly, and hence demonstrate the role of introducing self-interference in facilitating secret-key generation over slowly fading channels when transmit CSI is not available.

•Jan 1, 2010•0 citations
This paper analyzes the achievable secrecy throughput in incremental redundancy secure HARQ protocols for communication over block-fading wiretap channels (WTC). The transmitter has no instantaneous channel state information (CSI) but can receive an outdated version of CSI from both legitimate receiver and eavesdropper through reliable multibit feedback channels. Using outdated CSI, the transmitter can adapt the coding rates. Since the transmitter cannot adapt the coding rates to the instantaneous channel conditions, we consider the outage performance of secure HARQ protocols. We show how to find the optimal rate-adaptation policies to maximize the secrecy throughput under constraints on outage probabilities. Numerical results for a Rayleigh-fading WTC show that the rate-adaptation using multilevel feedbacks provides important gains in secrecy throughput comparing to the non-adaptive model. The fact that the eavesdropper also feedbacks information may seem unrealistic, but obtained results can be understood as an upper limit of the possible secrecy throughput improvements.
This paper studies secure communication based on incremental redundancy (INR) secure hybrid automatic retransmission request (HARQ) protocol over block-fading wiretap channels. The transmitter has no instantaneous channel state information (CSI) available from either main channel or the eavesdropper channel, hence the coding rates cannot be adapted to instantaneous channel conditions. We investigate the outage performance for two schemes of INR secure HARQ protocols: case 1) when there exists two reliable multibit feedback channels from both legitimate receiver and eavesdropper to the transmitter carrying a function of outdated CSI, and case 2) when there is a multibit feedback channel only from legitimate receiver. In both cases, we demonstrate that using the information carried via multibit feedback channels, the transmitter can adapt the coding rates in order to achieve a better secrecy throughput using a smaller number of transmissions comparing to the ACK/NACK feedback channel model. For some parameters, our rate adaptation protocol achieves a strictly positive secrecy throughput whereas it is equal to zero for the protocol with ACK/NACK feedback. We show that for some set of parameters, the loss of secrecy throughput between case 1 and case 2 is very small compared to the gain provided by both protocols.
In applications of wireless packet-oriented data networks, a special coding scheme, the hybrid automatic retransmission request (HARQ) exhibits high throughput efficiency by adapting its error correcting code redundancy to channel conditions. Motivated by the increasing importance of secure communication over wireless networks, we investigate secure packet communication based on HARQ over block-fading (BF) channels. More specifically, we consider two legitimate users communicating over a BF channel in the presence of a passive eavesdropper who intercepts the transmission through another independent BF channel. We assume that the transmitter can obtain a 1-bit ACK/NACK feedback from the receiver via a reliable public channel. Under this setting, we consider incremental redundancy (IR) and repetition time diversity (RTD) HARQ schemes based on rate-compatible Wyner secrecy codes from an information theoretic point of view. We study a good Wyner code sequence, with which the legitimate receiver can decode the message and the eavesdropper can be perfectly confused. For a given pair of reliability/secrecy outage probabilities, we derive an achievable secrecy throughput of HARQ protocols for block-fading channels. Finally, we illustrate numerically that HARQ can benefit both throughput and secrecy.
The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. Thehybridautomaticretransmission request (HARQ) protocol is revisited for a block-fading wiretap channel. Here, two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who intercepts the transmissions through an independent block-fading channel. In this model, the transmitter obtains a 1-bit ACK/NACK feedback from the legitimate receiver via an error-freepublicchannel. Both reliability and confidentiality of secure HARQ protocols are studied through the joint consideration of channel coding, secrecy coding, and retransmission protocols. In particular, the error and secrecy performance ofrepetition time diversity(RTD) andincremental redundancy(INR) protocols are investigated based on Wyner code sequences. These protocols ensure that the confidential message is decoded successfully by the legitimate receiver and is kept completely secret from the eavesdropper for a set of channel realizations. This paper illustrates that there exists a rate-compatible Wyner code family which ensures a secure INR protocol. Further, it defines theconnection outageandsecrecy outageprobabilities to characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdropper's link. For a given connection/secrecy outage probability pair, an achievable throughput of secure HARQ protocols is derived for block-fading channels. Finally, both asymptotic analysis and numerical calculations demonstrate the benefits of HARQ protocols to throughput and secrecy.
The issue of physical layer security for the wireless communication with slow fading is addressed in this paper, and the secrecy outage performance is concerned. The system is modeled as a wiretap channel, and each of the transmitter and receivers is equipped with a single antenna. The channel state information (CSI) about the channel from the transmitter to the legitimate receiver (the main channel) is assumed to be perfectly known by the transmitter and the receivers, while the transmitter does not know the CSI about the channel from the transmitter to the eavesdropper (the eavesdropper's channel) but its probability density function (PDF). Differing from the fixed secrecy rate scheme and the on/off scheme in the literature, this paper adaptively chooses the secrecy rate. The secrecy rate for each value of the main channel gain is determined by the required secrecy outage probability and the PDF of the eavesdropper's channel, and the secrecy throughput is maximized under the constraint of the transmit power for the required secrecy outage probability. The quasi-static Rayleigh fading channel is used to compare our scheme with the two existing schemes, and simulation results show that our scheme outperforms them when small secrecy outage probabilities are required.
This paper investigates the incremental-redundancy hybrid-automatic repeat request (IR-HARQ) transmission over independent block-fading channels in the presence of an eavesdropper, where the secrecy of the transmission is ensured via introduction of dummy messages. Since the encoder only knows the statistics of the channel state, the secrecy and the reliability are defined in a probabilistic framework. Unlike previous works on this subject, we design a coding strategy tailored to IR-HARQ by splitting the dummy-message rate over several rate parameters. These additional degrees of freedom improve the match between the dummy-message rates and the realizations of the eavesdropper channels. We evaluate the performance in terms of secrecy outage probability, connection outage probability, and throughput and compare it with the benchmark paper by Tang et al. Numerical examples illustrate that, comparing to existing alternatives, splitting of the dummy-message rate provides higher throughput and lower expected duration/average delay.
Wireless systems are susceptible to eavesdropping as an unwelcome result of the broadcast nature of the wireless medium. Fortunately, the wireless medium also provides endowments including the temporal dispersion, the capability of signal superposition and other properties, to facilitate defending against eavesdropping. The focus of the thesis is to provide schemes for utilizing these properties at the physical layer and their performance analysis from an information-theoretic secrecy perspective. The work is based on Wyner's results on the wire-tap channel, in which the transmission between two legitimate users (Alice and Bob) is eavesdropped upon by Eve. The secrecy level is measured by the equivocation rate at Eve. The system performance is measured by the secrecy capacity. This is the maximum rate at which a message can be sent from Alice to Bob, while constraining the equivocation rate at Eve equal to the communication rate, and thus ensuring that Eve cannot deduce any useful information asymptotically. First, the scenario where a secret message needs to be delivered to the intended receiver within a given delay constraint and without the knowledge of the channel state information (CSI) at the transmitter is considered. In particular, hybrid automatic retransmission request (HARQ) protocols are revisited for a block-fading wire-tap channel via a joint consideration of channel coding, secrecy coding, and retransmission protocols. Two secure HARQ protocols: a repetition time diversity (RTD) scheme with maximal-ratio combining, and an incremental redundancy (INR) scheme based on ratecompatible Wyner secrecy codes are analyzed via an outage-based formulation. The throughput of RTD and INR protocols under probabilistic outage requirements is derived. Asymptotic analysis and numerical computations are given to demonstrate both the benefits of HARQ protocols and the tradeoff between reliability and confidentiality in delay-constrained communications. Second, the effects of interference on information-theoretic secret communication is considered. More specifically, the wiretap channel with a helping interferer (WT-HI) is proposed and studied. Here, an interferer, which does not know the confidential message, helps in ensuring the secrecy of the message by sending independent signals. Achievable secrecy rates and upper bounds on the secrecy capacity are given for both discrete memoryless and Gaussian channels. Interference has conventionally been regarded as a harmful phenomenon that leads to decreasing the rate and the reliability performance of wireless systems. In this work, it is shown that interference can be exploited to assist wireless secrecy. Lastly, the problem of secret key generation over fading channels, in which there exists an additional authenticated, public and error-free feedback channel from Bob to Alice, is considered. A key generation scheme consisting of a communication phase and a key-generation phase is presented. The communication phase is based on layered broadcast coding, which adapts the decoded rate at Bob to the actual channel state without requiring CSI available at Alice. The key-generation phase is based on the messages decoded by Bob after the communication phase and the public feedback. The achievable secrecy key rate and the optimal power distribution over coded layers for maximizing the secrecy key rate are characterized. Theoretical and numerical results show that the broadcast approach outperforms the single-level-coding based approach significantly, and hence demonstrate the role of introducing self-interference in facilitating secret-key generation over slowly fading channels when transmit CSI is not available.