| dc.contributor |
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
|
| dc.contributor |
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems |
|
| dc.contributor |
Win, Moe Z. |
|
| dc.contributor |
Pinto, Pedro C. |
|
| dc.contributor |
Win, Moe Z. |
|
| dc.creator |
Pinto, Pedro C. |
|
| dc.creator |
Win, Moe Z. |
|
| dc.date |
2011-11-01T14:34:19Z |
|
| dc.date |
2011-11-01T14:34:19Z |
|
| dc.date |
2010-10 |
|
| dc.date.accessioned |
2023-03-01T18:07:28Z |
|
| dc.date.available |
2023-03-01T18:07:28Z |
|
| dc.identifier |
978-1-4244-6016-8 |
|
| dc.identifier |
978–1–4244–6017–5 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/66699 |
|
| dc.identifier |
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. |
|
| dc.identifier |
https://orcid.org/0000-0002-8573-0488 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/278838 |
|
| dc.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. |
|
| dc.description |
MIT/Army Institute for Soldier Nanotechnologies |
|
| dc.description |
United States. Office of Naval Research (Presidential Early Career Award for Scientists and engineers (PECASE) N00014-09-1-0435) |
|
| dc.description |
National Science Foundation (U.S.) (grant ECCS-0901034) |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Institute of Electrical and Electronics Engineers |
|
| dc.relation |
http://dx.doi.org/10.1109/ISITA.2010.5649155 |
|
| dc.relation |
2010 International Symposium on Information Theory and its Applications (ISITA) |
|
| dc.rights |
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. |
|
| dc.source |
IEEE |
|
| dc.title |
Continuum percolation in the intrinsically secure communications graph |
|
| dc.type |
Article |
|
| dc.type |
http://purl.org/eprint/type/ConferencePaper |
|