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

China Communications

The analysis of secure HARQ with chase combining over block fading channel

Yue Wu, Lukman Abiodun Olawoyin, Nana Zhang, Hongwen Yang

Published May 1, 2016• 5 citations
Publisher

Abstract

In this letter, the physical layer security of hybrid automatic repeat request with chase combining (HARQ-CC) scheme is investigated from the viewpoint of information theory. Different from the literature which used Wyner code, our analysis focuses on the general scenario without specific code. We firstly obtain the outage probability of both main channel and wiretap channel. Since retransmissions are completely determined by main channel, we then prove that its achievable diversity order equals to maximum transmission number (K) while this order of wiretap channel is only one. Furthermore, we evaluate the metric of secure gap which demonstrates the difference between main channel and wiretap channel with reliable and secure constraints. As K increases, the secure gap decreases monotonously. When K is large enough, the security can be guaranteed even if wiretap channel is better than main channel.

DOI
10.1109/cc.2016.7489976

Related papers

The Analysis of Secure HARQ with Chase Combining over Block Fading Channel

Yue Yue, Wu ., Lukman Lukman +4 more

In this letter, the physical layer security of hybrid automatic repeat request with chase combining(HARQ-CC) scheme is investigated from the viewpoint of information theory. Different from the literature which used Wyner code, our analysis focuses on the general scenario without specific code. We firstly obtain the outage probability of both main channel and wiretap channel. Since retransmissions are completely determined by main channel, we then prove that its achievable diversity order equals to maximum transmission number() while this order of wiretap channel is only one. Furthermore, we evaluate the metric of secure gap which demonstrates the difference between main channel and wiretap channel with reliable and secure constraints. As increases, the secure gap decreases monotonously. When is large enough, the security can be guaranteed even if wiretap channel is better than main channel.

China Communications•Jan 1, 2016•0 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•145 citations

Rate Adaption for Secure HARQ-CC System with Multiple Eavesdroppers

Yue Wu, Shishu Yin, Jian Zhou +2 more

In this paper, we studied the secure transmission of a hybrid automatic repeat request with chase combining (HARQ-CC) system, under the existence of multiple eavesdroppers and limited latency. First, we analyzed some critical performance metrics, including connection outage probability (COP), secrecy outage probability (SOP) and effective secrecy throughput (EST). Then, to maximize the EST, three optimization problems of rate adaption were discussed: (i) optimizing the code rate with a given secrecy redundancy rate by a parameterized closed-form solution; (ii) optimizing the secrecy redundancy rate with a given code rate by a fixed-point method; (iii) optimizing both code rate and secrecy redundancy rate by an iterative optimization algorithm. We also considered COP and SOP constraints among the problems while corresponding solutions were deduced. Finally, numerical and simulated results verified our conclusions that the approximated SOP matches well with Monte-Carlo simulation for a strict reliable constraint, and that the optimized transmitting rate enhances EST efficiently with multiple eavesdroppers and retransmissions. Moreover, the influence of the number of eavesdroppers on secrecy performance was analyzed. Briefly, secrecy performance inevitably deteriorates with increasing number of eavesdroppers due to raised information leakage.

Entropy•Mar 31, 2020•1 citation

Secure HARQ With Multiple Encoding Over Block Fading Channels: Channel Set Characterization and Outage Analysis

Stefano Tomasin, Nicola Laurenti

We consider a scenario where agent Alice aims at transmitting a message to agent Bob, while keeping it secret from a third eavesdropper agent Eve. The transmissions occur on block-fading channels, and Alice only has a statistical channel state information (CSI) on both Bob and Eve channels. In this paper, we add secrecy features to hybrid automatic repeat request (HARQ) in what becomes a secure HARQ (S-HARQ) scheme. In particular, Alice encodes the secret message and splits the codeword into blocks. Then, she transmits one block at a time and after each transmission Bob feeds back an acknowledge (ACK) (not acknowledge (NACK)) packet, indicating he was (was not) able to decode the secret message. Upon an ACK Alice stops transmission, while upon a NACK Alice re-encodes the secret message into a new codeword and transmits it block by block, waiting for a new feedback. The process is iterated until either Bob decodes the message or a maximum number of codewords has been transmitted. We characterize the set of channels for which there exists a sequence of codes that ensure both vanishing error probability to Bob and vanishing rate of information leakage to Eve in the limit of infinitely long codewords. We also analyze the secrecy and decodability outage probabilities, providing closed form expressions for the case of additive white Gaussian noise channels with Rayleigh fading. The tradeoff between the number of blocks per codeword and the maximum number of codewords to be transmitted is also discussed.

IEEE Transactions on Information Forensics and Security•Aug 8, 2014•12 citations

HARQ with Quantized 1-Bit CSI Feedback for Block Fading Wiretap Channels

Stefano Tomasin

