Traditional methods to secure communications rely on algorithms at protocol stack level, which are based on mathematically derived cryptographic protocols, to encrypt transmitted signals. With the steep rise in the data traffic and storage each year, and the strong increase in computational power available for unauthorized decryption, traditional mathematical cryptographic measures might be compromised in the upcoming years. To protect communications at the lowest level, physical layer security (PLS) methods have been proposed recently. These techniques aim to ensure secure communication links by exploiting the known unique characteristics of the physical medium between communicating nodes in order to distort a transmitted signal in such a way that only the intended receivers are unaffected by the distortion, effectively reducing the eavesdropping capabilities of any unintended party. In this way, it is the channel itself which is secured. These techniques come at the expense of several trade-offs between transmission resources and the degree of secrecy achieved. Of our particular interest is a class of PLS methods which can be referred to as `security enhancing techniques', in which minimal priors about eavesdroppers are assumed. In this dissertation we introduce innovative, wave scattering-based concepts and algorithms for the successful protection of both wireless and wired communication channels at the physical layer. This new class of approaches for physical layer (PHY) secure communications involve analog, controllable and reconfigurable scattering media (termed "micromedia'") positioned near the communicating nodes. This implementation is achieved via truly physical, analog means by exploiting the use of unilateral pilot signals for channel estimations. Prior research in this nascent field has addressed the important case of wireless channels as well as the more manageable wired communication channel case, the latter in connection with applications to power line communications (PLC) which make use of the available smart grid and other existing infrastructure. On the other hand, within the wireless regime, most existing work has focused on the canonical free-space case scenario, or -~within mathematical, statistical information theoretic frameworks~- on the classical random matrix models such as those for fading and other channels. Little attention has been given to the important case of unknown, complex, fixed or possibly slow-fading (block-fading) wireless channels, where little prior information is available other than that facilitated by the parties through explicit, cooperative communication. In addition, within the wired channel scenario, attention has been given only to techniques already developed for the wireless case. Furthermore, in both cases, many of the proposed algorithms are implemented mathematically rather than physically or analogically. In contrast, our proposed scattering approaches involve analog reconfigurable media and are applicable not only to free space but also to rather complex and unknown media. Our particular interest are applications to communications in indoor channels, tunnels, caves, and similar media, including underwater channels. Within this wireless regime, we develop novel secure communication methodologies applicable to single-input-single-output (SISO), multiple-input-single-output (MISO) and multiple-input-multiple-output (MIMO) systems. The developed methods for the SISO case are subsequently extrapolated also to the transmission line wired channel. The presented results and computer simulations demonstrate the feasibility for achieving secure communication links by means of the proposed techniques as well as the relevant trade-offs between communication resources and secrecy. Importantly, the proposed techniques provide security for the SISO case which had so far not been covered as a security enhancing technique. In the wired case, we address the transmission-line-like channels and more complex circuit networks. Motivation is provided by applications to secure communication in PLC networks, including the smart grid, as well as near field communication systems, intra-chip communication, and even novel modems for secure communication via conventional wired RF and optical channels. In this work, particular attention is given to single-phase, one-dimensional transmission line systems and planar circuit-like networks. The ideas, as presented for those particular classes of systems, can, of course, be readily extended to more general wired systems, and thus have relevance also for potential application to PLC systems where one deals in general with multi-phase transmission lines, electric machines, and other components that can be modeled via suitable lumped or distributed system parameters--Author's abstract
Traditional methods to secure communications rely on algorithms at protocol stack level, which are based on mathematically derived cryptographic protocols, to encrypt transmitted signals. With the steep rise in the data traffic and storage each year, and the strong increase in computational power available for unauthorized decryption, traditional mathematical cryptographic measures might be compromised in the upcoming years. To protect communications at the lowest level, physical layer security (PLS) methods have been proposed recently. These techniques aim to ensure secure communication links by exploiting the known unique characteristics of the physical medium between communicating nodes in order to distort a transmitted signal in such a way that only the intended receivers are unaffected by the distortion, effectively reducing the eavesdropping capabilities of any unintended party. In this way, it is the channel itself which is secured. These techniques come at the expense of several trade-offs between transmission resources and the degree of secrecy achieved. Of our particular interest is a class of PLS methods which can be referred to as `security enhancing techniques', in which minimal priors about eavesdroppers are assumed. In this dissertation we introduce innovative, wave scattering-based concepts and algorithms for the successful protection of both wireless and wired communication channels at the physical layer. This new class of approaches for physical layer (PHY) secure communications involve analog, controllable and reconfigurable scattering media (termed "micromedia'") positioned near the communicating nodes. This implementation is achieved via truly physical, analog means by exploiting the use of unilateral pilot signals for channel estimations. Prior research in this nascent field has addressed the important case of wireless channels as well as the more manageable wired communication channel case, the latter in connection with applications to power line communications (PLC) which make use of the available smart grid and other existing infrastructure. On the other hand, within the wireless regime, most existing work has focused on the canonical free-space case scenario, or -within mathematical, statistical information theoretic frameworks- on the classical random matrix models such as those for fading and other channels. Little attention has been given to the important case of unknown, complex, fixed or possibly slow-fading (block-fading) wireless channels, where little prior information is available other than that facilitated by the parties through explicit, cooperative communication. In addition, within the wired channel scenario, attention has been given only to techniques already developed for the wireless case. Furthermore, in both cases, many of the proposed algorithms are implemented mathematically rather than physically or analogically. In contrast, our proposed scattering approaches involve analog reconfigurable media and are applicable not only to free space but also to rather complex and unknown media. Our particular interest are applications to communications in indoor channels, tunnels, caves, and similar media, including underwater channels. Within this wireless regime, we develop novel secure communication methodologies applicable to single-input-single-output (SISO), multiple-input-single-output (MISO) and multiple-input-multiple-output (MIMO) systems. The developed methods for the SISO case are subsequently extrapolated also to the transmission line wired channel. The presented results and computer simulations demonstrate the feasibility for achieving secure communication links by means of the proposed techniques as well as the relevant trade-offs between communication resources and secrecy. Importantly, the proposed techniques provide security for the SISO case which had so far not been covered as a security enhancing technique. In the wired case, we address the transmission-line-like channels and more complex circuit networks. Motivation is provided by applications to secure communication in PLC networks, including the smart grid, as well as near field communication systems, intra-chip communication, and even novel modems for secure communication via conventional wired RF and optical channels. In this work, particular attention is given to single-phase, one-dimensional transmission line systems and planar circuit-like networks. The ideas, as presented for those particular classes of systems, can, of course, be readily extended to more general wired systems, and thus have relevance also for potential application to PLC systems where one deals in general with multi-phase transmission lines, electric machines, and other components that can be modeled via suitable lumped or distributed system parameters--Author's abstract
Wireless communications are naturally exposed to important security risks due to their broadcast nature. In contrast with wired communications, no physical medium is isolating the transmission surroundings to a specific path. Traditional methods to reach the goals of communications security rely on algorithms at protocol stack level, which are based on mathematically derived cryptographic protocols. With the tremendous proliferation of wireless devices, and the increase in computational power available for decryption, traditional cryptographic measures may be compromised. To protect communications at the lowest level, physical layer (PHY) security methods have been proposed recently. These techniques aim to ensure secure communications by exploiting the unique characteristics of the physical medium between communicating nodes, effectively reducing the decryption capabilities of an eavesdropper to intercept transmissions. This thesis explains within a general framework the most important PHY layer security schemes. First we explore approaches which utilize the knowledge of the unique channel between communicating nodes to distort a transmitted signal with various kinds of randomizations, in such a way that the intended receivers are unaffected by the distortion, but any other observer will be exposed to it. These techniques, however, introduce several trade-offs between transmission resources and the effectiveness in achieving secrecy. Of particular interest for this investigation is a class of methods which can be referred to as "security enhancing techniques", in which minimal priors about the potential eavesdroppers locations and capabilities are assumed. In this thesis, a wave-based approach to the communication secrecy problem is introduced. An interesting perspective is provided by studying the relation between electromagnetic theory and information theory, the so-called electromagnetic information theory. This allows to properly identify the unavoidable limitations imposed by the laws of electromagnetics to our ability to communicate securely. The proposed model can be extended to the analysis of different signal distortion methodologies and different channel conditions. The resulting approach is highly relevant to the study of PHY layer security methods since it is physically fundamental as well as architecture independent, which leads to a consolidating point of view of the secrecy problem. In addition, the thesis presents computer simulation results which shed insight on the security possibilities and limitations of three different security scenarios, which are termed MISO (multiple-input, single-output) (with single eavesdropper), MISOME (multiple-input, single-output, multiple eavesdropper), and MIMOME (multiple-input, multiple-output, multiple-eavesdropper).
The open nature of radio propagation enables ubiquitous wireless communication. This allows for seamless data transmission. However, unauthorized users may pose a threat to the security of the data being transmitted to authorized users. This gives rise to network vulnerabilities such as hacking, eavesdropping, and jamming of the transmitted information. Physical layer security (PLS) has been identified as one of the promising security approaches to safeguard the transmission from eavesdroppers in a wireless network. It is an alternative to the computationally demanding and complex cryptographic algorithms and techniques. PLS has continually received exponential research interest owing to the possibility of exploiting the characteristics of the wireless channel. One of the main characteristics includes the random nature of the transmission channel. The aforesaid nature makes it possible for confidential and authentic signal transmission between the sender and the receiver in the physical layer. We start by introducing the basic theories of PLS, including the wiretap channel, information-theoretic security, and a brief discussion of the cryptography security technique. Furthermore, an overview of multiple-input multiple-output (MIMO) communication is provided. The main focus of our review is based on the existing key-less PLS optimization techniques, their limitations, and challenges. The paper also looks into the promising key research areas in addressing these shortfalls. Lastly, a comprehensive overview of some of the recent PLS research in 5G and 6G technologies of wireless communication networks is provided.
Physical layer security (PLS) has emerged as a new concept and powerful alternative that can complement and may even replace encryption-based approaches, which entail many hurdles and practical problems for future wireless systems. The basic idea of PLS is to exploit the characteristics of the wireless channel and its impairments including noise, fading, interference, dispersion, diversity, etc. in order to ensure the ability of the intended user to successfully perform data decoding while preventing eavesdroppers from doing so. Thus, the main design goal of PLS is to increase the performance difference between the link of the legitimate receiver and that of the eavesdropper by using well-designed transmission schemes. In this survey, we propose a conceptual, generic, and expandable framework for classifying the existing PLS techniques against wireless passive eavesdropping. In this flexible framework, the security techniques that we comprehensively review in this treatise are divided into two primary approaches: signal-to-interference-plus-noise ratio-based approach and complexity-based approach. The first approach is classified into three major categories: first, secrecy channel codes-based schemes; second, security techniques based on channel adaptation; third, schemes based on injecting interfering artificial (noise/jamming) signals along with the transmitted information signals. The second approach (complexity-based), which is associated with the mechanisms of extracting secret sequences from the shared channel, is classified into two main categories based on which layer the secret sequence obtained by channel quantization is applied on. The techniques belonging to each one of these categories are divided and classified into three main signal domains: time, frequency and space. For each one of these domains, several examples are given and illustrated along with the review of the state-of-the-art security advances in each domain. Moreover, the advantages and disadvantages of each approach alongside the lessons learned from existing research works are stated and discussed. The recent applications of PLS techniques to different emerging communication systems such as visible light communication, body area network, power line communication, Internet of Things, smart grid, mm-Wave, cognitive radio, vehicular ad-hoc network, unmanned aerial vehicle, ultra-wideband, device-to-device, radio-frequency identification, index modulation, and 5G non-orthogonal multiple access based-systems, are also reviewed and discussed. The paper is concluded with recommendations and future research directions for designing robust, efficient and strong security methods for current and future wireless systems.
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.
In this dissertation, we present novel physical (PHY) and cross-layer design guidelines and resource adaptation algorithms to improve the security and user experience in the future wireless networks. Physical and cross-layer wireless security measures can provide stronger overall security with high efficiency and can also provide better flexibility in response to the typically time-varying wireless environment. To better utilize limited wireless resources, we present approaches and techniques based on new performance criteria for wireless system optimization by thoroughly exploiting user information including its Quality of Service (QoS) requests and channel state information (CSI) to improve network throughput and security.
In recent years, there has been a growing research interest in wireless system security from PHY layer perspective. In a wiretap channel model introduced in the seminal work by Wyner, a sender “Alice” wishes to transmit a secret message to the intended receiver “Bob” in presence of a passive eavesdropper “Eve”. Existing works have characterized maximum achievable secrecy rate or secrecy capacity for single- and multiple-antenna systems by applying Gaussian signaling and secrecy code. Despite the impracticality of Gaussian input, its compact closed-form expression of mutual information motivated the wide use of Gaussian input assumption in theoretical analysis. In contrast to the Gaussian codebook, practical wiretap codes must consist of finite-alphabet symbols. Because of this constraint, the achievable secrecy rate for a finite-alphabet input scenario would differ from the secrecy rate achievable by a Gaussian codebook. In this thesis, we quantify the effect of finite discrete-constellation on instantaneous and ergodic secrecy rate of multiple-antenna wire-tap channels. Our results demonstrate substantial performance difference between systems involving finite-alphabet inputs and systems with Gaussian inputs. In addition, we investigate the secrecy performance of multi-terminal wiretap systems when a codebook based transmission beamforming is implemented. We characterize the secrecy outage probability of a communication link under eavesdropping. We consider a limited feedback scenario where the transmitter uses a pre-defined codebook known to both the transmitter and the receiver for beamforming, and analyze the secrecy outage probability of the link when it being eavesdropped.
Next, we consider the security of wireless multi-hop networks. Certainly, network security is an overarching issue that transcends all layers of communication protocol stack. Therefore, we tackle the problem of network security by proper user scheduling, routing, and resource management. Our approach of secrecy is complementary to the traditional cryptography based techniques. Together, they can provide stronger overall security and flexibility in selecting the desired solution and can reduce bandwidth and energy overhead as much as possible. Multi-hop wireless networks frequently employ the traditional routing and resource allocation strategies. Such strategies often fail to take into account the additional need for protection against security vulnerabilities due to the wireless medium. Thus, to address security concerns, we investigate the problem of eavesdropping control by proposing security-aware power allocation strategies and routing algorithms for multi-hop networks.
The future wireless infrastructure will consists of a plethora of heterogeneous collections of applications and services. A differentiated service structure would therefore be an essential part of the future wireless infrastructure. In addition to the security consideration of wireless network, we focus on the heterogeneous structure of the network. We study the problem of cross-layer resource allocation and admission control in a multiuser heterogeneous OFDMA network providing both QoS-constrained user servicesand best-effort services. Such heterogeneous networks provide service to both High-Priority (HP) users and Best-Effort (BE) users. By clustering subcarriers, efficient algorithms for cluster and power allocation have been proposed. Our strategy maximizes the total network utility of the BE users while satisfying the QoS request for maximum number of HP users. The feasibility of the resource allocation problem depends on the number of HP users in the network. Since a large number of demanding HP users would render the resource allocation problem infeasible, a joint admission control and resource allocation scheme could be an efficient way of tackling both problems with less overhead. By incorporating admission control, we propose an efficient and optimal joint admission control and resource allocation algorithm.
The use of wireless networks has grown significantly in contemporary \ntimes, and continues to develop further. The broadcast nature of \nwireless communications, however, makes them particularly vulnerable \nto eavesdropping. Unlike traditional solutions, which usually handle \nsecurity at the application layer, the primary concern of this \ndissertation is to analyze and develop solutions based on coding \ntechniques at the physical-layer. \n \nFirst, in chapter 2, we consider a scenario where a source node \nwishes to broadcast two confidential messages to two receivers, \nwhile a wire-tapper also receives the transmitted signal. This model \nis motivated by wireless communications, where individual secure \nmessages are broadcast over open media and can be received by any \nillegitimate receiver. The secrecy level is measured by the \nequivocation rate at the eavesdropper. We first study the general \n(non-degraded) broadcast channel with an eavesdropper, and present \nan inner bound on the secrecy capacity region for this model. This \ninner bound is based on a combination of random binning, and the \nGelfand-Pinsker binning. We further study the situation in which the \nchannels are degraded. For the degraded broadcast channel with an \neavesdropper, we present the secrecy capacity region. Our achievable \ncoding scheme is based on Cover's superposition scheme and random \nbinning. We refer to this scheme as the Secret Superposition Scheme. \nOur converse proof is based on a combination of the converse proof \nof the conventional degraded broadcast channel and Csiszar Lemma. We \nthen assume that the channels are Additive White Gaussian Noise and \nshow that the Secret Superposition Scheme with Gaussian codebook is \noptimal. The converse proof is based on Costa's entropy power \ninequality. Finally, we use a broadcast strategy for the slowly \nfading wire-tap channel when only the eavesdropper's channel is \nfixed and known at the transmitter. We derive the optimum power \nallocation for the coding layers, which maximizes the total average \nrate. \n \n \nSecond, in chapter 3 , we consider the \nMultiple-Input-Multiple-Output (MIMO) scenario of a broadcast \nchannel where a wiretapper also receives the transmitted signal via \nanother MIMO channel. First, we assume that the channels are \ndegraded and the wiretapper has the worst channel. We establish the \ncapacity region of this scenario. Our achievability scheme is the \nSecret Superposition Coding. For the outerbound, we use notion of \nthe enhanced channels to show that the secret superposition of \nGaussian codes is optimal. We show that we only need to enhance the \nchannels of the legitimate receivers, and the channel of the \neavesdropper remains unchanged. We then extend the result of the \ndegraded case to a non-degraded case. We show that the secret \nsuperposition of Gaussian codes, along with successive decoding, \ncannot work when the channels are not degraded. We develop a Secret \nDirty Paper Coding scheme and show that it is optimal for this \nchannel. We then present a corollary generalizing the capacity \nregion of the two receivers case to the case of multiple receivers. \nFinally, we investigate a scenario which frequently occurs in the \npractice of wireless networks. In this scenario, the transmitter and \nthe eavesdropper have multiple antennae, while both intended \nreceivers have a single antenna (representing resource limited \nmobile units). We characterize the secrecy capacity region in terms \nof generalized eigenvalues of the receivers' channels and the \neavesdropper's channel. We refer to this configuration as the MISOME \ncase. We then present a corollary generalizing the results of the \ntwo receivers case to multiple receivers. In the high SNR regime, we \nshow that the capacity region is a convex closure of rectangular \nregions. \n \n \nFinally, in chapter 4, we consider a K-user secure Gaussian \nMultiple-Access-Channel with an external eavesdropper. We establish \nan achievable rate region for the secure discrete memoryless MAC. \nThereafter, we prove the secrecy sum capacity of the degraded \nGaussian MIMO MAC using Gaussian codebooks. For the non-degraded \nGaussian MIMO MAC, we propose an algorithm inspired by the \ninterference alignment technique to achieve the largest possible \ntotal Secure-Degrees-of-Freedom . When all the terminals are \nequipped with a single antenna, Gaussian codebooks have shown to be \ninefficient in providing a positive S-DoF. Instead, we propose a \nnovel secure coding scheme to achieve a positive S-DoF in the single \nantenna MAC. This scheme converts the single-antenna system into a \nmultiple-dimension system with fractional dimensions. The \nachievability scheme is based on the alignment of signals into a \nsmall sub-space at the eavesdropper, and the simultaneous separation \nof the signals at the intended receiver. We use tools from the field \nof Diophantine Approximation in number theory to analyze the \nprobability of error in the coding scheme. We prove that the total \nS-DoF of fracK−1K can be achieved for almost all channel \ngains. For the other channel gains, we propose a multi-layer coding \nscheme to achieve a positive S-DoF. As a function of channel gains, \ntherefore, the achievable S-DoF is discontinued.