CRC Press eBooks

Physical Layer Security in Wireless Networks

Emad S. Hassan

Published Apr 27, 2018• 2 citations

Abstract

Due to the broadcast nature of wireless communications, it is difficult to shield transmitted signals from adversarial users in the coverage area of the transmission. This chapter highlights many issues concerned with achieving secrecy in the physical layer. It discusses overview of the foundations dating back to the pioneering key-based Shannon and keyless Wyner–Ziv works on information-theoretic security. In 1978, Leung-Yang-Cheong and Hellman considered the Gaussian wiretap channel. The chapter introduces multiformity of cooperative jamming techniques to show the effectiveness of jamming signals transmitted by some legitimate transmitters in a network of multiple transmitters and receivers in achieving physical layer security for a certain legitimate pair. It gives the idea of employing cooperative jammers in a multiple trusted/untrusted relay networks in order to improve security, and the interactions arising between cooperation and secrecy in the presence of untrusted relays are adopted. A resurgence of interest in aspects of secrecy at the physical layer has been experienced.

DOI: 10.1201/9781315106106-3

Related papers

Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey

Amitav Mukherjee, S. Ali. A. Fakoorian, Jing Huang +1 more

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, without 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.

arXiv:1011.3754IEEE Communications Surveys & TutorialsJan 1, 20141,488 citations

Relaying and physical layer security

Raef Bassily, Şennur Ulukuş

In this chapter, we investigate the problem of physical-layer security in wireless networks with cooperative relays. In Sections 11.2 and 11.3, we study the notion of deaf cooperation to reinforce security of transmission in wireless relay networks. We distinguish between two main approaches to deaf cooperation, namely, the cooperative jamming (CJ) approach and the noise forwarding (NF) approach. In a CJ scheme, a helping interferer transmits Gaussian noise when it can hurt the eavesdropper more than it can hurt the legitimate receiver, and hence improves the achievable secure information rate. The idea of introducing artificial noise in a Gaussian wiretap channel by a helper node was introduced in References 5-7. In relay networks with secrecy constraints, the role of CJ was further investigated, e.g., in References 8-10. References 11-13 proposed CJ strategies for multiple-antenna relay networks. On the other hand, in the NF scheme which was introduced in Reference 14, the relay node sends a dummy (context-free) codeword drawn at random from a codebook that is known to both the legitimate receiver and the eavesdropper to introduce helpful interference that would hurt the eavesdropper more than the legitimate receiver.

Institution of Engineering and Technology eBooksJun 2, 20160 citations

Alignment and Cooperation for Secrecy in Multi-User Channels

Raef Bassily

