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

ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec)

Profiling the Strength of Physical-Layer Security: A Study in Orthogonal Blinding

Yao Rui Zheng, Matthias Schulz, Wenjing Lou, Y. Thomas Hou, Matthias Hollick

Published Jul 15, 2016• 6 citations
Publisher

Abstract

Physical layer security for wireless communication is broadly considered as a promising approach to protect data confidentiality against eavesdroppers. However, despite its ample theoretical foundation, the transition to practical implementations of physical-layer security still lacks success. A close inspection of proven vulnerable physical-layer security designs reveals that the flaws are usually overlooked when the scheme is only evaluated against an inferior, single-antenna eavesdropper. Meanwhile, the attacks exposing vulnerabilities often lack theoretical justification. To reduce the gap between theory and practice, we posit that a physical-layer security scheme must be studied under multiple adversarial models to fully grasp its security strength. In this regard, we evaluate a specific physical-layer security scheme, i.e. orthogonal blinding, under multiple eavesdropper settings. We further propose a practical "ciphertext-only attack" that allows eavesdroppers to recover the original message by exploiting the low entropy fields in wireless packets. By means of simulation, we are able to reduce the symbol error rate at an eavesdropper below 1% using only the eavesdropper's receiving data and a general knowledge about the format of the wireless packets.

DOI
10.1145/2939918.2939933

Related papers

Practical Known-Plaintext Attacks against Physical Layer Security in Wireless MIMO Systems

Matthias Schulz, Adrian Loch, Matthias Hollick

Physical layer security schemes for wireless communication systems have been broadly studied from an information theory point of view. In contrast, there is a dearth of attack methodologies to analyze the achievable security on the physical layer. To address this issue, we develop a novel attack model for physical layer security schemes, which is the equivalent to known-plaintext attacks in cryptoanalysis. In particular, we concentrate on analyzing the security of orthogonal blinding schemes that disturb an eavesdropper’s signal reception using artificial noise transmission. We discuss the theory underlying our attack methodology and develop an adaptive filter trained by known-plaintext symbols to degrade the secrecy of orthogonal blinding. By means of simulation and measurements on real wireless channels using software-defined radios with OFDM transceivers, we obtain the operating area of our attack and evaluate the achievable secrecy degradation. We are able to reduce the secrecy of orthogonal blinding schemes to Symbol Error Rates (SERs) below 10% at an eavesdropper, with a knowledge of only a 3% of the symbols transmitted in typical WLAN frames.

Network and Distributed System Security Symposium•Jan 1, 2014•41 citations

ROBin: Known-Plaintext Attack Resistant Orthogonal Blinding via Channel Randomization

Yanjun Pan, Yao Rui Zheng, Ming Li

Orthogonal blinding based schemes for wireless physical layer security aim to achieve secure communication by injecting noise into channels orthogonal to the main channel and corrupting the eavesdropper’s signal reception. These methods, albeit practical, have been proven vulnerable against multiantenna eavesdroppers who can filter the message from the noise. The vulnerability is rooted in the fact that the main channel state remains static in spite of the noise injection, which allows an eavesdropper to estimate it promptly via known symbols and filter out the noise. Our proposed scheme leverages a reconfigurable antenna for Alice to rapidly change the channel state during transmission and a compressive sensing based algorithm for her to predict and cancel the changing effects for Bob. As a result, the communication between Alice and Bob remains clear, whereas randomized channel state prevents Eve from launching the knownplaintext attack. We formally analyze the security of the scheme against both single and multi-antenna eavesdroppers and identify its unique anti-eavesdropping properties due to the artificially created fast-changing channel. We conduct extensive simulations and real-world experiments to evaluate its performance. Empirical results show that our scheme can suppress Eve’s attack success rate to the level of random guessing, even if she knows all the symbols transmitted through other antenna modes.

arXiv:2002.07355•IEEE Conference on Computer Communications (INFOCOM)•Jul 1, 2020•7 citations

Wireless Physical Layer Security: Towards Practical Assumptions and Requirements

Biao He

