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

Cambridge University Press eBooks

Secrecy and jamming in multi-user channels

Matthieu R. Bloch, João Barros

Published Sep 22, 2011• 0 citations
Publisher

Abstract

In all of the previous chapters, we discussed the possibility of secure transmissions at the physical layer for communication models involving only two legitimate parties and a single eavesdropper. These results generalize in part to situations with more complex communication schemes, additional legitimate parties, or additional eavesdroppers. Because of the increased complexity of these “multi-user” channel models, the results one can hope to obtain are, in general, not as precise as the ones obtained in earlier chapters. In particular, it becomes seldom possible to obtain a single-letter characterization of the secrecy capacity and one must often resort to the calculation of upper and lower bounds. Nevertheless, the analysis of multi-user communication channels still provides useful insight into the design of secure communication schemes; in particular it highlights several characteristics of secure communications, most notably the importance of cooperation, feedback, and interference. Although these aspects have been studied extensively in the context of reliable communications and are now reasonably well understood, they do not necessarily affect secure communications in the same way as they affect reliable communications. For instance, while it is well known that cooperation among transmitters is beneficial and improves reliability, the fact that interference is also helpful for secrecy is perhaps counter-intuitive.

DOI
10.1017/cbo9780511977985.010

Related papers

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

MIMO Wiretap Channels

Mohamed Nafea, Aylin Yener

This chapter considers securing wireless communications at the physical layer using multiple antennas. In particular, the multiple antenna (MIMO) wiretap channel is presented and its secrecy capacity is provided. Further investigation of the high-SNR characterization of the secrecy capacity, i.e., secure degrees of freedom, reveals that the secrecy capacity of the MIMO wiretap channel does not scale with the transmit power when the eavesdropper has an advantage over the legitimate transmitter in the number of antennas. An external multi-antenna cooperative jammer terminal is introduced to the channel model in order to improve its secrecy capacity scaling with power. The secure degrees of freedom for this new multi-terminal multi-antenna channel is characterized. While for these models the eavesdropper channel state information is known at the legitimate terminals, the chapter next removes this assumption and presents results that utilize multiple antennas in order to provide secure communications irrespective of the eavesdropper channel state. An achievable strong secrecy rate and the secure degrees of freedom characterization for the MIMO wiretap channel when the eavesdropper channel is arbitrary, varying, and unknown at the legitimate terminals are presented. Finally, the extension of this model to the two-user multiple access MIMO wiretap channel is considered and its secure degrees of freedom region is characterized. Introduction The wiretap channel and the notion of secrecy capacity, introduced in [1] and generalized by [2], have provided the framework for physical layer design for wireless channels with information theoretic guarantees against eavesdropping. A natural model in wireless communications is one which utilizes multiple antennas for transmission and reception at each node. The improvement in secrecy rate that can be obtained using multiple antennas in a point-to-point channel with an eavesdropper has been studied extensively in several references, including [3, 4]. Specifically, the secrecy capacity of the Gaussian model consisting of a multiple antenna legitimate transmitter, a multiple antenna legitimate receiver, and a multiple antenna eavesdropper, termed the multiple-input multiple-output (MIMO) wiretap channel, has been identified in full generality in [5, 6].

Cambridge University Press eBooks•Jun 16, 2017•0 citations

The Application of Cooperative Transmissions to Secrecy Communications

Xiangyun Zhou, Lingyang Song, Yan Zhang

The exploitation of user cooperation has been recognized as an important technique to improve the robustness of secure transmissions, where various studies have shown that a careful use of relaying can improve the receptional reliability of the legitimate receivers and decrease eavesdropping capabilities at the same time. In this chapter, a detailed review will be provided to illustrate how to integrate relay transmissions with secrecy communications. Simpler scenarios with single-antenna nodes will be investigated first, where two secure transmission strategies, cooperative jamming and relay chatting, will be focused particularly. Then scenarios with multiple-antenna nodes will be considered, and the design of precoding becomes of interest, where the cases with and without channel information at the transmitters will be discussed separately.

