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

Institution of Engineering and Technology eBooks

Trusted wireless communications with spatial multiplexing

Giovanni Geraci, Jinhong Yuan

Published Oct 15, 2017• 0 citations
Publisher

Abstract

This chapter will introduce trusted communications in multiuser multiple-input multiple-output (MIMO) wireless systems via spatial multiplexing. We will start by considering the multiple-input single-output broadcast channel with confidential messages (BCC) under Rayleigh fading, where a multiantenna base station (BS) simultaneously transmits independent confidential messages to several spatially dispersed malicious users that can eavesdrop on each other. We will then present the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multiantenna BS simultaneously communicates to multiple malicious users, in the presence of a Poisson point process (PPP) of external eavesdroppers. Unlike the BCC, in the BCCE not just malicious users, but also randomly located external nodes can act as eavesdroppers. We will finally turn our attention to cellular networks where, unlike the case of isolated cells, multiple BSs generate intercell interference, and malicious users of neighboring cells can cooperate to eavesdrop. For these involved scenarios, we will present low-complexity transmission schemes based on linear precoding that can achieve secrecy at the physical layer, discuss their

DOI
10.1049/pbte076e_ch8

Related papers

MIMO multi-user secrecy rate analysis

Giovanni Geraci, Sarabjot Singh, Jeffrey G. Andrews +2 more

In this paper, we consider the broadcast channel with confidential messages and eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of external eavesdroppers randomly located according to a Poisson point process (PPP). By using techniques from stochastic geometry and random matrix theory, we obtain explicit expressions for the secrecy outage probability and mean secrecy rate achievable with regularized channel inversion precoding. We show that both these metrics scale as -4fe, where N is the number of transmit antennas and Aeis the density of external eavesdroppers.

International Conference on Communications•Jun 1, 2014•2 citations

Secrecy rate evaluation of wireless channel in the presence of eavesdroppers

G. Prema, R. Sowmini

Multiuser multiple-input multiple-output (MIMO) wireless techniques have received tremendous attention as a way to achieve high spectral efficiency in current mobile communication systems such as Long Term Evolution (LTE) [1]. Due to the broadcast nature of the physical medium, wireless multiuser communications are very susceptible to eavesdropping, and it is critical to secure the transmitted information. In this work, consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station [2] simultaneously communicates to multiple potentially malicious users, in the presence of randomly located external eavesdroppers. The secrecy capacity is measured in terms of outage probability and provides a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. Using the proposed model, the secrecy rates is achieved with regularized channel inversion (RCI) precoding and analyzed by performing a large-system analysis where the number of users K and the number of transmit antennas N both grow to infinity in a fixed ratio. Finally an explicit expression for the probability of secrecy outage and the system performance is analyzed in the presence of both colluding and non-colluding eavesdroppers.

International Conference on Electrical, Computer and Communication Technologies (ICECCT)•Mar 1, 2015•1 citation

Trusted Communications with Physical Layer Security for 5G and Beyond

Duong, Trung Q, Zhou, Xiangyun, Poor, H Vincent

Physical layer security is emerging as a promising means of ensuring secrecy in wireless communications. The key idea is to exploit the characteristics of wireless channels such as fading or noise to transmit a message from the source to the intended receiver while keeping this message confidential from eavesdroppers. Topics covered in Trusted Communications with Physical Layer Security for 5G and Beyond include secrecy metrics for physical layer security over fading channels; trusted wireless communications with spatial multiplexing; directional modulation enabled physical layer wireless security; secure waveform for 5G systems; confidential and energy efficient communications using physical layer security; secure data networks with channel uncertainty; antenna selection strategies for wiretap channels; physical layer security for massive MIMO systems, millimeter wave cellular networks, non-orthogonal multiple access, multiuser relay networks, cognitive radio networks, MIMOME-OFDM systems; wirelessly powered communication systems and D2D-enabled cellular networks; and security solutions and applications at the physical layer, including case studies of secret key generation and secrecy coding in communication nodes and terminals.

Institution of Engineering and Technology eBooks•Oct 15, 2017•34 citations

Achieving Secure Communications in Dense Multiuser Mimo Systems for 5G and Beyond

Berk Akgun

