Adding a Helper Can Totally Remove the Secrecy Constraints in Interference Channel

12/03/2018
by   Jinyuan Chen, et al.
0

In many communication channels, secrecy constraints usually incur a penalty in capacity, as well as generalized degrees-of-freedom (GDoF). In this work we show an interesting observation that, adding a helper can totally remove the penalty in sum GDoF, for a two-user symmetric Gaussian interference channel. For the interference channel where each transmitter sends a message to an intended receiver without secrecy constraints, the sum GDoF is a well-known "W" curve, characterized by Etkin-Tse-Wang in 2008. If the secrecy constraints are imposed on this interference channel, where the message of each transmitter must be secure from the unintended receiver (eavesdropper), then a GDoF penalty is incurred and the secure sum GDoF is reduced to a modified "W" curve, derived by Chen recently. In this work we show that, by adding a helper into this interference channel with secrecy constraints, the secure sum GDoF turns out to be a "W" curve, which is the same as the sum GDoF of the setting without secrecy constraints. The proposed scheme is based on the cooperative jamming and a careful signal design such that the jamming signal of the helper is aligned at a specific direction and power level with the information signals of the transmitters, which allows to totally remove the penalty in GDoF due to the secrecy constraints. Furthermore, the estimation approaches of noise removal and signal separation due to the rational independence are used in the secure rate analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/26/2018

Optimal Secure GDoF of Symmetric Gaussian Wiretap Channel with a Helper

We study a symmetric Gaussian wiretap channel with a helper, where a con...
research
07/10/2019

Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks

In communication networks secrecy constraints usually incur an extra lim...
research
11/25/2020

Secure GDoF of the Z-channel with Finite Precision CSIT: How Robust are Structured Codes?

Under the assumption of perfect channel state information at the transmi...
research
03/24/2020

Increasing Security Degree of Freedom in Multi-user and Multi-eve Systems

Secure communication in the Multi-user and Multi-eavesdropper (MUME) sce...
research
12/16/2022

Innovation-Based Remote State Estimation Secrecy with no Acknowledgments

Secrecy encoding for remote state estimation in the presence of adversar...
research
04/14/2020

Scalable Security in Interference Channels With Arbitrary Number of Users

In this paper, we present an achievable security scheme for an interfere...
research
08/08/2019

Rethinking Secure Precoding via Interference Exploitation: A Smart Eavesdropper Perspective

Based on the concept of constructive interference (CI), multiuser interf...

Please sign up or login with your details

Forgot password? Click here to reset