The study of the physical layer has offered a new perspective to the problem of communication security. This led to the development of a vast set of ideas and techniques rooted in information theory which can be employed in practice to provide unbreakable security. The information-theoretic approach relies mainly on the physical nature of the communication medium. In a wireless medium, the unique features of the wireless communication channel, such as its fading and broadcast nature, can be exploited to achieve higher secure information rates. In this dissertation, we study the secure transmission problem in wireless channels from an information-theoretic perspective. We first consider the fading multiple access wiretap channel. We give two new achievable schemes that use the time-varying (fading) nature of the channel to align the interference from different users at the eavesdropper perfectly in a one-dimensional space while creating a higher-dimensional space for the interfering signals at the legitimate receiver hence allowing for better chance of recovery. While we achieve this alignment through signal scaling at the transmitters in our first scheme (scaling based alignment), we let nature provide this alignment through the ergodicity of the channel coefficients in the second scheme (ergodic secret alignment). For each scheme, we show that the achievable secrecy rates scale logarithmically with the signal-to-noise ratio (SNR). Next, we study the security gains that can be achieved in a wireless network by employing cooperation among the nodes which is possible due to the broadcast nature of the wireless channel. We investigate the role of passive (also known as deaf) cooperation in improving the achievable secrecy rates in a Gaussian multiple relay network with an external eavesdropper. We distinguish between two modes of deaf cooperation, namely, cooperative jamming (CJ) and noise forwarding (NF). We derive the conditions in which each mode of deaf cooperation achieves secrecy rates that are higher than the secrecy capacity of the original Gaussian wiretap channel. As a result, we show that a deaf helper cannot be a useful cooperative jammer and noise forwarder at the same time. We derive the optimal power control policy for each mode. We consider the deaf helper selection problem where a fixed-size set of deaf helpers (possibly operating in different modes) are to be selected from the set of available relays so that the achievable secrecy rate is maximized. We propose a simple and efficient suboptimal strategy for selection which is shown to be optimal when only one helper is selected. Furthermore, we study the role of a multi-antenna deaf helper. Unlike the single antenna case, we show that, in general, it is useful to split the helper's power between cooperative jamming and noise forwarding. Hence, we propose a deaf cooperation strategy for this model and derive its optimal power control policy. We also show, for specific class of relay-eavesdropper channels, that a simple cooperative jamming strategy yields a secrecy rate that approaches the secrecy capacity as the helper's power is increased. Finally, we consider the role of active cooperation for secrecy in the multiple relay networks. We propose several relaying strategies for secure communication and derive the achievable secrecy rate for each strategy. In our strategies the relays decode the source signal and then forward it to the destination either in a single-hop or a multi-hop fashion. Each relay scales its transmitted signal in a way that ensures that signal components from different relays are canceled out at the eavesdropper.

Jan 1, 20110 citations

Information-theoretic Secrecy in Multi-user Channels

Ersen Ekrem

