Computer Science – Cryptography and Security
Scientific paper
2008-08-19
ACM Symposium on Information, Computer and Communications Security (ASIACCS), pages 189{200, Tokyo, Japan, March 2008
Computer Science
Cryptography and Security
Scientific paper
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.
Hubaux Jean-Pierre
Papadimitratos Panos
Poturalski Marcin
No associations
LandOfFree
Secure Neighbor Discovery in Wireless Networks: Formal Investigation of Possibility does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Secure Neighbor Discovery in Wireless Networks: Formal Investigation of Possibility, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure Neighbor Discovery in Wireless Networks: Formal Investigation of Possibility will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-608638