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

Entropy

A Hybrid Cooperative Coding Scheme for the Relay-Eavesdropper Channel

Peng Xu, Zhiguo Ding, Xuchu Dai

Published Mar 24, 2014• 1 citation
Publisher

Abstract

This paper considers the four-node relay-eavesdropper channel, where a relay node helps the source to send secret messages to the destination in the presence of a passive eavesdropper. For the discrete memoryless case, we propose a hybrid cooperative coding scheme, which is based on the combination of the partial decode-forward scheme, the noise-forward scheme and the random binning scheme. The key feature of the proposed hybrid cooperative scheme is that the relay integrates the explicit cooperation strategy and the implicit cooperation strategy by forwarding source messages and additional interference at the same time. The derived achievable secrecy rate shows that some existing works can be viewed as special cases of the proposed scheme. Then, the achievable secrecy rate is extended to the Gaussian channel based on Gaussian codebooks, and the optimal power policy is also identified in the high power region. Both the analysis and numerical results are provided to demonstrate that the proposed hybrid cooperative coding scheme outperforms the comparable ones, especially in the high power region.

DOI
10.3390/e16031819

Related papers

On the Application of Noisy Network Coding to the Relay-Eavesdropper Channel

Peng Xu, Zhiguo Ding, Dai, and Xuchu +1 more

In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for wiretap channel with a helping interferer. A new achievable secrecy rate is characterized for both discrete memoryless and Gaussian channels. Such a new rate can be viewed as a general framework, where the existing interference assisted schemes such as noisy-forwarding and cooperative jamming approaches can be shown as special cases of the proposed scheme. In addition, under some channel condition where the existing schemes can only achieve zero secrecy rate, the proposed secrecy scheme can still offer significant performance gains.

arXiv:1203.5602•Mar 26, 2012•4 citations

An improved achievable secrecy rate for the relay-eavesdropper channel

Peng Xu, Zhiguo Ding, Xuchu Dai +1 more

This paper study information-theoretic security for a four-node relay-eavesdropper channel. We propose a new achievable scheme whose key idea is to combine noisy network coding for relay channels and the interference assisted strategy for wiretap channel with a helping interferer. The corresponding achievable secrecy rate is characterized for both discrete memoryless and Gaussian channels. The previous interference assisted schemes such as noise-forwarding and cooperative jamming are shown to be special cases of the proposed scheme. Moreover, in some very strong eavesdropping case where these interference assisted schemes can only achieve zero secrecy rate, the proposed secrecy scheme can still achieve a positive secrecy rate.

IEEE Wireless Communications and Networking Conference•Apr 1, 2013•2 citations

Achievable Secrecy Rates for Relay-Eavesdropper Channel Based on the Application of Noisy Network Coding

Peng Xu, Zhiguo Ding, Xuchu Dai

In this paper, we consider the design of a new secure transmission scheme for a four-node relay-eavesdropper channel, where user cooperation is used to facilitate secure communications. The key idea of the proposed achievable scheme is to apply the compression relaying concept of noisy network coding (NNC) to the secrecy communication scenario. But different from the original non-secrecy NNC, the compression rate at the relay is adaptively chosen according to the eavesdropping channel. Particularly, helping interference information is injected into the compression codebook at the relay by simply enlarging the compression rate, which is to effectively suppress the eavesdropping channel. Closed-form expressions of the secrecy rates achieved by the proposed NNC-based secure scheme are characterized for both the discrete memoryless and Gaussian relay-eavesdropper channels, where the optimal compression rate and the optimal transmit power at the relay are also determined. The proposed secure scheme can be viewed as a general framework, which naturally combines the NNC compression relaying scheme with the interference-assisted scheme. Analytical and numerical results demonstrate that the proposed secure scheme offers constant performance gains over typical existing cooperative secure schemes.

IEEE Transactions on Information Forensics and Security•Feb 12, 2018•9 citations

A new achievable rate-equivocation region for the relay-eavesdropper channel

Amir Sonee, Somayeh Salimi

In this paper, we propose an information-theoretic scheme which achieves a new rate-equivocation region for the four-terminal relay-eavesdropper channel. The coding scheme used to achieve this region is a combination of the partial decode and forward, compress and forward and noise forwarding strategies. In this strategy the relay cooperates with the source to have both a reliable and secure communication by decoding some part of the source message, compressing the received signal and also sending the codewords independent of the transmitted message. Using this scheme we can obtain the perfect secrecy capacity of the semi- deterministic and deterministic relay channels.

Iranian Conference on Electrical Engineering•May 1, 2010•3 citations

Secure Communication Over Parallel Relay Channel

Zohaib Hassan Awan, Abdellatif Zaidi, Luc Vandendorpe

We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four-terminal relay-eavesdropper channel which consists of multiple relay-eavesdropper channels as subchannels. For the discrete memoryless model, we establish outer and inner bounds on the rate-equivocation region. The inner bound allows mode selection at the relay. For each subchannel, secure transmission is obtained through one of two coding schemes at the relay: decoding-and-forwarding the source message or confusing the eavesdropper through noise injection. For the Gaussian memoryless channel, we establish lower and upper bounds on the perfect secrecy rate. Furthermore, we study a special case in which the relay does not hear the source and show that under certain conditions the lower and upper bounds coincide. The results established for the parallel Gaussian relay-eavesdropper channel are then applied to study the fading relay-eavesdropper channel. Analytical results are illustrated through some numerical examples.

arXiv:1011.2115•IEEE Transactions on Information Forensics and Security•Jan 31, 2012•32 citations

Cooperative Secrecy: The Relay-Eavesdropper Channel