We propose a hybrid automatic repeat request (HARQ) scheme with quantized channel state information (CSI) feedback for secure transmission from agent Alice to agent Bob over block fading channels. Bob feeds back to Alice a one-bit information on his CSI and she decides whether to transmit at a fixed rate or stay idle. If Bob fails to decode the secret message, the feedback, encoding and transmission processes are iterated. In order to prevent information leakage to a passive eavesdropper agent Eve, a different wiretap code is used at each iteration. We derive the secrecy outage probability and the number of bits per channel use that are reliably delivered to Bob while not being leaked to Eve. Such an opportunistic use of the channel leads to the reduction of the number of transmissions, with a) a higher secure throughput and b) a reduction of energy consumption (per transmitted bit).

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2016•1 citation
In this letter, the physical layer security of hybrid automatic repeat request with chase combining (HARQ-CC) scheme is investigated from the viewpoint of information theory. Different from the literature which used Wyner code, our analysis focuses on the general scenario without specific code. We firstly obtain the outage probability of both main channel and wiretap channel. Since retransmissions are completely determined by main channel, we then prove that its achievable diversity order equals to maximum transmission number (K) while this order of wiretap channel is only one. Furthermore, we evaluate the metric of secure gap which demonstrates the difference between main channel and wiretap channel with reliable and secure constraints. As K increases, the secure gap decreases monotonously. When K is large enough, the security can be guaranteed even if wiretap channel is better than main channel.
In this letter, the physical layer security of hybrid automatic repeat request with chase combining(HARQ-CC) scheme is investigated from the viewpoint of information theory. Different from the literature which used Wyner code, our analysis focuses on the general scenario without specific code. We firstly obtain the outage probability of both main channel and wiretap channel. Since retransmissions are completely determined by main channel, we then prove that its achievable diversity order equals to maximum transmission number() while this order of wiretap channel is only one. Furthermore, we evaluate the metric of secure gap which demonstrates the difference between main channel and wiretap channel with reliable and secure constraints. As increases, the secure gap decreases monotonously. When is large enough, the security can be guaranteed even if wiretap channel is better than main channel.
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.
In this paper, we studied the secure transmission of a hybrid automatic repeat request with chase combining (HARQ-CC) system, under the existence of multiple eavesdroppers and limited latency. First, we analyzed some critical performance metrics, including connection outage probability (COP), secrecy outage probability (SOP) and effective secrecy throughput (EST). Then, to maximize the EST, three optimization problems of rate adaption were discussed: (i) optimizing the code rate with a given secrecy redundancy rate by a parameterized closed-form solution; (ii) optimizing the secrecy redundancy rate with a given code rate by a fixed-point method; (iii) optimizing both code rate and secrecy redundancy rate by an iterative optimization algorithm. We also considered COP and SOP constraints among the problems while corresponding solutions were deduced. Finally, numerical and simulated results verified our conclusions that the approximated SOP matches well with Monte-Carlo simulation for a strict reliable constraint, and that the optimized transmitting rate enhances EST efficiently with multiple eavesdroppers and retransmissions. Moreover, the influence of the number of eavesdroppers on secrecy performance was analyzed. Briefly, secrecy performance inevitably deteriorates with increasing number of eavesdroppers due to raised information leakage.
We consider a scenario where agent Alice aims at transmitting a message to agent Bob, while keeping it secret from a third eavesdropper agent Eve. The transmissions occur on block-fading channels, and Alice only has a statistical channel state information (CSI) on both Bob and Eve channels. In this paper, we add secrecy features to hybrid automatic repeat request (HARQ) in what becomes a secure HARQ (S-HARQ) scheme. In particular, Alice encodes the secret message and splits the codeword into blocks. Then, she transmits one block at a time and after each transmission Bob feeds back an acknowledge (ACK) (not acknowledge (NACK)) packet, indicating he was (was not) able to decode the secret message. Upon an ACK Alice stops transmission, while upon a NACK Alice re-encodes the secret message into a new codeword and transmits it block by block, waiting for a new feedback. The process is iterated until either Bob decodes the message or a maximum number of codewords has been transmitted. We characterize the set of channels for which there exists a sequence of codes that ensure both vanishing error probability to Bob and vanishing rate of information leakage to Eve in the limit of infinitely long codewords. We also analyze the secrecy and decodability outage probabilities, providing closed form expressions for the case of additive white Gaussian noise channels with Rayleigh fading. The tradeoff between the number of blocks per codeword and the maximum number of codewords to be transmitted is also discussed.
We propose a hybrid automatic repeat request (HARQ) scheme with quantized channel state information (CSI) feedback for secure transmission from agent Alice to agent Bob over block fading channels. Bob feeds back to Alice a one-bit information on his CSI and she decides whether to transmit at a fixed rate or stay idle. If Bob fails to decode the secret message, the feedback, encoding and transmission processes are iterated. In order to prevent information leakage to a passive eavesdropper agent Eve, a different wiretap code is used at each iteration. We derive the secrecy outage probability and the number of bits per channel use that are reliably delivered to Bob while not being leaked to Eve. Such an opportunistic use of the channel leads to the reduction of the number of transmissions, with a) a higher secure throughput and b) a reduction of energy consumption (per transmitted bit).