Secure communications can be impeded by eaves-droppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay net-work can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jamming scheme is proposed that shows significant improvement in terms of secrecy rate com-pared to the approach without jamming. Furthermore, the case involving an eavesdropper with unknown CSI is also investigated in this paper. Simulation results show that the secrecy rate is dramatically increased when inactive nodes in the relay network participate in cooperative jamming.

Abstract—This paper studies robust transmission schemes for MISO wiretap channels with imperfect channel state information (CSI) for the eavesdropper link. Both the cases of direct transmis-sion and cooperative jamming with a helper are investigated. The error in the eavesdropper’s CSI is assumed to be norm-bounded, and robust transmit covariance matrices are obtained based on worst-case secrecy rate maximization, under both individual and global power constraints. Numerical results show the advantage of the proposed robust design. In particular, under a global power constraint, although cooperative jamming is not necessary for optimal transmission with perfect eavesdropper’s CSI, we show that robust jamming support can increase the secrecy rate in the presence of channel mismatch. I.

This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers, with-out relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical layer message authentication is also briefly introduced. The survey concludes with observations on potential research directions in this area.

We study the Gaussian MIMO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, each equipped with multiple antennas. The transmitter sends confidential messages to its intended receiver, while the helper transmits jamming signals independent of the source message to confuse the eavesdropper. The jamming signal is assumed to be treated as noise at both the intended receiver and the eavesdropper. We obtain a closed-form expression for the structure of the artificial noise covariance matrix that guarantees a secrecy rate larger or at least equal to the secrecy capacity of the wiretap channel with no jamming signal. We also describe how to find specific realizations of this covariance matrix expression that provide good secrecy rate performance, even when there is no nontrivial null space between the helper and the intended receiver. Unlike prior work, our approach considers the general MIMO case, and is not restricted to SISO or MISO scenarios.

We consider a source (Alice) trying to communicate with a destination (Bob), in a way that an unauthorized node (Eve) cannot infer, based on her observations, the information that is being transmitted. The communication is assisted by multiple multi-antenna cooperating nodes (helpers) who have the abil-ity to move. While Alice transmits, the helpers transmit noise that is designed to affect the entire space except Bob. We consider the problem of selecting the helper weights and po-sitions that maximize the system secrecy rate. It turns out that this optimization problem can be efficiently solved, leading to a novel decentralized helper motion control scheme. Simu-lations indicate that introducing helper mobility leads to con-siderable savings in terms of helper transmit power, as well as total number of helpers required for secrecy communications.

Abstract—This paper studies a multi-antenna wiretap channel with a passive eavesdropper and an external helper, where only quantized channel information regarding the legitimate receiver is available at the transmitter and helper due to finite-rate feedback. Given a fixed total bandwidth for the two feedback channels, the receiver must determine how to allocate its feedback bits to the transmitter and helper. Assuming zero-forcing transmission at the helper and random vector quantization of the channels, an ana-lytic expression for the achievable ergodic secrecy rate due to the resulting quantization errors is derived. While direct optimization of the secrecy rate is difficult, an approximate upper bound for the mean loss in secrecy rate is derived and a feedback bit allocation method that minimizes the average upper bound on the secrecy rate loss is studied. A closed-form solution is shown to be possible if the integer constraint on the bit allocation is relaxed. Numerical simulations indicate the significant advantage that can be achieved by adaptively allocating the available feedback bits. Index Terms—Cooperative jamming, feedback bits allocation, limited feedback, MISO wiretap channel. I.

We study the Gaussian MISO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, where the transmitter and the helper have an arbitrary number of antennas but the intended receiver and the eaves-dropper have only one antenna. The transmitter sends confidential messages to its intended receiver, while the helper transmits jamming signals independent of the source message to confuse the eavesdropper. The jamming signal is assumed to be treated as noise at both the intended receiver and the eavesdropper. Assuming Gaussian signaling at the helper, we obtain the optimal beamformers at the transmitter and the helper that achieve the secrecy capacity.

The use of physical layer methods for improving the security of wireless links has recently become the focus of a considerable research effort. Such methods can be used in combination with cryptography to enhance the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers, or they can be used to enable secrecy in the absence of shared secret keys through the use of coding strategies, jamming or beamforming. Indeed, one of the driving forces behind the recent emergence of physical layer techniques for security is the push toward adding extra degrees of freedom in the form of multiple antennas at the transmitter and receiver of the link. Multiple-input multiple-output (MIMO) wireless systems have been extensively studied during the past two decades, and their potential gains in throughput, diversity, and range have been well quantified. MIMO approaches are now an integral part of the WiFi and 4G standards in use today. It is not surprising that MIMO architectures are useful in improving wireless security as well, since they can provide focused transmit selectivity of both information and noise toward desired and undesired receivers. In this chapter, we discuss a number of different ways that physical layer security can be achieved in wireless networks with MIMO links. We will focus primarily on signal processing related issues (e.g., beamforming, power control, resource allocation) that enable reliable reception at intended recipients and minimize data leakage to eavesdroppers, and we will consider a variety of different MIMO settings including point-to-point, broadcast, interference, and multi-hop networks. We cannot offer an exhaustive survey of such methods in just a single chapter; instead, we present a few representative approaches that illustrate

Abstract—This paper addresses secure communications over MIMO wiretap channels with the help of multiple cooperative jammers. The worst-case scenario for Alice, Bob and jammers is considered: Eve has the knowledge of all channel matrices, while neither her channel matrix nor her location is known to the remaining terminals. We propose an artificial noise aided cooperative jamming (AN-CJ) scheme, allowing the total jamming signals to be nulled at Bob. The new scheme is valid for the case where the eavesdropper has more antennas than the transmitter. To evaluate the performance of the AN-CJ scheme, we first derive a closed-form expression for the achievable ergodic secrecy rate with Gaussian input alphabets. Then, we show how Gaussian input alphabets achieve the ergodic secrecy capacity. I.

Abstract—Secure relay and jammer selection for physical-layer security is studied in a wireless network with multiple interme-diate nodes and eavesdroppers, where each intermediate node ei-ther helps to forward messages as a relay, or broadcasts noise as a jammer.We derive a closed-form expression for the secrecy outage probability (SOP), and we develop two relay and jammer selection methods for SOP minimization. In both methods a selection vector and a corresponding threshold are designed and broadcast by the destination to ensure each intermediate node knows its own role while knowledge of the relay and jammer set is kept secret from all eavesdroppers. Simulation results show the SOP of the proposed methods are very close to that obtained by an exhaustive search, and that maintaining the privacy of the selection result greatly im-proves the SOP performance. Index Terms—Cooperative jamming, physical layer security, relay selection, secrecy outage probability. I.