Lifeng Lai, Hesham El Gamal

This paper investigates the role of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay-eavesdropper channel is introduced and analyzed. Several cooperation strategies are devised and the corresponding achievable rate-equivocation region are characterized. Of particular interest is the novel Noise-Forwarding (NF) strategy, where the relay node sends codewords independent of the source message to confuse the eavesdropper. This strategy is used to illustrate the deaf helper phenomenon, where the relay is able to facilitate secure communications while being totally ignorant of the transmitted messages. Furthermore, NF is shown to increase the perfect secrecy rate in the reversely degraded scenario, where the relay node fails to offer performance gains in the classical setting. The gain offered by the proposed cooperation strategies is then proved theoretically and validated numerically in the additive white Gaussian noise (AWGN) channel.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•54 citations
This paper considers the four-node relay-eavesdropper channel, where a relay node helps the source to send secret messages to the destination in the presence of a passive eavesdropper. For the discrete memoryless case, we propose a hybrid cooperative coding scheme, which is based on the combination of the partial decode-forward scheme, the noise-forward scheme and the random binning scheme. The key feature of the proposed hybrid cooperative scheme is that the relay integrates the explicit cooperation strategy and the implicit cooperation strategy by forwarding source messages and additional interference at the same time. The derived achievable secrecy rate shows that some existing works can be viewed as special cases of the proposed scheme. Then, the achievable secrecy rate is extended to the Gaussian channel based on Gaussian codebooks, and the optimal power policy is also identified in the high power region. Both the analysis and numerical results are provided to demonstrate that the proposed hybrid cooperative coding scheme outperforms the comparable ones, especially in the high power region.
In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for wiretap channel with a helping interferer. A new achievable secrecy rate is characterized for both discrete memoryless and Gaussian channels. Such a new rate can be viewed as a general framework, where the existing interference assisted schemes such as noisy-forwarding and cooperative jamming approaches can be shown as special cases of the proposed scheme. In addition, under some channel condition where the existing schemes can only achieve zero secrecy rate, the proposed secrecy scheme can still offer significant performance gains.
This paper study information-theoretic security for a four-node relay-eavesdropper channel. We propose a new achievable scheme whose key idea is to combine noisy network coding for relay channels and the interference assisted strategy for wiretap channel with a helping interferer. The corresponding achievable secrecy rate is characterized for both discrete memoryless and Gaussian channels. The previous interference assisted schemes such as noise-forwarding and cooperative jamming are shown to be special cases of the proposed scheme. Moreover, in some very strong eavesdropping case where these interference assisted schemes can only achieve zero secrecy rate, the proposed secrecy scheme can still achieve a positive secrecy rate.
In this paper, we consider the design of a new secure transmission scheme for a four-node relay-eavesdropper channel, where user cooperation is used to facilitate secure communications. The key idea of the proposed achievable scheme is to apply the compression relaying concept of noisy network coding (NNC) to the secrecy communication scenario. But different from the original non-secrecy NNC, the compression rate at the relay is adaptively chosen according to the eavesdropping channel. Particularly, helping interference information is injected into the compression codebook at the relay by simply enlarging the compression rate, which is to effectively suppress the eavesdropping channel. Closed-form expressions of the secrecy rates achieved by the proposed NNC-based secure scheme are characterized for both the discrete memoryless and Gaussian relay-eavesdropper channels, where the optimal compression rate and the optimal transmit power at the relay are also determined. The proposed secure scheme can be viewed as a general framework, which naturally combines the NNC compression relaying scheme with the interference-assisted scheme. Analytical and numerical results demonstrate that the proposed secure scheme offers constant performance gains over typical existing cooperative secure schemes.
In this paper, we propose an information-theoretic scheme which achieves a new rate-equivocation region for the four-terminal relay-eavesdropper channel. The coding scheme used to achieve this region is a combination of the partial decode and forward, compress and forward and noise forwarding strategies. In this strategy the relay cooperates with the source to have both a reliable and secure communication by decoding some part of the source message, compressing the received signal and also sending the codewords independent of the transmitted message. Using this scheme we can obtain the perfect secrecy capacity of the semi- deterministic and deterministic relay channels.
We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four-terminal relay-eavesdropper channel which consists of multiple relay-eavesdropper channels as subchannels. For the discrete memoryless model, we establish outer and inner bounds on the rate-equivocation region. The inner bound allows mode selection at the relay. For each subchannel, secure transmission is obtained through one of two coding schemes at the relay: decoding-and-forwarding the source message or confusing the eavesdropper through noise injection. For the Gaussian memoryless channel, we establish lower and upper bounds on the perfect secrecy rate. Furthermore, we study a special case in which the relay does not hear the source and show that under certain conditions the lower and upper bounds coincide. The results established for the parallel Gaussian relay-eavesdropper channel are then applied to study the fading relay-eavesdropper channel. Analytical results are illustrated through some numerical examples.
This paper investigates the role of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay-eavesdropper channel is introduced and analyzed. Several cooperation strategies are devised and the corresponding achievable rate-equivocation region are characterized. Of particular interest is the novel Noise-Forwarding (NF) strategy, where the relay node sends codewords independent of the source message to confuse the eavesdropper. This strategy is used to illustrate the deaf helper phenomenon, where the relay is able to facilitate secure communications while being totally ignorant of the transmitted messages. Furthermore, NF is shown to increase the perfect secrecy rate in the reversely degraded scenario, where the relay node fails to offer performance gains in the classical setting. The gain offered by the proposed cooperation strategies is then proved theoretically and validated numerically in the additive white Gaussian noise (AWGN) channel.