Inherent openness of the wireless medium imposes stronger challenges on the security of wireless communications. Information-theoretic security addresses these challenges at the physical layer by using tools from wireless communication theory, signal processing and information theory. In information-theoretic security, physical layer communication is intelligently designed to exploit the characteristics of the wireless medium, such as fading, interference, cooperation, and multi-dimensional signaling, in order to provide or improve security. In this dissertation, we study the security of several fundamental wireless network configurations from an information-theoretic perspective. First, we study the Gaussian multiple-input multiple-output (MIMO) wiretap channel. In this channel, the transmitter sends a common message to both the legitimate user and the eavesdropper. In addition to the common message, a private message is sent only to the legitimate user, which needs to be kept hidden as much as possible from the eavesdropper. We obtain the entire capacity-equivocation region for this channel model. In particular, we show the sufficiency of jointly Gaussian auxiliary random variables and channel input to evaluate the existing single-letter description of the capacity-equivocation region due to Csiszar-Korner. Next, we study the secure broadcasting problem, where a transmitter wants to have secure communication with multiple legitimate users in the presence of an external eavesdropper. We study several special cases of the secure broadcasting problem. First, we consider the degraded multi-receiver wiretap channel, and establish its secrecy capacity region. Second, we consider the parallel less noisy multi-receiver wiretap channel, and obtain its common message secrecy capacity and sum secrecy capacity. Third, we consider the parallel degraded multi-receiver wiretap channel for the two-user and two-sub-channel case, and obtain its entire secrecy capacity region. Finally, we consider a parallel channel model with two sub-channels, where the transmitter can use only one of the subchannels at any time, and characterize its secrecy capacity region. Then, we study the two-user Gaussian MIMO broadcast channel with common and confidential messages. In this channel model, the transmitter sends a common message to both users, and a confidential message to each user which needs to be kept perfectly secret from the other user. We obtain the entire capacity region of this channel. We also explore the connections between this channel model and its non-confidential counterpart, i.e., the Gaussian MIMO broadcast channel with common and private message. Next, we consider the Gaussian MIMO multi-receiver wiretap channel and obtain its secrecy capacity region for the most general case. We first show that even for the single-input single-output (SISO) case, existing converse techniques fall short of proving the secrecy capacity region, to emphasize the need for a new proof technique, which we develop by using the relationships between the Fisher information and the differential entropy. Using this new proof technique, we obtain the secrecy capacity region of the degraded MIMO channel. We then establish the secrecy capacity region of the general MIMO channel by using the channel enhancement technique in conjunction with the capacity result we obtained for the degraded MIMO channel. For the general MIMO channel, we show that dirty-paper coding (DPC) combined with stochastic encoding attains the entire secrecy capacity region. Then, we study the multi-receiver wiretap channel for a more general scenario, where, in addition to confidential messages, the transmitter sends public messages to the legitimate users, on which there are no secrecy constraints. First, we consider the degraded discrete memoryless channel, and obtain inner and outer bounds for the capacity region. These inner and outer bounds match for certain cases, providing the capacity region. Second, we obtain an inner bound for the general discrete memoryless channel by using Marton's inner bound. Third, we consider the degraded Gaussian MIMO channel, and show that jointly Gaussian auxiliary random variables and channel input are sufficient to exhaust the inner and outer bounds. Finally, we provide an inner bound for the capacity region of the general Gaussian MIMO channel. Next, we focus on the multiple access wiretap (MAC-WT) channel whose capacity region is unknown. We consider a special class of MAC-WT channels which we call the weak eavesdropper class, where each user's link to the legitimate receiver is stronger than its link to the eavesdropper. For this class of channels, we develop an outer bound for the secrecy capacity region, which partially matches the achievable region in an n-letter form. We evaluate a looser version of our outer bound for the Gaussian case, and show that our outer bound is within 0.5 bits/channel use of the achievable rates along the individual secrecy rates for all weak eavesdropper Gaussian MAC-WT. Then, we investigate the effects of user cooperation on the secrecy of broadcast channels by considering the cooperative relay broadcast channel (CRBC). We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward (CAF) scheme for relay channels. For the Gaussian CRBC, we show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation. We further investigate the effects of user cooperation on secrecy by considering the multiple access channel with generalized feedback (MAC-GF), which can be viewed as the MAC-dual of the CRBC. We propose a CAF-based achievable secrecy rate region for the MAC-GF. Specializing our results to a Gaussian MAC-GF, we present numerical results which demonstrate that cooperation can improve secrecy for the MAC-GF. Next, we study the two-user one-eavesdropper discrete memoryless compound wiretap channel, and provide the best known lower bound for the secrecy capacity of this compound channel. We evaluate this achievable secrecy rate for the Gaussian MIMO case by using DPC. We show that this achievable secrecy rate achieves at least half of the secrecy capacity of this Gaussian MIMO compound wiretap channel, and also attains the secrecy capacity when the eavesdropper is degraded with respect to one of the two users. Then, we study the degraded compound multi-receiver wiretap channel (DCMRWC), which, in addition to a group of eavesdroppers, has two groups of users, namely the stronger group and the weaker group. We study two different communication scenarios for this channel. In the first scenario, there is only one eavesdropper, and the transmitter sends a confidential message to each group of legitimate users while keeping both messages secret from the eavesdropper. In the second scenario, we study the DCMRWC with layered messages without any restriction on the number of eavesdroppers. For both scenarios, we obtain the secrecy capacity region for the discrete memoryless channel, the parallel channel, and the Gaussian parallel channel. For the Gaussian MIMO channel, we obtain the secrecy capacity region when there is only one user in the second group. Next, we study the two-user fading broadcast channel and obtain its ergodic secrecy capacity region. We show that, thanks to fading, both users can have simultaneous secure communication with the transmitter, although this is not possible in the scalar non-fading Gaussian broadcast channel where only one user can have secure communication. This simultaneous secrecy of both users is achieved by an opportunistic communication scheme, in which, at each time instant, the transmitter communicates with the user having a better channel gain. Then, we study the secure lossy transmission of a vector Gaussian source to a legitimate user in the presence of an eavesdropper, where both the legitimate user and the eavesdropper have vector Gaussian side information. We obtain an outer bound for the rate, equivocation and distortion region. Moreover, we obtain the maximum equivocation at the eavesdropper when there is no constraint on the transmission rate. By using this maximum equivocation result, we show two facts. First, for this problem, in general, Wyner-Ziv scheme is suboptimal, although, it is optimal in the absence of an eavesdropper. And, second, even when there is no transmission rate constraint, an uncoded transmission scheme is suboptimal; the presence of an eavesdropper necessitates the use of a coded scheme to attain the maximum equivocation. Finally, we revisit the secure lossy source coding problem. In all works on this problem, either the equivocation of the source at the eavesdropper or the equivocation of the legitimate user's reconstruction of the source at the eavesdropper is used to measure secrecy. We first propose the relative equivocation of the source at the eavesdropper with respect to the legitimate user as a new secrecy measure. We argue that this new secrecy measure is the one that corresponds to the natural generalization of the equivocation in a wiretap channel to the context of secure lossy source coding. Under this new secrecy measure, we provide a single-letter description of the rate, relative equivocation and distortion region, as well as its specializations to degraded and reversely degraded cases. We investigate the relationships between the optimal scheme that attains this region and the Wyner-Ziv scheme.

