Secrecy Degrees Of Freedom Research Articles

MIMO Secret Communications Against an Active Eavesdropper

This paper considers a scenario in which an Alice – Bob pair wishes to communicate in secret in the presence of an active Eve , who is capable of jamming as well as eavesdropping and operates in full-duplex (FD) mode. As countermeasure, Bob operates in FD mode, using a subset of its antennas to receive, and the remaining antennas to transmit jamming noise. Alice and Bob employ linear precoding, and all nodes use Gaussian code books. In that context, our goal is to maximize the achievable secrecy degrees of freedom (S.D.o.F.) of the system. We provide the optimal receive/transmit antennas allocation at Bob , based on which we determine in closed form the maximum achievable S.D.o.F. We also provide a method for constructing the precoding matrices of Alice and Bob , based on which the maximum S.D.o.F. can be achieved. We further investigate the adverse scenario in which Eve knows Bob ’s transmission strategy and optimizes its transmit/receive antennas allocation in order to minimize the achievable S.D.o.F. For that case, we find the worst case achievable S.D.o.F. Numerical results validate the theoretical findings and demonstrate the performance of the proposed method.

Physical-Layer Security With Full-Duplex Transceivers and Multiuser Receiver at Eve

Full-duplex communication enables simultaneous transmission from both ends of a communication link, thereby promising significant performance gains. Generally, it has been shown that the throughput and delay gains of full-duplex communication are somewhat limited in realistic network settings, leading researchers to study other possible applications that can accord higher gains. The potential of full-duplex communication in improving the physical-layer security of a communication link is investigated in this contribution. We specifically present a thorough analysis of the achievable ergodic secrecy rate and the secrecy degrees of freedom with full-duplex communication in the presence of a half-duplex eavesdropper node, with both single-user decoding and multi-user decoding capabilities. For the latter case, an eavesdropper with successive interference cancellation and joint decoding capabilities is assumed. Irrespective of the eavesdropper capabilities and channel strengths, the ergodic secrecy rate with full-duplex communication is found to grow linearly with the log of the direct channel signal-to-noise-ratio (SNR) as opposed to the flattened out secrecy rate with conventional half-duplex communication. Consequently, the secrecy degrees of freedom with full-duplex is shown to be two as opposed to that of zero in half-duplex mode.

Improving Wireless Physical Layer Security via Exploiting Co-Channel Interference

This paper considers a scenario in which a source-destination pair needs to establish a confidential connection against an external eavesdropper, aided by the interference generated by another source-destination pair that exchanges public messages. The goal is to compute the maximum achievable secrecy degrees of freedom (S.D.o.F) region of a MIMO two-user wiretap network. First, a cooperative secrecy transmission scheme is proposed, whose feasible set is shown to achieve all S.D.o.F. pairs on the S.D.o.F. region boundary. In this way, the determination of the S.D.o.F. region is reduced to a problem of maximizing the S.D.o.F. pair over the proposed transmission scheme. The maximum achievable S.D.o.F. region boundary points are obtained in closed form, and the construction of the precoding matrices achieving the maximum S.D.o.F. region boundary is provided. The obtained analytical expressions clearly show the relation between the maximum achievable S.D.o.F. region and the number of antennas at each terminal.

Secrecy Degrees of Freedom of the 2 <inline-formula> <tex-math notation="TeX">$\times$</tex-math></inline-formula> 2 <inline-formula> <tex-math notation="TeX">$\times$</tex-math></inline-formula> 2 Interference Channel With Delayed CSIT

We consider the two-hop interference channel with confidential messages (ICC), where each transmitter sends one confidential message to its intended destination through two trusted relays. We study the secrecy degrees of freedom (SDoF) of the considered 2 ?2 ?2 ICC with delayed channel state information at transmitters (CSIT). We settle the optimal SDoF of the considered network to be (1/2, 1/2). Thus, the considered network has a strictly larger sum SDoF than a two-user one-hop ICC with even full CSIT. Moreover, we study the SDoF of the network with limited Shannon feedback, that only one relay can obtain the delayed CSIT and output feedback from the destinations. The optimal SDoF is also shown to be (1/2, 1/2), revealing that only limited feedback can also bring SDoF gain. Our proposed achievable schemes in both cases are integrated forms of the retrospective interference alignment and artificial noise transmission.

MIMO Multiple Access Channel With an Arbitrarily Varying Eavesdropper: Secrecy Degrees of Freedom

A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices of the legitimate users are fixed and revealed to all the terminals, whereas the channel matrices of the eavesdropper are arbitrarily varying and only known to the eavesdropper. The secrecy degrees of freedom (s.d.o.f.) region under a strong secrecy constraint is characterized. A transmission scheme that orthogonalizes the transmit signals of the two users at the intended receiver, and uses a single-user wiretap code for each user, is shown to achieve the s.d.o.f. region. The converse involves establishing an upper bound on a weighted-sum-rate expression. This is accomplished by using induction, where at each step one combines the secrecy and multiple-access constraints associated with an adversary eavesdropping a carefully selected group of sub-channels.

Secrecy Degrees of Freedom of MIMO Broadcast Channels With Delayed CSIT

The degrees of freedom (DoF) of the two-user Gaussian multiple-input and multiple-output (MIMO) broadcast channel with confidential message (BCC) is studied under the assumption that delayed channel state information (CSI) is available at the transmitter. We characterize the optimal secrecy DoF (SDoF) region and show that it can be achieved by a simple artificial noise alignment (ANA) scheme. The proposed scheme sends the confidential messages superposed with the artificial noise over several time slots. Exploiting delayed CSI, the transmitter aligns the signal in such a way that the useful message can be extracted at the intended receiver but is completely drowned by the artificial noise at the unintended receiver. The proposed scheme can be interpreted as a non-trivial extension of Maddah-Ali Tse (MAT) scheme and enables us to quantify the resource overhead, or equivalently the DoF loss, to be paid for the secrecy communications.