Traditional approaches for providing confidentiality of wirelessly transmitted signals are often based on cryptographic techniques. While these techniques ensure that messages are encrypted and secured against eavesdropping, they are not sufficient to protect important transmission attributes at the physical (PHY) layer. Specifically, several elds in the headers of PHY and medium access control (MAC) frames are typically sent unencrypted to maintain proper protocol functionality (e.g., sender/receiver identification). As a result, they leak side-channel information (SCI), including payload size, frequency and phase oset, modulation and coding scheme, identities of communication nodes, frame type, transmission rate, etc. These SCI can be exploited by an adversary to launch various passive (eavesdropping) and active (jamming) attacks. To complement cryptographic techniques used at upper layers and prevent the leakage of SCI at the PHY/MAC layers, PHY-layer security techniques have been introduced. These techniques exploit the characteristics of the wireless channel along with multiple-input multiple-output (MIMO) technologies, in which multiple transmitting and receiving antennas are utilized to prevent information leakage to eavesdroppers and/or avoid jamming attacks. In particular, if the signal-to-interference-plus-noise ratio (SINR) at an adversary is lower than the one at a legitimate receiver, secure communication can be achieved through the so-called wiretap coding. MIMO systems enable the transmitter and/or the receiver to generate artificial noise, called friendly jamming (FJ), so as to reduce the SINR at the adversary without impacting the SINR at the legitimate receiver. In this dissertation, we focus on exploring the security threats to next-generation wireless systems. We develop MIMO-based PHY-layer security methods to achieve reliable and secret communications in these systems. First, we consider a broadcast channel, in which a multi-antenna transmitter (Alice) sends K confidential information signals to K legitimate receivers (Bobs) in the presence of L eavesdropping devices (Eves). Alice uses MIMO precoding to generate the information signals along with her own Tx-based friendly jamming (TxFJ). Interference at each Bob is removed via a technique called MIMO zero-forcing. This TxFJ, however, leaves an eavesdropping \vulnerability region" in the proximity of each Bob, which can be exploited by a nearby Eve. Specically, because of the high correlation in the channel state information (CSI) at a Bob and nearby Eves, the TxFJ becomes less effective in preventing eavesdropping at these Eves. We address this problem by augmenting TxFJ with receiver-based friendly jamming (RxFJ), generated by each Bob. Specifically, we allow each Bob to use self-interference suppression (SIS) techniques to transmit a friendly jamming signal while simultaneously receiving an information signal over the same channel. These SIS techniques exploit circulators to attenuate the self-interference power of RxFJ at Bobs and utilize analog/digital cancellation methods to clean out any remaining residual self-interference. Considering the resulting broadcast channel, we rst study a two-user scenario and develop a secrecy encoding scheme for constructing the signals intended to two Bobs. We characterize the corresponding achievable secrecy sum-rate and formulate an optimization problem to maximize this metric. We then extend our approach to K-user scenarios and study a power minimization problem. Particularly, in our analysis we minimize the powers allocated to information and friendly jamming signals (both TxFJ and RxFJ) while guaranteeing individual secrecy rates for various Bobs. The problem is solved for the cases when the eavesdropper's CSI (ECSI) is known or unknown (but with a known distribution). Simulations show the effectiveness of the proposed solutions. Furthermore, we discuss how to schedule transmissions when the rate requirements need to be satised on average rather than instantaneously. In low and high power regime, a scheduling algorithm that serves only the strongest receivers is shown to outperform the one that schedules all receivers. Next, we consider a single-cell massive MIMO system in which a base station (BS) with a large number of antennas transmits simultaneously to several single antenna users. The BS acquires the CSI for various receivers using uplink pilot transmissions. We demonstrate the vulnerability of the CSI estimation process to a pilot-contamination (PC) attack that aims at minimizing the sum-rate of downlink transmissions by contaminating uplink pilots. We rst study PC attacks for two downlink power allocation strategies under the assumption that the attacker knows the locations of the BS and its users. Later on, we relax this assumption and consider the case when such knowledge is probabilistic. The formulated problems are solved using stochastic optimization, Lagrangian minimization, and game-theoretic methods. A closed-form solution for a special case of the problem is obtained. Furthermore, we analyze the \achievable individual secrecy rates" under PC attacks, and provide an upper-bound on these rates. We also study this scenario without a priori knowledge of user locations at the attacker by introducing chance constraints. Another attack model is considered, where the attacker generates jamming signals in both the CSI estimation and data transmission phases by exploiting inband full-duplex techniques. Our results indicate that such attacks can degrade the throughput of a massive MIMO system by more than 50%, and reduce fairness among users significantly.

•Jan 1, 2019•0 citations

Secure broadcasting using multiple antennas

Ersen Ekrem, Şennur Ulukuş

We consider three different secure broadcasting scenarios: i) Broadcast channels with common and confidential messages (BCC), ii) multi-receiver wiretap channels with public and confidential messages, and iii) compound wiretap channels. The BCC is a broadcast channel with two users, where in addition to the common message sent to both users, a private message, which needs to be kept hidden as much as possible from the other user, is sent to each user. In this model, each user treats the other user as an eavesdropper. The multi-receiver wiretap channel is a broadcast channel with two legitimate users and an external eavesdropper, where the transmitter sends a pair of public and confidential messages to each legitimate user. Although there is no secrecy concern about the public messages, the confidential messages need to be kept perfectly secret from the eavesdropper. The compound wiretap channel is a compound broadcast channel with a group of legitimate users and a group of eavesdroppers. In this model, the transmitter sends a common confidential message to the legitimate users, and this confidential message needs to be kept perfectly secret from all eavesdroppers. In this paper, we provide a survey of the existing information-theoretic results for these three forms of secure broadcasting problems, with a closer look at the Gaussian multiple-input multiple-output (MIMO) channel models. We also present the existing results for the more general discrete memory-less channel models, as they are often the first step in obtaining the capacity results for the corresponding Gaussian MIMO channel models.

