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

International Conference on Communications

Secret message transmission by HARQ with multiple encoding

Stefano Tomasin, Nicola Laurenti

Published Jun 1, 2014• 5 citations
Publisher

Abstract

Secure transmission between two agents, Alice and Bob, over block fading channels can be achieved similarly to conventional hybrid automatic repeat request (HARQ) by letting Alice transmit multiple blocks, each containing an encoded version of the secret message, until Bob informs Alice about successful decoding by a public error-free return channel. In existing literature each block is a differently punctured version of a single codeword generated with a Wyner code that uses a common randomness for all blocks. In this paper instead we propose a more general approach where multiple codewords are generated from independent randomnesses. The class of channels for which decodability and secrecy is ensured is characterized, with derivations for the existence of secret codes. We show in particular that the classes are not a trivial subset (or superset) of those of existing schemes, thus highlighting the novelty of the proposed solution. The result is further confirmed by deriving the average achievable secrecy throughput, thus taking into account both decoding and secrecy outage.

DOI
10.1109/icc.2014.6883648

Related papers

Secret Message Transmission by HARQ with Multiple Encoding

Stefano Tomasin, Nicola Laurenti

Secure transmission between two agents, Alice and Bob, over block fading channels can be achieved similarly to conventional hybrid automatic repeat request (HARQ) by letting Alice transmit multiple blocks, each containing an encoded version of the secret message, until Bob informs Alice about successful decoding by a public error-free return channel. In existing literature each block is a differently punctured version of a single codeword generated with a Wyner code that uses a common randomness for all blocks. In this paper instead we propose a more general approach where multiple codewords are generated from independent randomnesses. The class of channels for which decodability and secrecy is ensured is characterized, with derivations for the existence of secret codes. We show in particular that the classes are not a trivial subset (or superset) of those of existing schemes, thus highlighting the novelty of the proposed solution. The result is further confirmed by deriving the average achievable secrecy throughput, thus taking into account both decoding and secrecy outage.

arXiv:1401.3088•Jan 14, 2014•0 citations

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

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

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

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

Secret sharing in fast fading channels based on reliability-based hybrid ARQ

Chan Wong Wong, John M. Shea, Tan F. Wong

Consider a wireless transmission from Alice to Bob in the presence of an eavesdropper, Eve. We propose a technique to allow Alice to send a message such that Bob can decode it but Eve can get little information about the message. This scenario is a classic example of the wiretap channel, for which several researchers have begun to develop practical schemes. However, we consider a challenging version in which the channel from Alice to Eve may be as good or better than the channel from Alice to Bob. There have been no practical secrecy coding techniques that have been developed for this scenario. The key to allow secret communication in such a scenario is feedback from Bob to Alice (which Eve can also observe). The scheme we develop uses reliability-based hybrid automatic-repeat-request (RB-HARQ) over a fast fading channel to provide a decoding advantage at Bob. Bob requests information about received symbols that suffer from deep fades. The retransmitted symbols improve Bobpsilas ability to decode the message faster than at Eve, who sees retransmission of bits with random reliabilities. We evaluate the proposed scheme by performance measures such as the probability of successful decoding and the equivocation rate at Eve.

IEEE Military Communications Conference (MILCOM)•Nov 1, 2008•9 citations
Secure transmission between two agents, Alice and Bob, over block fading channels can be achieved similarly to conventional hybrid automatic repeat request (HARQ) by letting Alice transmit multiple blocks, each containing an encoded version of the secret message, until Bob informs Alice about successful decoding by a public error-free return channel. In existing literature each block is a differently punctured version of a single codeword generated with a Wyner code that uses a common randomness for all blocks. In this paper instead we propose a more general approach where multiple codewords are generated from independent randomnesses. The class of channels for which decodability and secrecy is ensured is characterized, with derivations for the existence of secret codes. We show in particular that the classes are not a trivial subset (or superset) of those of existing schemes, thus highlighting the novelty of the proposed solution. The result is further confirmed by deriving the average achievable secrecy throughput, thus taking into account both decoding and secrecy outage.
Secure transmission between two agents, Alice and Bob, over block fading channels can be achieved similarly to conventional hybrid automatic repeat request (HARQ) by letting Alice transmit multiple blocks, each containing an encoded version of the secret message, until Bob informs Alice about successful decoding by a public error-free return channel. In existing literature each block is a differently punctured version of a single codeword generated with a Wyner code that uses a common randomness for all blocks. In this paper instead we propose a more general approach where multiple codewords are generated from independent randomnesses. The class of channels for which decodability and secrecy is ensured is characterized, with derivations for the existence of secret codes. We show in particular that the classes are not a trivial subset (or superset) of those of existing schemes, thus highlighting the novelty of the proposed solution. The result is further confirmed by deriving the average achievable secrecy throughput, thus taking into account both decoding and secrecy outage.
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.
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.
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).
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.
Consider a wireless transmission from Alice to Bob in the presence of an eavesdropper, Eve. We propose a technique to allow Alice to send a message such that Bob can decode it but Eve can get little information about the message. This scenario is a classic example of the wiretap channel, for which several researchers have begun to develop practical schemes. However, we consider a challenging version in which the channel from Alice to Eve may be as good or better than the channel from Alice to Bob. There have been no practical secrecy coding techniques that have been developed for this scenario. The key to allow secret communication in such a scenario is feedback from Bob to Alice (which Eve can also observe). The scheme we develop uses reliability-based hybrid automatic-repeat-request (RB-HARQ) over a fast fading channel to provide a decoding advantage at Bob. Bob requests information about received symbols that suffer from deep fades. The retransmitted symbols improve Bobpsilas ability to decode the message faster than at Eve, who sees retransmission of bits with random reliabilities. We evaluate the proposed scheme by performance measures such as the probability of successful decoding and the equivocation rate at Eve.