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

Asilomar Conference on Signals, Systems and Computers (ACSSC)

MIMO wiretap channel with ISI heterogeneity — Achieving secure DoF with no CSI

Jean de Dieu Mutangana, Deepak Kumar, Ravi Tandon

Published Oct 1, 2017• 4 citations
Publisher

Abstract

We consider the multiple-input multiple-output (MIMO) wiretap channel with intersymbol interference (ISI) in which a transmitter (Alice) wishes to securely communicate with a receiver (Bob) in presence of an eavesdropper (Eve). We focus on the practically relevant setting in which there is no channel state information (CSI) at Alice about either of the channels to Bob or Eve, except statistical information about the ISI channels (i.e., Alice only knows the effective number of ISI taps). The key contribution of this work is to show that even with no CSI at Alice, positive secure degrees of freedom (SDoF) are achievable by carefully exploiting a) the heterogeneity of the ISI links to Bob and Eve, and b) the relative number of antennas at all the three terminals. To this end, we propose a novel achievable scheme that carefully mixes information and artificial noise symbols in order to exploit ISI heterogeneity to achieve positive SDoF. To the best of our knowledge, this is the first work to explore the idea of exploiting ISI channel length heterogeneity to achieve positive SDoF for the MIMO wiretap channel with no CSI at the legitimate transmitter.

DOI
10.1109/acssc.2017.8335647

Related papers

Blind MIMO Cooperative Jamming: Secrecy via ISI Heterogeneity Without CSIT

Jean de Dieu Mutangana, Ravi Tandon

We investigate the secure degrees of freedom (SDoF) of the multiple-input multiple-output (MIMO) wiretap channel with intersymbol interference (ISI) in the presence of a multi-antenna cooperative jammer. We focus on the practically relevant setting with no channel state information at the transmitters (CSIT). More specifically, the legitimate transmitter and the cooperative jammer only have statistical knowledge of the channel in terms of the effective number of ISI channel taps, i.e., channel impulse response (CIR) lengths, toward the legitimate receiver and the eavesdropper. Our main contribution is to show that in the absence of CSIT, positive SDoF can be achieved by carefully exploiting: 1) the heterogeneity of the CIR lengths toward both receivers and 2) the relative number of antennas at the four terminals. To achieve secrecy, we propose a scheme in which the transmitter strategically sends a mixture of information and artificial noise symbols in a way that exploits the heterogeneity of CIR lengths. Additionally, the cooperative jammer transmits artificial noise symbols in a way that completely masks all the information symbols that are received at the eavesdropping node. Under the proposed scheme, positive SDoF can be achieved, even when the number of antennas at the legitimate receiver is less than the number of antennas at the eavesdropper.

IEEE Transactions on Information Forensics and Security•Jun 17, 2019•4 citations

Blind Cooperative Jamming: Exploiting ISI Heterogeneity to Achieve Positive Secure DoF

Jean de Dieu Mutangana, Ravi Tandon, Namyoon Lee

We investigate secure degrees of freedom (SDoF) of a single-input single-output (SISO) wiretap channel with a single helper without channel state information at the transmitters (CSIT). Wireless communication systems inherently suffer from intersymbol interference (ISI) due to channel dispersion. In this paper, we propose a novel blind cooperative jamming scheme that exploits the ISI heterogeneity to achieve positive SDoF, even without any CSIT. In order to achieve positive SDoF, the proposed approach only requires statistical properties of the ISI channel. In particular, we show that if LB is the effective ISI channel multipath link length towards the legitimate receiver (Bob) and LE is the link length towards the eavesdropper (Eve), a positive SDoF of LB-LE is achievable. To the best of our 2(LB -1) knowledge, this is the first work that exploits ISI link length heterogeneity to achieve positive secure degrees of freedom.

Globecom•Dec 1, 2017•4 citations

Achieving full secure degrees-of-freedom for the MISO wiretap channel with an unknown eavesdropper

Mohaned Chraiti, Ali Ghrayeb, Chadi M. Assi

In this paper, we consider the achievable secure degrees-of-freedom (sdof) for the multiple-input single-output (MISO) wiretap channel with an unknown Eavesdropper's channel state information (CSI). The underlying system model comprises three nodes: a multi-antenna transmitter (Alice), a single-antenna receiver (Bob) and a single-antenna eavesdropper (Eve). Recent studies have shown that the achievable sdof in the sense of strong secrecy is zero when Eve's number of antennas is equal or more than Bob's number of antennas, which applies to the scenario considered in this paper. Moreover, using artificial noise, which deemed to be the only possible strategy to degrade Alice-Eve's channel when Eve's CSI is unknown, may no longer be efficient due to the recently introduced methods for managing interference in a one-dimensional space (e.g., real interference alignment). In this paper, we propose a novel precoding technique and a coding strategy that together achieve full sdof in the sense of strong secrecy without knowing Eve's CSI and without using artificial noise. The proposed precoding method uses the CSI of the Alice-Bob channel in a nonlinear fashion, which makes it difficult for Eve to decode even when Eve has the CSI of all channels, whereas the proposed coding scheme ensures strong secrecy.

