Intrinsically secure communication in large-scale wireless networks
Moe Z. Win, Pedro Pintó
Abstract
The ability to exchange secret information is critical to many commercial, governmen-tal, and military networks. Information-theoretic security- widely accepted as the strictest notion of security- relies on channel coding techniques that exploit the inher-ent randomness of the propagation channels to significantly strengthen the security of digital communications systems. Motivated by recent developments in the field, this thesis aims at a characterization of the fundamental secrecy limits of large-scale wireless networks. We start by introducing an information-theoretic definition of the intrinsically se-cure communications graph (iS-graph), based on the notion of strong secrecy. The iS-graph is a random geometric graph which captures the connections that can be securely established over a large-scale network, in the presence of spatially scattered eavesdroppers. Using fundamental tools from stochastic geometry, we analyze how the spatial densities of legitimate and eavesdropper nodes influence various properties of the Poisson iS-graph, such as the distribution of node degrees, the node isolation probabil-