CRC Press eBooks•Nov 7, 2013•0 citations

On physical layer security in cooperative networks

Zohaib Hassan Awan

With the advent of mobile telephony, complemented by the availability of economic infrastructure devices has provided users the freedom to communicate and perform everyday tasks wirelessly. The access to information anywhere anytime provide users more flexibility to communicate, nonetheless it also makes communication more vulnerable to eavesdropping. Security is now considered as an important issue in the design of modern wireless communication system. In contrast to the conventional systems where security issues are dealt in the upper\nlayers of the protocol stack, in this thesis we focus our attention to construct security schemes by exploiting the attributes of the physical layer. \nIn the first part of the thesis, we consider a two-user multiacces channel where the two encoders, Encoder 1 and Encoder 2, are allowed to communicate with each other over a unidirectional noiseless bit-pipe of finite capacity in the presence of an adversary. In this model, the role of Encoder 2 is restricted to only help Encoder 1 in securing information from adversary. For this model, we\nestablish fundamental performance limits on secure communication and characterizes the secrecy capacity in some extreme cases of cooperation between the encoders. The second part of the thesis considers an elementary\nnetwork, which consists of four nodes – a source, a relay, a legitimate receiver and a passive eavesdropper. In this network, the link between two nodes consists of multiple parallel channels as subchannel. Towards this end, we establish bounds on secure communication. We show that for the case in which the relay does not listens to the source, under certain conditions secrecy capacity is established. In the last part of the thesis, we studied a two-user multi-input multioutput X-channel with local feedback and delayed channel state information\navailable at the transmitter in high signal-to-noise ratio regimes. In this setting each transmitter transmits independent messages to both receivers that need to be kept secret from each other. We characterize the optimal sum secure degrees of freedom region of this model.

•Jan 1, 2013•0 citations

Wireless networks physical layer security : modeling and performance characterization

Long Kong