The current research on physical layer security is far from implementations in practical networks, arguably due to impractical assumptions in the literature and the limited applicability of physical layer security. Aiming to reduce the gap between theory and practice, this thesis focuses on wireless physical layer security towards practical assumptions and requirements. In the first half of the thesis, we reduce the dependence of physical layer security on impractical assumptions. The secrecy enhancements and analysis based on impractical assumptions cannot lead to any true guarantee of secrecy in practical networks. The current study of physical layer security was often based on the idealized assumption of perfect channel knowledge on both legitimate users and eavesdroppers. We study the impact of channel estimation errors on secure transmission designs. We investigate the practical scenarios where both the transmitter and the receiver have imperfect channel state information (CSI). Our results show how the optimal transmission design and the achievable throughput vary with the amount of knowledge on the eavesdropper's channel. Apart from the assumption of perfect CSI, the analysis of physical layer security often ideally assumed the number of eavesdropper antennas to be known. We develop an innovative approach to study secure communication systems without knowing the number of eavesdropper antennas by introducing the concept of spatial constraint into physical layer security. That is, the eavesdropper is assumed to have a limited spatial region to place (possibly an infinite number of) antennas. We show that a non-zero secrecy rate is achievable with the help of a friendly jammer, even if the eavesdropper places an infinite number of antennas in its spatial region. In the second half of the thesis, we improve the applicability of physical layer security. The current physical layer security techniques to achieve confidential broadcasting were limited to application in single-cell systems. The primary challenge to achieve confidential broadcasting in the multi-cell network is to deal with not only the inter-cell but also the intra-cell information leakage and interference. To tackle this challenge, we design linear precoders performing confidential broadcasting in multi-cell networks. We optimize the precoder designs to maximize the secrecy sum rate with based on the large-system analysis. Finally, we improve the applicability of physical layer security from a fundamental aspect. The analysis of physical layer security based on the existing secrecy metric was often not applicable in practical networks. We propose new metrics for evaluating the secrecy of transmissions over fading channels to address the practical limitations of using existing secrecy metrics for such evaluations. The first metric establishes a link between the concept of secrecy outage and the eavesdropper's ability to decode confidential messages. The second metric provides an error-probability-based secrecy metric which is often used for the practical implementation of secure wireless systems. The third metric characterizes how much or how fast the confidential information is leaked to the eavesdropper. We show that the proposed secrecy metrics enable one to appropriately design secure communication systems with different views on how secrecy is measured.

•Jan 1, 2016•1 citation

Optimising Multiple Antenna Techniques for Physical Layer Security

Romero Zurita, Leonardo Nabil

Wireless communications offer data transmission services anywhere and anytime, but with the inevitable cost of introducing major security vulnerabilities. Indeed, an eavesdropper can overhear a message conveyed over the open insecure wireless media putting at risk the confidentiality of the wireless users. Currently, the way to partially prevent eavesdropping attacks is by ciphering the information between the authorised parties through complex cryptographic algorithms. Cryptography operates in the upper layers of the communication model, bit it does not address the security problem where the attack is suffered: at the transmission level. In this context, physical layer security has emerged as a promising framework to prevent eavesdropping attacks at the transmission level. Physical layer security is based on information-theoretic concepts and exploits the randomness and the uniqueness of the wireless channel. In this context, this thesis presents signal processing techniques to secure wireless networks at the physical layer by optimising the use of multiple-antennas. A masked transmission strategy is used to steer the confidential information towards the intended receiver, and, at the same time, broadcast an interfering signal to confuse unknown eavesdroppers. This thesis considers practical issues in multiple-antenna networks such as limited transmission resources and the lack of accurate information between the authorised transmission parties. The worst-case for the security, that occurs when a powerful eavesdropper takes advantage of any opportunity to put at risk the transmission confidentiality, is addressed. The techniques introduced improve the security by offering efficient and innovative transmission solutions to lock the communication at the physical layer. Notably, these transmission mechanisms strike a balance between confidentiality and quality to satisfy the practical requirements of modern wireless networks.

•Aug 22, 2014•1 citation

Lockpicking physical layer key exchange: weak adversary models invite the thief

Daniel Steinmetzer, Matthias Schulz, Matthias Hollick

Physical layer security schemes for wireless communications are currently crossing the chasm from theory to practice. They promise information-theoretical security, for instance by guaranteeing the confidentiality of wireless transmissions. Examples include schemes utilizing artificial interference---that is 'jamming for good'---to enable secure physical layer key exchange or other security mechanisms. However, only little attention has been payed to adjusting the employed adversary models during this transition from theory to practice. Typical assumptions give the adversary antenna configurations and transceiver capabilities similar to all other nodes: single antenna eavesdroppers are the norm. We argue that these assumptions are perilous and 'invite the thief'. In this work, we evaluate the security of a representative practical physical layer security scheme, which employs artificial interference to secure physical layer key exchange. Departing from the standard single-antenna eavesdropper, we utilize a more realistic multi-antenna eavesdropper and propose a novel approach that detects artificial interferences. This facilitates a practical attack, effectively 'lockpicking' the key exchange by exploiting the diversity of the jammed signals. Using simulation and real-world software-defined radio (SDR) experimentation, we quantify the impact of increasingly strong adversaries. We show that our approach reduces the secrecy capacity of the scheme by up to 97% compared to single-antenna eavesdroppers. Our results demonstrate the risk unrealistic adversary models pose in current practical physical layer security schemes.

ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec)•Jun 22, 2015•22 citations

