Continuum percolation in the intrinsically secure communications graph
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 notio...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers
2011
|
| Online Access: | http://hdl.handle.net/1721.1/66699 https://orcid.org/0000-0002-8573-0488 |
| _version_ | 1811069705987817472 |
|---|---|
| author | Pinto, Pedro C. Win, Moe Z. |
| author2 | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
| author_facet | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics Pinto, Pedro C. Win, Moe Z. |
| author_sort | Pinto, Pedro C. |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T08:14:38Z |
| format | Article |
| id | mit-1721.1/66699 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T08:14:38Z |
| publishDate | 2011 |
| publisher | Institute of Electrical and Electronics Engineers |
| record_format | dspace |
| spelling | mit-1721.1/666992022-09-30T08:34:27Z Continuum percolation in the intrinsically secure communications graph Pinto, Pedro C. Win, Moe Z. Massachusetts Institute of Technology. Department of Aeronautics and Astronautics Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Win, Moe Z. Pinto, Pedro C. Win, Moe Z. 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. MIT/Army Institute for Soldier Nanotechnologies United States. Office of Naval Research (Presidential Early Career Award for Scientists and engineers (PECASE) N00014-09-1-0435) National Science Foundation (U.S.) (grant ECCS-0901034) 2011-11-01T14:34:19Z 2011-11-01T14:34:19Z 2010-10 Article http://purl.org/eprint/type/ConferencePaper 978-1-4244-6016-8 978–1–4244–6017–5 http://hdl.handle.net/1721.1/66699 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. https://orcid.org/0000-0002-8573-0488 en_US http://dx.doi.org/10.1109/ISITA.2010.5649155 2010 International Symposium on Information Theory and its Applications (ISITA) Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. application/pdf Institute of Electrical and Electronics Engineers IEEE |
| spellingShingle | Pinto, Pedro C. Win, Moe Z. Continuum percolation in the intrinsically secure communications graph |
| title | Continuum percolation in the intrinsically secure communications graph |
| title_full | Continuum percolation in the intrinsically secure communications graph |
| title_fullStr | Continuum percolation in the intrinsically secure communications graph |
| title_full_unstemmed | Continuum percolation in the intrinsically secure communications graph |
| title_short | Continuum percolation in the intrinsically secure communications graph |
| title_sort | continuum percolation in the intrinsically secure communications graph |
| url | http://hdl.handle.net/1721.1/66699 https://orcid.org/0000-0002-8573-0488 |
| work_keys_str_mv | AT pintopedroc continuumpercolationintheintrinsicallysecurecommunicationsgraph AT winmoez continuumpercolationintheintrinsicallysecurecommunicationsgraph |