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

Joint Relay Selection and Power Allocation in Large-Scale MIMO Systems with Untrusted Relays and Passive Eavesdroppers

In this paper, a joint relay selection and power allocation (JRP) scheme is proposed to enhance the physical layer security of a cooperative network, where a multiple antennas source communicates with a single-antenna destination in presence of untrusted relays and passive eavesdroppers (Eves). The objective is to protect the data confidentially while concurrently relying on the untrusted relays as potential Eves to improve both the security and reliability of the network. To realize this objective, we consider cooperative jamming performed by the destination while JRP scheme is implemented. With the aim of maximizing the instantaneous secrecy rate, we derive a new closed-form solution for the optimal power allocation and propose a simple relay selection criterion under two scenarios of non-colluding Eves (NCE) and colluding Eves (CE). For the proposed scheme, a new closed-form expression is derived for the ergodic secrecy rate (ESR) and the secrecy outage probability as security metrics, and a new closed-form expression is presented for the average symbol error rate (SER) as a reliability measure over Rayleigh fading channels. We further explicitly characterize the high signal-to-noise ratio slope and power offset of the ESR to highlight the impacts of system parameters on the ESR. In addition, we examine the diversity order of the proposed scheme to reveal the achievable secrecy performance advantage. Finally, the secrecy and reliability diversity-multiplexing tradeoff of the optimized network are provided. Numerical results highlight that the ESR performance of the proposed JRP scheme for NCE and CE cases is increased with respect to the number of untrustworthy relays.Comment: 18 pages, 10 figures, IEEE Transactions on Information Forensics and Security (In press

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