IEEE Global Conference on Signal and Information Processing•Dec 1, 2016•4 citations

Secrecy DoF of Blind MIMOME Wiretap Channel With Delayed CSIT

Sina Lashgari, Amir Salman Avestimehr

We study the Gaussian multiple-input multiple-output multiple-eavesdropper wiretap channel where a transmitter wishes to communicate a confidential message to a legitimate receiver in the presence of eavesdroppers. Each node in the network is equipped with an 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 a 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 three important inequalities that provide lower bounds on the received signal dimensions at receivers which supply delayed CSIT or no CSIT. These inequalities together allow for analysis of signal dimensions in networks with heterogeneous CSIT; and as a result, we present a converse proof that leads to characterization of SDoF for all possible antenna configurations.

IEEE Transactions on Information Forensics and Security•Sep 25, 2017•12 citations

Secure Degrees of Freedom of MIMO Two-Way Wiretap Channel With no CSI Anywhere

Qingpeng Liang, Donglin Liu, Jiangping Hu

This article considers a two-way multiple-input multiple-output (MIMO) Rayleigh block fading wiretap channel with two full-duplex nodes (Alice and Bob) exchanging messages simultaneously and wiretapped by a $ {N}_{ {e}}$ -antennas eavesdropper (Eve). The channel state remains unchanged over a coherence interval T and is unknown to all terminals, including Alice, Bob, and Eve, at the beginning of the coherence interval. We first show the expression of the optimal signal waveform for Alice and Bob, which maximizes the sum secrecy rate, should be the products of independent random diagonal matrices and isotropically distributed unitary matrices. Then, conditioned on large T and small $ {N}_{ {e}}$ , the upper-bound for the secure degree of freedom (s.d.o.f.) of the two-way wiretap channel is derived, and a constant-norm-signaling (CNS) scheme is presented to achieve this theoretical bound. Finally, we formulate an optimization problem of the s.d.o.f. achieved by the CNS scheme for general cases with arbitrary T and $ {N}_{ {e}}$ , and solve this problem by exploring the monotonicity of the achievable s.d.o.f.. Our result shows that the optimal s.d.o.f. can be independent of coherence time T and becomes the product of the numbers of legitimate nodes's transmitter antennas (NLNTA) for large $ {N}_{ {e}}$ and small NLNTA.

IEEE Transactions on Wireless Communications•Aug 25, 2020•9 citations

Secrecy for MIMO wiretap and MIMO broadcast channels with fading eavesdroppers: CSI does not increase the secure DoF

Mohamed Amir, Tamer M. Khattab, Tarek Elfouly +1 more