Intrigued by the rapid growth and expand of wireless devices, data security is increasingly playing a significant role in our daily transactions and interactions with different entities. Possible examples, including e-healthcare information and online shopping, are becoming vulnerable due to the intrinsic nature of wireless transmission medium and the widespread open access of wireless links. Traditionally, the communication security is mainly regarded as the tasks at the upper layers of layered protocol stack, security techniques, including personal access control, password protection, and end-to-end encryption, have been widely studied in the open literature. More recently, plenty of research interests have been drawn to the physical layer forms of secrecy. As a new but appealing paradigm at physical layer, physical layer security is based on two pioneering works: (i) Shannon’s information-theoretic formulation and (ii) Wyner’s wiretap formulation. \n \nOn account of the fundamental of physical layer security and the different nature of various wireless network, this dissertation is supposed to further fill the lacking of the existing research outcomes. To be specific, the contributions of this dissertation can be summarized as three-fold:(i) exploration of secrecy metrics to more general fading channels; (ii) characterization a new fading channel model and its reliability and security analysis in digital communication systems; and (iii) investigation of physical layer security over the random multiple-input multiple-output (MIMO) α −μ fading channels. \n \nTaking into account the classic Alice-Bob-Eve wiretap model, the first contribution can be divided into four aspects: (i) we have investigated the secrecy performance over single-input single-output (SISO) α −μ fading channels. The probability of non-zero (PNZ) secrecy capacity and the lower bound of secrecy outage probability (SOP) are derived for the special case when the main channel and wiretap channel undergo the same non-linearity fading parameter, i.e., α. Later on, for the purpose of filling the gap of lacking closed-form expression of SOP in the open literature and extending the obtained results in chapter 2 to the single-input multiple-output (SIMO) α − μ wiretap fading channels, utilizing the fact that the received signal-tonoise ratios (SNRs) at the legitimate receiver and eavesdropper can be approximated as new α −μ distributed random variables (RVs), the SOP metric is therefore derived, and given in terms of the bivariate Fox’s H-function; (ii) the secrecy performance over the Fisher-Snedecor F wiretap fading channels is initially considered. The SOP, PNZ, and ASC are finalized in terms of Meijer’s G-function; (iii) in order to generalize the obtained results over α −μ and Fisher-Snedecor F wiretap fading channels, a more flexible and general fading channel, i.e., Fox’s H-function fading model, are taken into consideration. Both the exact and asymptotic analysis of SOP, PNZ, and average secrecy capacity (ASC), are developed with closed-form expressions; and (iv) finally, motivated by the fact that the mixture gamma (MG) distribution is an appealing tool, which can be used to model the received instantaneous SNRs over wireless fading channels, the secrecy metrics over wiretap fading channels are derived based on the MG approach. \n \nDue to the limited transmission power and communication range, cooperative relays or multi-hop wireless networks are usually regarded as two promising means to address these concerns. Inspired by the obtained results in Chapters 2 and 3, the second main contribution is to propose a novel but simple fading channel model, namely, the cascaded α −μ. This new distribution is advantageous since it encompasses the existing cascaded Rayleigh, cascaded Nakagami-m, and cascaded Weibull with ease. Based on this, both the reliability and secrecy performance of a digital system over cascaded α −μ fading channels are further evaluated. Closed-form expressions of reliability metrics (including amount of fading (AF), outage probability, average channel capacity, and average symbol error probability (ABEP).) and secrecy metrics (including SOP, PNZ, and ASC) are respectively provided. Besides, their asymptotic behaviors are also performed and compared with the exact results. \n \nConsidering the impacts of users’ densities, spatial distribution, and the path-loss exponent on secrecy issue, the third aspect of this thesis is detailed in Chapter 8 as the secrecy investigation of stochastic MIMO system over α −μ wiretap fading channels. Both the stochastic geometry and conventional space-time transmission (STT) scheme are used in the system configuration. The secrecy issue is mathematically evaluated by three metrics, i.e., connection outage, the probability of non-zero secrecy capacity and the ergodic secrecy capacity. Those three metrics are later on derived regarding two ordering scheme, and further compared with Monte-Carlo simulations.

•May 29, 2019•1 citation

Physical Layer Security in Wireless Networks

Emad S. Hassan

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.

