On the Secure Degrees of Freedom of the K-user Interference Channel with Delayed CSIT

01/10/2018
by   Mohamed Seif, et al.
0

In this paper, the K-user interference channel with confidential messages is considered with delayed channel state information at transmitters (CSIT). We propose a novel secure transmission scheme in which the transmitters carefully mix information symbols with artificial noises to ensure confidentiality. Achieving confidentiality is challenging due to the delayed nature of CSIT, and the distributed nature of the transmitters. Our scheme works over two phases: phase one in which each transmitter sends information symbols mixed with artificial noises, and repeats such transmission over multiple rounds. In the next phase, each transmitter uses delayed CSIT of the previous phase and sends a function of the net interference and artificial noises (generated in previous phase), which is simultaneously useful for all receivers. These phases are designed to ensure the decodability of the desired messages while satisfying the confidentiality constraints. The proposed scheme achieves a sum SDoF of at least 1/2 (√(K) -6) . To the best of our knowledge, this is the first result on the K-user interference channel with confidential messages and delayed CSIT that achieves a SDoF which scales with K.

READ FULL TEXT
research
11/02/2020

On Sum Secure Degrees of Freedom for K-User MISO Broadcast Channel With Alternating CSIT

In this paper, the sum secure degrees of freedom (SDoF) of the K-user Mu...
research
10/19/2017

Artificial-Noise-Aided Secure Channel with a Full-duplex Source

This paper consider a new secure communication scene where a full-duplex...
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
08/04/2018

A Blockchain Example for Cooperative Interference Management

We present an example where a distributed coordinated protocol supported...
research
08/27/2018

Opportunistic Treating Interference as Noise

We consider a K-user interference network with M states, where each tran...
research
04/14/2020

Towards Scalable Security in Interference Channels With Arbitrary Number of Users

In this paper, we present an achievable security scheme for an interfere...
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...

Please sign up or login with your details

Forgot password? Click here to reset