Continuum percolation in the intrinsically secure communications graph
Author(s)Pinto, Pedro C.; Win, Moe Z.
MetadataShow full item record
The intrinsically secure communications graph (iS-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence of eavesdroppers. It is based on principles of information-theoretic security, widely accepted as the strictest notion of security. In this paper, we are interested in characterizing the global properties of the iS-graph in terms of percolation on the infinite plane. We prove the existence of a phase transition in the Poisson iS-graph, whereby an unbounded component of securely connected nodes suddenly arises as we increase the density of legitimate nodes. Our work shows that long-range communication in a wireless network is still possible when a secrecy constraint is present.
DepartmentMassachusetts Institute of Technology. Department of Aeronautics and Astronautics; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
2010 International Symposium on Information Theory and its Applications (ISITA)
Institute of Electrical and Electronics Engineers
Pinto, Pedro C., and Moe Z. Win. “Continuum percolation in the intrinsically secure communications graph.” ISITA2010, IEEE, Taichung, Taiwan, October 17-20, 2010, 349-354.
Final published version