Journal of Communications and Networks•Oct 1, 2010•21 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, 2012•0 citations
This chapter will introduce trusted communications in multiuser multiple-input multiple-output (MIMO) wireless systems via spatial multiplexing. We will start by considering the multiple-input single-output broadcast channel with confidential messages (BCC) under Rayleigh fading, where a multiantenna base station (BS) simultaneously transmits independent confidential messages to several spatially dispersed malicious users that can eavesdrop on each other. We will then present the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multiantenna BS simultaneously communicates to multiple malicious users, in the presence of a Poisson point process (PPP) of external eavesdroppers. Unlike the BCC, in the BCCE not just malicious users, but also randomly located external nodes can act as eavesdroppers. We will finally turn our attention to cellular networks where, unlike the case of isolated cells, multiple BSs generate intercell interference, and malicious users of neighboring cells can cooperate to eavesdrop. For these involved scenarios, we will present low-complexity transmission schemes based on linear precoding that can achieve secrecy at the physical layer, discuss their
In this paper, we consider the broadcast channel with confidential messages and eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of external eavesdroppers randomly located according to a Poisson point process (PPP). By using techniques from stochastic geometry and random matrix theory, we obtain explicit expressions for the secrecy outage probability and mean secrecy rate achievable with regularized channel inversion precoding. We show that both these metrics scale as -4fe, where N is the number of transmit antennas and Aeis the density of external eavesdroppers.
Multiuser multiple-input multiple-output (MIMO) wireless techniques have received tremendous attention as a way to achieve high spectral efficiency in current mobile communication systems such as Long Term Evolution (LTE) [1]. Due to the broadcast nature of the physical medium, wireless multiuser communications are very susceptible to eavesdropping, and it is critical to secure the transmitted information. In this work, consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station [2] simultaneously communicates to multiple potentially malicious users, in the presence of randomly located external eavesdroppers. The secrecy capacity is measured in terms of outage probability and provides a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. Using the proposed model, the secrecy rates is achieved with regularized channel inversion (RCI) precoding and analyzed by performing a large-system analysis where the number of users K and the number of transmit antennas N both grow to infinity in a fixed ratio. Finally an explicit expression for the probability of secrecy outage and the system performance is analyzed in the presence of both colluding and non-colluding eavesdroppers.
Physical layer security is emerging as a promising means of ensuring secrecy in wireless communications. The key idea is to exploit the characteristics of wireless channels such as fading or noise to transmit a message from the source to the intended receiver while keeping this message confidential from eavesdroppers. Topics covered in Trusted Communications with Physical Layer Security for 5G and Beyond include secrecy metrics for physical layer security over fading channels; trusted wireless communications with spatial multiplexing; directional modulation enabled physical layer wireless security; secure waveform for 5G systems; confidential and energy efficient communications using physical layer security; secure data networks with channel uncertainty; antenna selection strategies for wiretap channels; physical layer security for massive MIMO systems, millimeter wave cellular networks, non-orthogonal multiple access, multiuser relay networks, cognitive radio networks, MIMOME-OFDM systems; wirelessly powered communication systems and D2D-enabled cellular networks; and security solutions and applications at the physical layer, including case studies of secret key generation and secrecy coding in communication nodes and terminals.
Traditional approaches for providing confidentiality of wirelessly transmitted signals are often based on cryptographic techniques. While these techniques ensure that messages are encrypted and secured against eavesdropping, they are not sufficient to protect important transmission attributes at the physical (PHY) layer. Specifically, several elds in the headers of PHY and medium access control (MAC) frames are typically sent unencrypted to maintain proper protocol functionality (e.g., sender/receiver identification). As a result, they leak side-channel information (SCI), including payload size, frequency and phase oset, modulation and coding scheme, identities of communication nodes, frame type, transmission rate, etc. These SCI can be exploited by an adversary to launch various passive (eavesdropping) and active (jamming) attacks. To complement cryptographic techniques used at upper layers and prevent the leakage of SCI at the PHY/MAC layers, PHY-layer security techniques have been introduced. These techniques exploit the characteristics of the wireless channel along with multiple-input multiple-output (MIMO) technologies, in which multiple transmitting and receiving antennas are utilized to prevent information leakage to eavesdroppers and/or avoid jamming attacks. In particular, if the signal-to-interference-plus-noise ratio (SINR) at an adversary is lower than the one at a legitimate receiver, secure communication can be achieved through the so-called wiretap coding. MIMO systems enable the transmitter and/or the receiver to generate artificial noise, called friendly jamming (FJ), so as to reduce the SINR at the adversary without impacting the SINR at the legitimate receiver. In this dissertation, we focus on exploring the security threats to next-generation wireless systems. We develop MIMO-based PHY-layer security methods to achieve reliable and secret communications in these systems. First, we consider a broadcast channel, in which a multi-antenna transmitter (Alice) sends K confidential information signals to K legitimate receivers (Bobs) in the presence of L eavesdropping devices (Eves). Alice uses MIMO precoding to generate the information signals along with her own Tx-based friendly jamming (TxFJ). Interference at each Bob is removed via a technique called MIMO zero-forcing. This TxFJ, however, leaves an eavesdropping \vulnerability region" in the proximity of each Bob, which can be exploited by a nearby Eve. Specically, because of the high correlation in the channel state information (CSI) at a Bob and nearby Eves, the TxFJ becomes less effective in preventing eavesdropping at these Eves. We address this problem by augmenting TxFJ with receiver-based friendly jamming (RxFJ), generated by each Bob. Specifically, we allow each Bob to use self-interference suppression (SIS) techniques to transmit a friendly jamming signal while simultaneously receiving an information signal over the same channel. These SIS techniques exploit circulators to attenuate the self-interference power of RxFJ at Bobs and utilize analog/digital cancellation methods to clean out any remaining residual self-interference. Considering the resulting broadcast channel, we rst study a two-user scenario and develop a secrecy encoding scheme for constructing the signals intended to two Bobs. We characterize the corresponding achievable secrecy sum-rate and formulate an optimization problem to maximize this metric. We then extend our approach to K-user scenarios and study a power minimization problem. Particularly, in our analysis we minimize the powers allocated to information and friendly jamming signals (both TxFJ and RxFJ) while guaranteeing individual secrecy rates for various Bobs. The problem is solved for the cases when the eavesdropper's CSI (ECSI) is known or unknown (but with a known distribution). Simulations show the effectiveness of the proposed solutions. Furthermore, we discuss how to schedule transmissions when the rate requirements need to be satised on average rather than instantaneously. In low and high power regime, a scheduling algorithm that serves only the strongest receivers is shown to outperform the one that schedules all receivers. Next, we consider a single-cell massive MIMO system in which a base station (BS) with a large number of antennas transmits simultaneously to several single antenna users. The BS acquires the CSI for various receivers using uplink pilot transmissions. We demonstrate the vulnerability of the CSI estimation process to a pilot-contamination (PC) attack that aims at minimizing the sum-rate of downlink transmissions by contaminating uplink pilots. We rst study PC attacks for two downlink power allocation strategies under the assumption that the attacker knows the locations of the BS and its users. Later on, we relax this assumption and consider the case when such knowledge is probabilistic. The formulated problems are solved using stochastic optimization, Lagrangian minimization, and game-theoretic methods. A closed-form solution for a special case of the problem is obtained. Furthermore, we analyze the \achievable individual secrecy rates" under PC attacks, and provide an upper-bound on these rates. We also study this scenario without a priori knowledge of user locations at the attacker by introducing chance constraints. Another attack model is considered, where the attacker generates jamming signals in both the CSI estimation and data transmission phases by exploiting inband full-duplex techniques. Our results indicate that such attacks can degrade the throughput of a massive MIMO system by more than 50%, and reduce fairness among users significantly.
We consider three different secure broadcasting scenarios: i) Broadcast channels with common and confidential messages (BCC), ii) multi-receiver wiretap channels with public and confidential messages, and iii) compound wiretap channels. The BCC is a broadcast channel with two users, where in addition to the common message sent to both users, a private message, which needs to be kept hidden as much as possible from the other user, is sent to each user. In this model, each user treats the other user as an eavesdropper. The multi-receiver wiretap channel is a broadcast channel with two legitimate users and an external eavesdropper, where the transmitter sends a pair of public and confidential messages to each legitimate user. Although there is no secrecy concern about the public messages, the confidential messages need to be kept perfectly secret from the eavesdropper. The compound wiretap channel is a compound broadcast channel with a group of legitimate users and a group of eavesdroppers. In this model, the transmitter sends a common confidential message to the legitimate users, and this confidential message needs to be kept perfectly secret from all eavesdroppers. In this paper, we provide a survey of the existing information-theoretic results for these three forms of secure broadcasting problems, with a closer look at the Gaussian multiple-input multiple-output (MIMO) channel models. We also present the existing results for the more general discrete memory-less channel models, as they are often the first step in obtaining the capacity results for the corresponding Gaussian MIMO channel models.
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.