Secure Neighbor Discovery in Wireless Networks: Formal Investigation of Possibility
| dc.creator | Poturalski, Marcin | |
| dc.creator | Papadimitratos, Panos | |
| dc.creator | Hubaux, Jean-Pierre | |
| dc.date | 2008-08-19 | |
| dc.date.accessioned | 2026-07-07T12:23:35Z | |
| dc.date.available | 2026-07-07T12:23:35Z | |
| dc.description | Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within direct radio communication, is a building block of network protocols and applications, and its vulnerability can severely compromise their functionalities. A number of proposals to secure ND have been published, but none have analyzed the problem formally. In this paper, we contribute such an analysis: We build a formal model capturing salient characteristics of wireless systems, most notably obstacles and interference, and we provide a specification of a basic variant of the ND problem. Then, we derive an impossibility result for a general class of protocols we term "time-based protocols," to which many of the schemes in the literature belong. We also identify the conditions under which the impossibility result is lifted. Moreover, we explore a second class of protocols we term "time- and location-based protocols," and prove they can secure ND. | |
| dc.identifier | https://arxiv.org/abs/0808.2668 | |
| dc.identifier | http://arxiv.org/abs/0808.2668 | |
| dc.identifier | ACM Symposium on Information, Computer and Communications Security (ASIACCS), pages 189{200, Tokyo, Japan, March 2008 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/214040 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Networking and Internet Architecture | |
| dc.subject | C.2.0 | |
| dc.title | Secure Neighbor Discovery in Wireless Networks: Formal Investigation of Possibility | |
| dc.type | text |