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 Wireless Communications and Signal Processing (WCSP)

Achievable secrecy rate of the relay-eavesdropper channel with generalized feedback

Yayan Ma, Bao Jing, Junxi Zhao, Baoyun Wang

Published Nov 1, 2011• 2 citations
Publisher

Abstract

We consider the relay-eavesdropper channel with generalized feedback at the source node. In the presence of a wire-tapper, the source can send confidential messages to an intended receiver with the help of the trusted relay. With a generalized feedback from the relay to the source node, the cooperation between the source node and relay node may be enhanced. The achievable secrecy rate region for this channel is derived by using rate splitting strategy and decode-and-forward (DF) strategy at the source node and compress-and-forward (CF) strategy at the relay node.

DOI
10.1109/wcsp.2011.6096881

Related papers

Multiple Access Channels with Generalized Feedback and Confidential Messages

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

This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper. In this setting, an active cooperation between two trusted users is enabled through using channel feedback in order to improve the communication efficiency. Based on rate-splitting and decode-and-forward strategies, achievable secrecy rate regions are derived for both discrete memoryless and Gaussian channels. Results show that channel feedback improves the achievable secrecy rates.

arXiv:0706.3753•IEEE Information Theory Workshop (ITW)•Sep 1, 2007•58 citations

Secure Communication with a Relay Helping the Wire-tapper

Melda Yüksel, Elza Erkip

A four terminal Gaussian network, composed of a single source-destination pair, a relay and a wire-tapper is considered. Unlike the relay channel with a wire-tapper, it is assumed that the relay assists the wire-tapper, not the destination. The relay's objective is to decrease the achievable secrecy rates. However, since the destination is also allowed to listen to the relay's transmission, it also benefits from the relay in terms of achievable rates. Direct transmission, amplify-and-forward (AF), decode-and-forward (DF) and compress-and-forward (CF) relaying schemes are compared in terms of secrecy rates. It is shown that the best relaying strategy depends on relay's location. Comparison of relaying protocols and best power allocation schemes, when the relay assists the source-destination communication, do not readily extend to the case when the relay assists the wire-tapper.

IEEE Information Theory Workshop (ITW)•Sep 1, 2007•67 citations

PERFORMANCE ANALYSIS OF COOPERATION SCHEMES IN EAVESDROPPER ASSISTED RELAY CHANNEL

Vaibhav Kumar Gupta, Poonam Jindal

The prominence of the wireless communication has been urging the monotonically increasing demand of security and privacy. In wireless systems, the notion of perfect secrecy of information with respect to illegitimate nodes can be ensured via physical layer security (PLS) techniques. Unfortunately, they can be made less effective if source- eavesdropper wiretap channel is better than the main source-receiver channel. The various node cooperation schemes can be employed to combat this limitation where a relay node assists the communication to improve the performance significantly. In this paper, a four node wireless communication system consisting of a source, a destination, a relay and an eavesdropper as wire-tapper has been considered. The performance of the traditional cooperation schemes in terms of secrecy rate has been investigated with a different scenario where relay node helps the eavesdropper to deteriorate the secrecy rate. In addition, since legitimate receiver can overhear the transmission of relay, it favours the achievable secrecy rate. We formulate an analytical expression of conditional secrecy outage probability for the investigated system. From the obtained simulation results, it has been observed that secrecy rate is monotonically increases with path loss index. Furthermore, the proper selection of the system parameters leads to enhance the secrecy performance of the system even if relay pertains to degrade the performance. Amplify-and-forward, cooperation, decode-and-Forward, secrecy rate, relay.

ICTACT Journal on Communication Technology•Jun 1, 2014•1 citation

Generalized multiple-access relay channel with confidential messages

Amir Sonee, Somayeh Salimi, Mahmoud Salmasizadeh

In this paper, we propose information theoretic schemes that achieve the rate-equivocation regions for the multiple-access relay channel with confidential messages. This channel consists of two users that play the role of eavesdropper for each other's message and a relay that helps them to have a reliable and secure communication. The relay can itself be an eavesdropper of the users messages. The first coding scheme used for achievability is noise forwarding strategy and the second is the combination of noise forwarding with the compress and forward strategy. In the first one, relay cooperates with the users to have a confidential communication by sending codewords independent of the secret messages. In the second one, in addition to sending independent codewords, relay also sends compressed version of the received signals. Using these schemes, we derive the inner bounds for the capacity-equivocation region of the described model.

International Symposium on Information Theory and its Applications•Oct 1, 2010•0 citations

The Relay–Eavesdropper Channel: Cooperation for Secrecy

Lifeng Lai, Hesham El Gamal

This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay–eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is derived. Several cooperation strategies are then 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 secrecy capacity 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.

arXiv:cs/0612044•IEEE Transactions on Information Theory•Aug 27, 2008•761 citations

Cooperation With an Untrusted Relay: A Secrecy Perspective

Xiang He, Aylin Yener

