Wireless Secrecy in Large-Scale Networks

The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely established over a large-scale network, by exploiting the physical properties of the wireless medium. This paper provides an overview of the main properties of this new class of random graphs. We first analyze the local properties of the iS-graph, namely the degree distributions and their dependence on fading, target secrecy rate, and eavesdropper collusion. To mitigate the effect of the eavesdroppers, we propose two techniques that improve secure connectivity. Then, we analyze the global properties of the iS-graph, namely percolation on the infinite plane, and full connectivity on a finite region. These results help clarify how the presence of eavesdroppers can compromise secure communication in a large-scale network.Comment: To appear: Proc. IEEE Information Theory and Applications Workshop (ITA'11), San Diego, CA, Feb. 2011, pp. 1-10, Invited Pape

Transmitter Optimization Techniques for Physical Layer Security

Information security is one of the most critical issues in wireless networks as the signals transmitted through wireless medium are more vulnerable for interception. Although the existing conventional security techniques are proven to be safe, the broadcast nature of wireless communications introduces different challenges in terms of key exchange and distributions. As a result, information theoretic physical layer security has been proposed to complement the conventional security techniques for enhancing security in wireless transmissions. On the other hand, the rapid growth of data rates introduces different challenges on power limited mobile devices in terms of energy requirements. Recently, research work on wireless power transfer claimed that it has been considered as a potential technique to extend the battery lifetime of wireless networks. However, the algorithms developed based on the conventional optimization approaches often require iterative techniques, which poses challenges for real-time processing. To meet the demanding requirements of future ultra-low latency and reliable networks, neural network (NN) based approach can be employed to determine the resource allocations in wireless communications. This thesis developed different transmission strategies for secure transmission in wireless communications. Firstly, transmitter designs are focused in a multiple-input single-output simultaneous wireless information and power transfer system with unknown eavesdroppers. To improve the performance of physical layer security and the harvested energy, artificial noise is incorporated into the network to mask the secret information between the legitimate terminals. Then, different secrecy energy efficiency designs are considered for a MISO underlay cognitive radio network, in the presence of an energy harvesting receiver. In particular, these designs are developed with different channel state information assumptions at the transmitter. Finally, two different power allocation designs are investigated for a cognitive radio network to maximize the secrecy rate of the secondary receiver: conventional convex optimization framework and NN based algorithm

Percolation and Connectivity in the Intrinsically Secure Communications Graph

The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely established over a large-scale network, by exploiting the physical properties of the wireless medium. This paper aims to characterize the global properties of the iS-graph in terms of: (i) percolation on the infinite plane, and (ii) full connectivity on a finite region. First, for the Poisson iS-graph defined on the infinite plane, the existence of a phase transition is proven, whereby an unbounded component of connected nodes suddenly arises as the density of legitimate nodes is increased. This shows that long-range secure communication is still possible in the presence of eavesdroppers. Second, full connectivity on a finite region of the Poisson iS-graph is considered. The exact asymptotic behavior of full connectivity in the limit of a large density of legitimate nodes is characterized. Then, simple, explicit expressions are derived in order to closely approximate the probability of full connectivity for a finite density of legitimate nodes. The results help clarify how the presence of eavesdroppers can compromise long-range secure communication.Comment: Submitted for journal publicatio

A Survey on Wireless Security: Technical Challenges, Recent Advances and Future Trends

This paper examines the security vulnerabilities and threats imposed by the inherent open nature of wireless communications and to devise efficient defense mechanisms for improving the wireless network security. We first summarize the security requirements of wireless networks, including their authenticity, confidentiality, integrity and availability issues. Next, a comprehensive overview of security attacks encountered in wireless networks is presented in view of the network protocol architecture, where the potential security threats are discussed at each protocol layer. We also provide a survey of the existing security protocols and algorithms that are adopted in the existing wireless network standards, such as the Bluetooth, Wi-Fi, WiMAX, and the long-term evolution (LTE) systems. Then, we discuss the state-of-the-art in physical-layer security, which is an emerging technique of securing the open communications environment against eavesdropping attacks at the physical layer. We also introduce the family of various jamming attacks and their counter-measures, including the constant jammer, intermittent jammer, reactive jammer, adaptive jammer and intelligent jammer. Additionally, we discuss the integration of physical-layer security into existing authentication and cryptography mechanisms for further securing wireless networks. Finally, some technical challenges which remain unresolved at the time of writing are summarized and the future trends in wireless security are discussed.Comment: 36 pages. Accepted to Appear in Proceedings of the IEEE, 201