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

IEEE Information Theory Workshop (ITW)

Secure Communication with a Relay Helping the Wire-tapper

Melda Yüksel, Elza Erkip

Published Sep 1, 2007• 67 citations
Publisher

Abstract

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.

DOI
10.1109/itw.2007.4313141

Related papers

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

Yayan Ma, Bao Jing, Junxi Zhao +1 more

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.

International Conference on Wireless Communications and Signal Processing (WCSP)•Nov 1, 2011•2 citations

A Secure Communication Game with a Relay Helping the Eavesdropper

Melda Yüksel, Xi Liu, Elza Erkip

In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved secrecy rate. For this game the Nash Equilibrium is generally achieved with mixed strategies. The optimal cumulative distribution functions for the source and the jammer relay that achieve the value of the game, which is the equilibrium secrecy rate, are found.

arXiv:0911.0089•Oct 31, 2009•0 citations

Optimal power allocation schemes for single-relay af wire-tap channels

Leonardo Jimenez Rodriguez, Nghi Huu Tran, Tho Le‐Ngoc

This paper considers the wire-tap channel in which a source node communicates to a destination node with the help of a single amplify-and-forward (AF) relay and in the presence of an eavesdropper. The secrecy capacity and respective optimal power allocation scheme at the source and relay are investigated under both individual and joint power constraints. Given that the links among the nodes might not always be available for transmission (e.g., due to heavy shadowing), several network topologies are considered. These include combinations of dual-hop, orthogonal AF and direct transmission schemes. To deal with the non-concave optimization problems in solving the optimal power allocation schemes, we first propose an analytical approach based on Descartes' rule of signs. It is then shown that the power allocation strategies that maximize the secrecy rates can be obtained in closed form. Simulation results are finally provided to verify the optimality of the proposed schemes.

International Conference on Communications and Electronics (ICCE)•Jul 1, 2014•4 citations

A secure communication game with a relay helping the eavesdropper

Melda Yüksel, Xi Liu, Elza Erkip

In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved secrecy rate. For this game the Nash equilibrium is generally achieved with mixed strategies. The optimal cumulative distribution functions for the source and the jammer relay that achieve the value of the game, which is the equilibrium secrecy rate, are found.

IEEE Information Theory Workshop (ITW)•Jan 1, 2009•13 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

A Secure Communication Game With a Relay Helping the Eavesdropper

M. Yuksel, Xi Liu, E. Erkip

In this work, a four-terminal complex Gaussian network composed of a source, a destination, an eavesdropper, and a jammer relay is studied under two different set of assumptions: 1) The jammer relay does not hear the source transmission, and 2) The jammer relay is causally given the source message. In both cases, the jammer relay assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase it. To help the eavesdropper, the jammer relay can use pure relaying and/or send interference. Each of the problems is formulated as a two-player, noncooperative, zero-sum continuous game. Assuming Gaussian strategies at the source and the jammer relay in the first problem, the Nash equilibrium is found and shown to be achieved with mixed strategies in general. The optimal cumulative distribution functions (cdfs) for the source and the jammer relay that achieve the value of the game, which is the Nash equilibrium secrecy rate, are found. For the second problem, the Nash equilibrium solution is found and the results are compared to the case when the jammer relay is not informed about the source message.

arXiv:1103.1306•IEEE Transactions on Information Forensics and Security•Mar 15, 2011•56 citations
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.
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.
In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved secrecy rate. For this game the Nash Equilibrium is generally achieved with mixed strategies. The optimal cumulative distribution functions for the source and the jammer relay that achieve the value of the game, which is the equilibrium secrecy rate, are found.
This paper considers the wire-tap channel in which a source node communicates to a destination node with the help of a single amplify-and-forward (AF) relay and in the presence of an eavesdropper. The secrecy capacity and respective optimal power allocation scheme at the source and relay are investigated under both individual and joint power constraints. Given that the links among the nodes might not always be available for transmission (e.g., due to heavy shadowing), several network topologies are considered. These include combinations of dual-hop, orthogonal AF and direct transmission schemes. To deal with the non-concave optimization problems in solving the optimal power allocation schemes, we first propose an analytical approach based on Descartes' rule of signs. It is then shown that the power allocation strategies that maximize the secrecy rates can be obtained in closed form. Simulation results are finally provided to verify the optimality of the proposed schemes.
In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved secrecy rate. For this game the Nash equilibrium is generally achieved with mixed strategies. The optimal cumulative distribution functions for the source and the jammer relay that achieve the value of the game, which is the equilibrium secrecy rate, are found.
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 work, a four-terminal complex Gaussian network composed of a source, a destination, an eavesdropper, and a jammer relay is studied under two different set of assumptions: 1) The jammer relay does not hear the source transmission, and 2) The jammer relay is causally given the source message. In both cases, the jammer relay assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase it. To help the eavesdropper, the jammer relay can use pure relaying and/or send interference. Each of the problems is formulated as a two-player, noncooperative, zero-sum continuous game. Assuming Gaussian strategies at the source and the jammer relay in the first problem, the Nash equilibrium is found and shown to be achieved with mixed strategies in general. The optimal cumulative distribution functions (cdfs) for the source and the jammer relay that achieve the value of the game, which is the Nash equilibrium secrecy rate, are found. For the second problem, the Nash equilibrium solution is found and the results are compared to the case when the jammer relay is not informed about the source message.