We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario, an interesting question is whether the relay node should be deployed at all. That is, whether cooperation with an untrusted relay node can ever be beneficial. We first provide an achievable secrecy rate for the general untrusted relay channel, and proceed to investigate this question for two types of relay networks with orthogonal components. For the first model, there is an orthogonal link from the source to the relay. For the second model, there is an orthogonal link from the relay to the destination. For the first model, we find the equivocation capacity region and show that answer is negative. In contrast, for the second model, we find that the answer is positive. Specifically, we show, by means of the achievable secrecy rate based on compress-and-forward, that by asking the untrusted relay node to relay information, we can achieve a higher secrecy rate than just treating the relay as an eavesdropper. For a special class of the second model, where the relay is not interfering itself, we derive an upper bound for the secrecy rate using an argument whose net effect is to separate the eavesdropper from the relay. The merit of the new upper bound is demonstrated on two channels that belong to this special class. The Gaussian case of the second model mentioned above benefits from this approach in that the new upper bound improves the previously known bounds. For the Cover-Kim deterministic relay channel, the new upper bound finds the secrecy capacity when the source-destination link is not worse than the source-relay link, by matching with achievable rate we present.

arXiv:0910.1511•IEEE Transactions on Information Theory•Jul 21, 2010•350 citations
We consider the relay-eavesdropper channel with generalized feedback at the source node. In the presence of a wire-tapper, the source can send confidential messages to an intended receiver with the help of the trusted relay. With a generalized feedback from the relay to the source node, the cooperation between the source node and relay node may be enhanced. The achievable secrecy rate region for this channel is derived by using rate splitting strategy and decode-and-forward (DF) strategy at the source node and compress-and-forward (CF) strategy at the relay node.
This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper. In this setting, an active cooperation between two trusted users is enabled through using channel feedback in order to improve the communication efficiency. Based on rate-splitting and decode-and-forward strategies, achievable secrecy rate regions are derived for both discrete memoryless and Gaussian channels. Results show that channel feedback improves the achievable secrecy rates.
A four terminal Gaussian network, composed of a single source-destination pair, a relay and a wire-tapper is considered. Unlike the relay channel with a wire-tapper, it is assumed that the relay assists the wire-tapper, not the destination. The relay's objective is to decrease the achievable secrecy rates. However, since the destination is also allowed to listen to the relay's transmission, it also benefits from the relay in terms of achievable rates. Direct transmission, amplify-and-forward (AF), decode-and-forward (DF) and compress-and-forward (CF) relaying schemes are compared in terms of secrecy rates. It is shown that the best relaying strategy depends on relay's location. Comparison of relaying protocols and best power allocation schemes, when the relay assists the source-destination communication, do not readily extend to the case when the relay assists the wire-tapper.
The prominence of the wireless communication has been urging the monotonically increasing demand of security and privacy. In wireless systems, the notion of perfect secrecy of information with respect to illegitimate nodes can be ensured via physical layer security (PLS) techniques. Unfortunately, they can be made less effective if source- eavesdropper wiretap channel is better than the main source-receiver channel. The various node cooperation schemes can be employed to combat this limitation where a relay node assists the communication to improve the performance significantly. In this paper, a four node wireless communication system consisting of a source, a destination, a relay and an eavesdropper as wire-tapper has been considered. The performance of the traditional cooperation schemes in terms of secrecy rate has been investigated with a different scenario where relay node helps the eavesdropper to deteriorate the secrecy rate. In addition, since legitimate receiver can overhear the transmission of relay, it favours the achievable secrecy rate. We formulate an analytical expression of conditional secrecy outage probability for the investigated system. From the obtained simulation results, it has been observed that secrecy rate is monotonically increases with path loss index. Furthermore, the proper selection of the system parameters leads to enhance the secrecy performance of the system even if relay pertains to degrade the performance. Amplify-and-forward, cooperation, decode-and-Forward, secrecy rate, relay.
In this paper, we propose information theoretic schemes that achieve the rate-equivocation regions for the multiple-access relay channel with confidential messages. This channel consists of two users that play the role of eavesdropper for each other's message and a relay that helps them to have a reliable and secure communication. The relay can itself be an eavesdropper of the users messages. The first coding scheme used for achievability is noise forwarding strategy and the second is the combination of noise forwarding with the compress and forward strategy. In the first one, relay cooperates with the users to have a confidential communication by sending codewords independent of the secret messages. In the second one, in addition to sending independent codewords, relay also sends compressed version of the received signals. Using these schemes, we derive the inner bounds for the capacity-equivocation region of the described model.
This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay–eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is derived. Several cooperation strategies are then 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 secrecy capacity 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.
We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario, an interesting question is whether the relay node should be deployed at all. That is, whether cooperation with an untrusted relay node can ever be beneficial. We first provide an achievable secrecy rate for the general untrusted relay channel, and proceed to investigate this question for two types of relay networks with orthogonal components. For the first model, there is an orthogonal link from the source to the relay. For the second model, there is an orthogonal link from the relay to the destination. For the first model, we find the equivocation capacity region and show that answer is negative. In contrast, for the second model, we find that the answer is positive. Specifically, we show, by means of the achievable secrecy rate based on compress-and-forward, that by asking the untrusted relay node to relay information, we can achieve a higher secrecy rate than just treating the relay as an eavesdropper. For a special class of the second model, where the relay is not interfering itself, we derive an upper bound for the secrecy rate using an argument whose net effect is to separate the eavesdropper from the relay. The merit of the new upper bound is demonstrated on two channels that belong to this special class. The Gaussian case of the second model mentioned above benefits from this approach in that the new upper bound improves the previously known bounds. For the Cover-Kim deterministic relay channel, the new upper bound finds the secrecy capacity when the source-destination link is not worse than the source-relay link, by matching with achievable rate we present.