CRC Press eBooks•Apr 27, 2018•2 citations
In all of the previous chapters, we discussed the possibility of secure transmissions at the physical layer for communication models involving only two legitimate parties and a single eavesdropper. These results generalize in part to situations with more complex communication schemes, additional legitimate parties, or additional eavesdroppers. Because of the increased complexity of these “multi-user” channel models, the results one can hope to obtain are, in general, not as precise as the ones obtained in earlier chapters. In particular, it becomes seldom possible to obtain a single-letter characterization of the secrecy capacity and one must often resort to the calculation of upper and lower bounds. Nevertheless, the analysis of multi-user communication channels still provides useful insight into the design of secure communication schemes; in particular it highlights several characteristics of secure communications, most notably the importance of cooperation, feedback, and interference. Although these aspects have been studied extensively in the context of reliable communications and are now reasonably well understood, they do not necessarily affect secure communications in the same way as they affect reliable communications. For instance, while it is well known that cooperation among transmitters is beneficial and improves reliability, the fact that interference is also helpful for secrecy is perhaps counter-intuitive.
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.
This chapter considers securing wireless communications at the physical layer using multiple antennas. In particular, the multiple antenna (MIMO) wiretap channel is presented and its secrecy capacity is provided. Further investigation of the high-SNR characterization of the secrecy capacity, i.e., secure degrees of freedom, reveals that the secrecy capacity of the MIMO wiretap channel does not scale with the transmit power when the eavesdropper has an advantage over the legitimate transmitter in the number of antennas. An external multi-antenna cooperative jammer terminal is introduced to the channel model in order to improve its secrecy capacity scaling with power. The secure degrees of freedom for this new multi-terminal multi-antenna channel is characterized. While for these models the eavesdropper channel state information is known at the legitimate terminals, the chapter next removes this assumption and presents results that utilize multiple antennas in order to provide secure communications irrespective of the eavesdropper channel state. An achievable strong secrecy rate and the secure degrees of freedom characterization for the MIMO wiretap channel when the eavesdropper channel is arbitrary, varying, and unknown at the legitimate terminals are presented. Finally, the extension of this model to the two-user multiple access MIMO wiretap channel is considered and its secure degrees of freedom region is characterized. Introduction The wiretap channel and the notion of secrecy capacity, introduced in [1] and generalized by [2], have provided the framework for physical layer design for wireless channels with information theoretic guarantees against eavesdropping. A natural model in wireless communications is one which utilizes multiple antennas for transmission and reception at each node. The improvement in secrecy rate that can be obtained using multiple antennas in a point-to-point channel with an eavesdropper has been studied extensively in several references, including [3, 4]. Specifically, the secrecy capacity of the Gaussian model consisting of a multiple antenna legitimate transmitter, a multiple antenna legitimate receiver, and a multiple antenna eavesdropper, termed the multiple-input multiple-output (MIMO) wiretap channel, has been identified in full generality in [5, 6].
The exploitation of user cooperation has been recognized as an important technique to improve the robustness of secure transmissions, where various studies have shown that a careful use of relaying can improve the receptional reliability of the legitimate receivers and decrease eavesdropping capabilities at the same time. In this chapter, a detailed review will be provided to illustrate how to integrate relay transmissions with secrecy communications. Simpler scenarios with single-antenna nodes will be investigated first, where two secure transmission strategies, cooperative jamming and relay chatting, will be focused particularly. Then scenarios with multiple-antenna nodes will be considered, and the design of precoding becomes of interest, where the cases with and without channel information at the transmitters will be discussed separately.
With the advent of mobile telephony, complemented by the availability of economic infrastructure devices has provided users the freedom to communicate and perform everyday tasks wirelessly. The access to information anywhere anytime provide users more flexibility to communicate, nonetheless it also makes communication more vulnerable to eavesdropping. Security is now considered as an important issue in the design of modern wireless communication system. In contrast to the conventional systems where security issues are dealt in the upper\nlayers of the protocol stack, in this thesis we focus our attention to construct security schemes by exploiting the attributes of the physical layer. \nIn the first part of the thesis, we consider a two-user multiacces channel where the two encoders, Encoder 1 and Encoder 2, are allowed to communicate with each other over a unidirectional noiseless bit-pipe of finite capacity in the presence of an adversary. In this model, the role of Encoder 2 is restricted to only help Encoder 1 in securing information from adversary. For this model, we\nestablish fundamental performance limits on secure communication and characterizes the secrecy capacity in some extreme cases of cooperation between the encoders. The second part of the thesis considers an elementary\nnetwork, which consists of four nodes – a source, a relay, a legitimate receiver and a passive eavesdropper. In this network, the link between two nodes consists of multiple parallel channels as subchannel. Towards this end, we establish bounds on secure communication. We show that for the case in which the relay does not listens to the source, under certain conditions secrecy capacity is established. In the last part of the thesis, we studied a two-user multi-input multioutput X-channel with local feedback and delayed channel state information\navailable at the transmitter in high signal-to-noise ratio regimes. In this setting each transmitter transmits independent messages to both receivers that need to be kept secret from each other. We characterize the optimal sum secure degrees of freedom region of this model.
Intrigued by the rapid growth and expand of wireless devices, data security is increasingly playing a significant role in our daily transactions and interactions with different entities. Possible examples, including e-healthcare information and online shopping, are becoming vulnerable due to the intrinsic nature of wireless transmission medium and the widespread open access of wireless links. Traditionally, the communication security is mainly regarded as the tasks at the upper layers of layered protocol stack, security techniques, including personal access control, password protection, and end-to-end encryption, have been widely studied in the open literature. More recently, plenty of research interests have been drawn to the physical layer forms of secrecy. As a new but appealing paradigm at physical layer, physical layer security is based on two pioneering works: (i) Shannon’s information-theoretic formulation and (ii) Wyner’s wiretap formulation. \n \nOn account of the fundamental of physical layer security and the different nature of various wireless network, this dissertation is supposed to further fill the lacking of the existing research outcomes. To be specific, the contributions of this dissertation can be summarized as three-fold:(i) exploration of secrecy metrics to more general fading channels; (ii) characterization a new fading channel model and its reliability and security analysis in digital communication systems; and (iii) investigation of physical layer security over the random multiple-input multiple-output (MIMO) α −μ fading channels. \n \nTaking into account the classic Alice-Bob-Eve wiretap model, the first contribution can be divided into four aspects: (i) we have investigated the secrecy performance over single-input single-output (SISO) α −μ fading channels. The probability of non-zero (PNZ) secrecy capacity and the lower bound of secrecy outage probability (SOP) are derived for the special case when the main channel and wiretap channel undergo the same non-linearity fading parameter, i.e., α. Later on, for the purpose of filling the gap of lacking closed-form expression of SOP in the open literature and extending the obtained results in chapter 2 to the single-input multiple-output (SIMO) α − μ wiretap fading channels, utilizing the fact that the received signal-tonoise ratios (SNRs) at the legitimate receiver and eavesdropper can be approximated as new α −μ distributed random variables (RVs), the SOP metric is therefore derived, and given in terms of the bivariate Fox’s H-function; (ii) the secrecy performance over the Fisher-Snedecor F wiretap fading channels is initially considered. The SOP, PNZ, and ASC are finalized in terms of Meijer’s G-function; (iii) in order to generalize the obtained results over α −μ and Fisher-Snedecor F wiretap fading channels, a more flexible and general fading channel, i.e., Fox’s H-function fading model, are taken into consideration. Both the exact and asymptotic analysis of SOP, PNZ, and average secrecy capacity (ASC), are developed with closed-form expressions; and (iv) finally, motivated by the fact that the mixture gamma (MG) distribution is an appealing tool, which can be used to model the received instantaneous SNRs over wireless fading channels, the secrecy metrics over wiretap fading channels are derived based on the MG approach. \n \nDue to the limited transmission power and communication range, cooperative relays or multi-hop wireless networks are usually regarded as two promising means to address these concerns. Inspired by the obtained results in Chapters 2 and 3, the second main contribution is to propose a novel but simple fading channel model, namely, the cascaded α −μ. This new distribution is advantageous since it encompasses the existing cascaded Rayleigh, cascaded Nakagami-m, and cascaded Weibull with ease. Based on this, both the reliability and secrecy performance of a digital system over cascaded α −μ fading channels are further evaluated. Closed-form expressions of reliability metrics (including amount of fading (AF), outage probability, average channel capacity, and average symbol error probability (ABEP).) and secrecy metrics (including SOP, PNZ, and ASC) are respectively provided. Besides, their asymptotic behaviors are also performed and compared with the exact results. \n \nConsidering the impacts of users’ densities, spatial distribution, and the path-loss exponent on secrecy issue, the third aspect of this thesis is detailed in Chapter 8 as the secrecy investigation of stochastic MIMO system over α −μ wiretap fading channels. Both the stochastic geometry and conventional space-time transmission (STT) scheme are used in the system configuration. The secrecy issue is mathematically evaluated by three metrics, i.e., connection outage, the probability of non-zero secrecy capacity and the ergodic secrecy capacity. Those three metrics are later on derived regarding two ordering scheme, and further compared with Monte-Carlo simulations.
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.