Blind MIMO wiretap channel with delayed CSIT

IEEE Trans.Inform.Forensic Secur.

2018

Self Cite

We study the Gaussian MIMOME wiretap channel where a transmitter wishes to communicate a confidential message to a legitimate receiver in the presence of eavesdroppers, while the eavesdroppers should not be able to decode the confidential message. Each node in the network is equipped with arbitrary number of antennas.Furthermore, channels are time varying, and there is no channel state information available at the transmitter (CSIT) with respect to eavesdroppers' channels; and transmitter only has access to delayed CSIT of the channel to the legitimate receiver. The secure degrees of freedom (SDoF) for such network has only been characterized for special cases, and is unknown in general. We completely characterize the SDoF of this network for all antenna configurations.In particular, we strictly improve the state-of-the-art achievable scheme for this network by proposing more efficient artificial noise alignment at the receivers. Furthermore, we develop a tight upper bound by utilizing 4 important inequalities that provide lower bounds on the received signal dimensions at receivers which supply delayed CSIT or no CSIT, or at a collection of receivers where some supply no CSIT. These inequalities together allow for analysis of signal dimensions in networks with asymmetric CSIT; and as a result, we present a converse proof that leads to characterization of SDoF for all possible antenna configurations.

show abstract

“…In other words, Rx max is the eavesdropper with the most number of antennas (n max antennas). 2 Tx has a secret message for Rx 1 (legitimate receiver), while Rx 2 , . .…”

Section: System Model and Main Resultsmentioning

confidence: 99%

Section: Proof Of Achievabilitymentioning

confidence: 97%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Secrecy DoF of Blind MIMOME Wiretap Channel With Delayed CSIT

IEEE Trans.Inform.Forensic Secur.

2018

Self Cite

show abstract

“…Remark 7. Lemma 3 can be seen as a variation of the corresponding result in the context of secrecy problems in [22], [23]. Moreover, as shown in [19], Least Alignment Lemma also holds for non-linear schemes; and for this extension the reader is referred to [19].…”

Section: A Proof Of Converse For 3-user Miso Broadcast Channel With mentioning

confidence: 97%

MISO Broadcast Channel With Hybrid CSIT: Beyond Two Users

Tandon

IEEE Trans. Inform. Theory

2016

Self Cite

We study the impact of heterogeneity of channel-state-information available at the transmitters (CSIT) on the capacity of broadcast channels with a multiple-antenna transmitter and k single-antenna receivers (MISO BC). In particular, we consider the k-user MISO BC, where the CSIT with respect to each receiver can be either instantaneous/perfect, delayed, or not available; and we study the impact of this heterogeneity of CSIT on the degreesof-freedom (DoF) of such network. We first focus on the 3-user MISO BC; and we completely characterize the DoF region for all possible heterogeneous CSIT configurations, assuming linear encoding strategies at the transmitters. The result shows that the state-of-the-art achievable schemes in the literature are indeed sum-DoF optimal, when restricted to linear encoding schemes. To prove the result, we develop a novel bound, called Interference Decomposition Bound, which provides a lower bound on the interference dimension at a receiver which supplies delayed CSIT based on the average dimension of constituents of that interference, thereby decomposing the interference into its individual components. Furthermore, we extend our outer bound on the DoF region to the general k-user MISO BC, and demonstrate that it leads to an approximate characterization of linear sum-DoF to within an additive gap of 0.5 for a broad range of CSIT configurations. Moreover, for the special case where only one receiver supplies delayed CSIT, we completely characterize the linear sum-DoF.This work has been presented in part in [1], [2].

show abstract

Transmitter cooperation in interference channel with delayed CSIT

2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)

2014