Physical-Layer Security in Wireless Communication Systems

Ghadamali Bagherikaram

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 $\\frac{K-1}{K}$ 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.

•May 17, 2010•0 citations
Physical layer security for wireless communication is broadly considered as a promising approach to protect data confidentiality against eavesdroppers. However, despite its ample theoretical foundation, the transition to practical implementations of physical-layer security still lacks success. A close inspection of proven vulnerable physical-layer security designs reveals that the flaws are usually overlooked when the scheme is only evaluated against an inferior, single-antenna eavesdropper. Meanwhile, the attacks exposing vulnerabilities often lack theoretical justification. To reduce the gap between theory and practice, we posit that a physical-layer security scheme must be studied under multiple adversarial models to fully grasp its security strength. In this regard, we evaluate a specific physical-layer security scheme, i.e. orthogonal blinding, under multiple eavesdropper settings. We further propose a practical "ciphertext-only attack" that allows eavesdroppers to recover the original message by exploiting the low entropy fields in wireless packets. By means of simulation, we are able to reduce the symbol error rate at an eavesdropper below 1% using only the eavesdropper's receiving data and a general knowledge about the format of the wireless packets.
Physical layer security schemes for wireless communication systems have been broadly studied from an information theory point of view. In contrast, there is a dearth of attack methodologies to analyze the achievable security on the physical layer. To address this issue, we develop a novel attack model for physical layer security schemes, which is the equivalent to known-plaintext attacks in cryptoanalysis. In particular, we concentrate on analyzing the security of orthogonal blinding schemes that disturb an eavesdropper’s signal reception using artificial noise transmission. We discuss the theory underlying our attack methodology and develop an adaptive filter trained by known-plaintext symbols to degrade the secrecy of orthogonal blinding. By means of simulation and measurements on real wireless channels using software-defined radios with OFDM transceivers, we obtain the operating area of our attack and evaluate the achievable secrecy degradation. We are able to reduce the secrecy of orthogonal blinding schemes to Symbol Error Rates (SERs) below 10% at an eavesdropper, with a knowledge of only a 3% of the symbols transmitted in typical WLAN frames.
Orthogonal blinding based schemes for wireless physical layer security aim to achieve secure communication by injecting noise into channels orthogonal to the main channel and corrupting the eavesdropper’s signal reception. These methods, albeit practical, have been proven vulnerable against multiantenna eavesdroppers who can filter the message from the noise. The vulnerability is rooted in the fact that the main channel state remains static in spite of the noise injection, which allows an eavesdropper to estimate it promptly via known symbols and filter out the noise. Our proposed scheme leverages a reconfigurable antenna for Alice to rapidly change the channel state during transmission and a compressive sensing based algorithm for her to predict and cancel the changing effects for Bob. As a result, the communication between Alice and Bob remains clear, whereas randomized channel state prevents Eve from launching the knownplaintext attack. We formally analyze the security of the scheme against both single and multi-antenna eavesdroppers and identify its unique anti-eavesdropping properties due to the artificially created fast-changing channel. We conduct extensive simulations and real-world experiments to evaluate its performance. Empirical results show that our scheme can suppress Eve’s attack success rate to the level of random guessing, even if she knows all the symbols transmitted through other antenna modes.
The current research on physical layer security is far from implementations in practical networks, arguably due to impractical assumptions in the literature and the limited applicability of physical layer security. Aiming to reduce the gap between theory and practice, this thesis focuses on wireless physical layer security towards practical assumptions and requirements. In the first half of the thesis, we reduce the dependence of physical layer security on impractical assumptions. The secrecy enhancements and analysis based on impractical assumptions cannot lead to any true guarantee of secrecy in practical networks. The current study of physical layer security was often based on the idealized assumption of perfect channel knowledge on both legitimate users and eavesdroppers. We study the impact of channel estimation errors on secure transmission designs. We investigate the practical scenarios where both the transmitter and the receiver have imperfect channel state information (CSI). Our results show how the optimal transmission design and the achievable throughput vary with the amount of knowledge on the eavesdropper's channel. Apart from the assumption of perfect CSI, the analysis of physical layer security often ideally assumed the number of eavesdropper antennas to be known. We develop an innovative approach to study secure communication systems without knowing the number of eavesdropper antennas by introducing the concept of spatial constraint into physical layer security. That is, the eavesdropper is assumed to have a limited spatial region to place (possibly an infinite number of) antennas. We show that a non-zero secrecy rate is achievable with the help of a friendly jammer, even if the eavesdropper places an infinite number of antennas in its spatial region. In the second half of the thesis, we improve the applicability of physical layer security. The current physical layer security techniques to achieve confidential broadcasting were limited to application in single-cell systems. The primary challenge to achieve confidential broadcasting in the multi-cell network is to deal with not only the inter-cell but also the intra-cell information leakage and interference. To tackle this challenge, we design linear precoders performing confidential broadcasting in multi-cell networks. We optimize the precoder designs to maximize the secrecy sum rate with based on the large-system analysis. Finally, we improve the applicability of physical layer security from a fundamental aspect. The analysis of physical layer security based on the existing secrecy metric was often not applicable in practical networks. We propose new metrics for evaluating the secrecy of transmissions over fading channels to address the practical limitations of using existing secrecy metrics for such evaluations. The first metric establishes a link between the concept of secrecy outage and the eavesdropper's ability to decode confidential messages. The second metric provides an error-probability-based secrecy metric which is often used for the practical implementation of secure wireless systems. The third metric characterizes how much or how fast the confidential information is leaked to the eavesdropper. We show that the proposed secrecy metrics enable one to appropriately design secure communication systems with different views on how secrecy is measured.
Wireless communications offer data transmission services anywhere and anytime, but with the inevitable cost of introducing major security vulnerabilities. Indeed, an eavesdropper can overhear a message conveyed over the open insecure wireless media putting at risk the confidentiality of the wireless users. Currently, the way to partially prevent eavesdropping attacks is by ciphering the information between the authorised parties through complex cryptographic algorithms. Cryptography operates in the upper layers of the communication model, bit it does not address the security problem where the attack is suffered: at the transmission level. In this context, physical layer security has emerged as a promising framework to prevent eavesdropping attacks at the transmission level. Physical layer security is based on information-theoretic concepts and exploits the randomness and the uniqueness of the wireless channel. In this context, this thesis presents signal processing techniques to secure wireless networks at the physical layer by optimising the use of multiple-antennas. A masked transmission strategy is used to steer the confidential information towards the intended receiver, and, at the same time, broadcast an interfering signal to confuse unknown eavesdroppers. This thesis considers practical issues in multiple-antenna networks such as limited transmission resources and the lack of accurate information between the authorised transmission parties. The worst-case for the security, that occurs when a powerful eavesdropper takes advantage of any opportunity to put at risk the transmission confidentiality, is addressed. The techniques introduced improve the security by offering efficient and innovative transmission solutions to lock the communication at the physical layer. Notably, these transmission mechanisms strike a balance between confidentiality and quality to satisfy the practical requirements of modern wireless networks.
Physical layer security schemes for wireless communications are currently crossing the chasm from theory to practice. They promise information-theoretical security, for instance by guaranteeing the confidentiality of wireless transmissions. Examples include schemes utilizing artificial interference---that is 'jamming for good'---to enable secure physical layer key exchange or other security mechanisms. However, only little attention has been payed to adjusting the employed adversary models during this transition from theory to practice. Typical assumptions give the adversary antenna configurations and transceiver capabilities similar to all other nodes: single antenna eavesdroppers are the norm. We argue that these assumptions are perilous and 'invite the thief'. In this work, we evaluate the security of a representative practical physical layer security scheme, which employs artificial interference to secure physical layer key exchange. Departing from the standard single-antenna eavesdropper, we utilize a more realistic multi-antenna eavesdropper and propose a novel approach that detects artificial interferences. This facilitates a practical attack, effectively 'lockpicking' the key exchange by exploiting the diversity of the jammed signals. Using simulation and real-world software-defined radio (SDR) experimentation, we quantify the impact of increasingly strong adversaries. We show that our approach reduces the secrecy capacity of the scheme by up to 97% compared to single-antenna eavesdroppers. Our results demonstrate the risk unrealistic adversary models pose in current practical physical layer security schemes.
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 222, 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 333 , 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 444, we consider a KKK-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\\frac{K-1}{K}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.