Jan 1, 20120 citations

Physical Layer Security Techniques for Wireless Communication Systems

Manish Nagpal, Sampa Chau Pattnaik, Paramjit Baxi +3 more

One of the most important issues for secure communication in the physical layer is developing physical layer security techniques to provide confidentiality and data integrity in wireless communication systems. The properties of the physical channel are used in these methodologies to safeguard communication from eavesdropping and some other security threats. This article presents physical layer security methods that can be implemented in wireless communication systems. Artificial Noise (AN) is one of the most popular techniques. The original signal is combined with a generated by the transmitter in such a way that eavesdroppers cannot easily decode the data. Cooperative Anti-jamming: Yet another strategy for jammer localization is to employ cooperative jamming, where multiple friendly users can add noise signals over the signal in an effort to confuse potential eavesdroppers. In addition, additional technologies such as multi-input multi-output beamforming and transmit power control can further improve the security of wireless communication systems. In this regard, strategies based on game theory have been proposed as a viable alternative to enhancing physical layer security. Viewing the interaction between the transmitter, receiver, and eavesdropper as a game allows us to reveal their optimal strategies and security levels.

International Conference on Automation and Computation (AUTOCOM)Mar 4, 20250 citations

Secrecy Enhancement in Cooperative Relaying Systems

Elham Nosrati

Cooperative communications is obviously an evolution in wireless networks due to its noticeable advantages such as increasing the coverage as well as combating fading and shadowing effects. However, the broadcast characteristic of a wireless medium which is exploited in cooperative communications leads to a variety of security vulnerabilities. As cooperative communication networks are globally expanded, they expose to security attacks and threats more than ever. Primarily, researchers have focused on upper layers of network architectures to meet the requirements for secure cooperative transmission while the upper-layer security solutions are incapable of combating a number of security threats, e.g., jamming attacks. To address this issue, physical-layer security has been recommended as a complementary solution in the literature. In this thesis, physical layer attacks of the cooperative communication systems are studied, and corresponding security techniques including cooperative jamming, beamforming and diversity approaches are investigated. In addition, a novel security solution for a two-hop decode-and-forward relaying system is presented where the transmitters insert a random phase shift to the modulated data of each hop. The random phase shift is created based on a shared secret among communicating entities. Thus, the injected phase shift confuses the eavesdropper and secrecy capacity improves. Furthermore, a cooperative jamming strategy for multi-hop decode-and-forward relaying systems is presented where multiple non-colluding illegitimate nodes can overhear the communication. The jamming signal is created by the transmitter of each hop while being sent with the primary signal. The jamming signal is known at the intended receiver as it is according to a secret common knowledge between the communicating entities. Hence, artificial noise misleads the eavesdroppers, and decreases their signal-to-noise-ratio. As a result, secrecy capacity of the system is improved. Finally, power allocation among friendly jamming and main signal is proposed to ensure that suggested scheme enhances secrecy.

Jan 1, 20151 citation