Secure Neighbor Discovery in Wireless Networks: Is It Possible?
2007 (English)Report (Other academic)
Wireless communication enables a broad spectrum of appli-cations, ranging from commodity to tactical systems.Neigh-bor discovery(ND), that is, determining which devices arewithin direct radio communication, is a building block ofnetwork protocols and applications, and its vulnerability canseverely compromise their functionalities. A number of pro-posals tosecureND have been published, but none haveanalyzed the problem formally. In this paper, we contributesuch an analysis: We build a formal model capturing salientcharacteristics of wireless systems, most notably obstaclesand interference, and we provide a speciØcation of a basicvariant of the ND problem. Then, we derive animpossibilityresultfor a general class of protocols we term \time-basedprotocols," to which many of the schemes in the literaturebelong. We also identify the conditions under which the im-possibility result is lifted. Moreover, we explore a secondclass of protocols we term \time- and location-based proto-cols," and prove they can secure ND
Place, publisher, year, edition, pages
Ecole Polytechnique Fedrale de Lausanne , 2007. , 14 p.
, EPFL-LCA Report, 2007-004
wireless networks security, secure neighbor discovery, relay attack
Engineering and Technology
IdentifiersURN: urn:nbn:se:kth:diva-116118OAI: oai:DiVA.org:kth-116118DiVA: diva2:591670
QC 201306192013-01-212013-01-152013-06-19Bibliographically approved