We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitter and the receivers are available everywhere, while the legitimate pair have no information about the eavesdroppers' channels. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that cooperative jamming is SDoF optimal even without the eavesdropper CSI available at the transmitters.

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)•Aug 1, 2015•6 citations
We consider the multiple-input multiple-output (MIMO) wiretap channel with intersymbol interference (ISI) in which a transmitter (Alice) wishes to securely communicate with a receiver (Bob) in presence of an eavesdropper (Eve). We focus on the practically relevant setting in which there is no channel state information (CSI) at Alice about either of the channels to Bob or Eve, except statistical information about the ISI channels (i.e., Alice only knows the effective number of ISI taps). The key contribution of this work is to show that even with no CSI at Alice, positive secure degrees of freedom (SDoF) are achievable by carefully exploiting a) the heterogeneity of the ISI links to Bob and Eve, and b) the relative number of antennas at all the three terminals. To this end, we propose a novel achievable scheme that carefully mixes information and artificial noise symbols in order to exploit ISI heterogeneity to achieve positive SDoF. To the best of our knowledge, this is the first work to explore the idea of exploiting ISI channel length heterogeneity to achieve positive SDoF for the MIMO wiretap channel with no CSI at the legitimate transmitter.
We investigate the secure degrees of freedom (SDoF) of the multiple-input multiple-output (MIMO) wiretap channel with intersymbol interference (ISI) in the presence of a multi-antenna cooperative jammer. We focus on the practically relevant setting with no channel state information at the transmitters (CSIT). More specifically, the legitimate transmitter and the cooperative jammer only have statistical knowledge of the channel in terms of the effective number of ISI channel taps, i.e., channel impulse response (CIR) lengths, toward the legitimate receiver and the eavesdropper. Our main contribution is to show that in the absence of CSIT, positive SDoF can be achieved by carefully exploiting: 1) the heterogeneity of the CIR lengths toward both receivers and 2) the relative number of antennas at the four terminals. To achieve secrecy, we propose a scheme in which the transmitter strategically sends a mixture of information and artificial noise symbols in a way that exploits the heterogeneity of CIR lengths. Additionally, the cooperative jammer transmits artificial noise symbols in a way that completely masks all the information symbols that are received at the eavesdropping node. Under the proposed scheme, positive SDoF can be achieved, even when the number of antennas at the legitimate receiver is less than the number of antennas at the eavesdropper.
We investigate secure degrees of freedom (SDoF) of a single-input single-output (SISO) wiretap channel with a single helper without channel state information at the transmitters (CSIT). Wireless communication systems inherently suffer from intersymbol interference (ISI) due to channel dispersion. In this paper, we propose a novel blind cooperative jamming scheme that exploits the ISI heterogeneity to achieve positive SDoF, even without any CSIT. In order to achieve positive SDoF, the proposed approach only requires statistical properties of the ISI channel. In particular, we show that if LB is the effective ISI channel multipath link length towards the legitimate receiver (Bob) and LE is the link length towards the eavesdropper (Eve), a positive SDoF of LB-LE is achievable. To the best of our 2(LB -1) knowledge, this is the first work that exploits ISI link length heterogeneity to achieve positive secure degrees of freedom.
In this paper, we consider the achievable secure degrees-of-freedom (sdof) for the multiple-input single-output (MISO) wiretap channel with an unknown Eavesdropper's channel state information (CSI). The underlying system model comprises three nodes: a multi-antenna transmitter (Alice), a single-antenna receiver (Bob) and a single-antenna eavesdropper (Eve). Recent studies have shown that the achievable sdof in the sense of strong secrecy is zero when Eve's number of antennas is equal or more than Bob's number of antennas, which applies to the scenario considered in this paper. Moreover, using artificial noise, which deemed to be the only possible strategy to degrade Alice-Eve's channel when Eve's CSI is unknown, may no longer be efficient due to the recently introduced methods for managing interference in a one-dimensional space (e.g., real interference alignment). In this paper, we propose a novel precoding technique and a coding strategy that together achieve full sdof in the sense of strong secrecy without knowing Eve's CSI and without using artificial noise. The proposed precoding method uses the CSI of the Alice-Bob channel in a nonlinear fashion, which makes it difficult for Eve to decode even when Eve has the CSI of all channels, whereas the proposed coding scheme ensures strong secrecy.
We study the Gaussian multiple-input multiple-output multiple-eavesdropper wiretap channel where a transmitter wishes to communicate a confidential message to a legitimate receiver in the presence of eavesdroppers. Each node in the network is equipped with an 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 a 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 three important inequalities that provide lower bounds on the received signal dimensions at receivers which supply delayed CSIT or no CSIT. These inequalities together allow for analysis of signal dimensions in networks with heterogeneous CSIT; and as a result, we present a converse proof that leads to characterization of SDoF for all possible antenna configurations.
This article considers a two-way multiple-input multiple-output (MIMO) Rayleigh block fading wiretap channel with two full-duplex nodes (Alice and Bob) exchanging messages simultaneously and wiretapped by a $ {N}_{ {e}}$ -antennas eavesdropper (Eve). The channel state remains unchanged over a coherence interval T and is unknown to all terminals, including Alice, Bob, and Eve, at the beginning of the coherence interval. We first show the expression of the optimal signal waveform for Alice and Bob, which maximizes the sum secrecy rate, should be the products of independent random diagonal matrices and isotropically distributed unitary matrices. Then, conditioned on large T and small $ {N}_{ {e}}$ , the upper-bound for the secure degree of freedom (s.d.o.f.) of the two-way wiretap channel is derived, and a constant-norm-signaling (CNS) scheme is presented to achieve this theoretical bound. Finally, we formulate an optimization problem of the s.d.o.f. achieved by the CNS scheme for general cases with arbitrary T and $ {N}_{ {e}}$ , and solve this problem by exploring the monotonicity of the achievable s.d.o.f.. Our result shows that the optimal s.d.o.f. can be independent of coherence time T and becomes the product of the numbers of legitimate nodes's transmitter antennas (NLNTA) for large $ {N}_{ {e}}$ and small NLNTA.
We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitter and the receivers are available everywhere, while the legitimate pair have no information about the eavesdroppers' channels. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that cooperative jamming is SDoF optimal even without the eavesdropper CSI available at the transmitters.