Sciweavers

Share
SASN
2003
ACM

SECTOR: secure tracking of node encounters in multi-hop wireless networks

9 years 19 days ago
SECTOR: secure tracking of node encounters in multi-hop wireless networks
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be used notably to prevent wormhole attacks (without requiring any clock synchronization), to secure routing protocols based on last encounters (with only loose clock synchronization), and to control the topology of the network. SECTOR is based primarily on distance-bounding techniques, on one-way hash chains and on Merkle hash trees. We analyze the communication, computation and storage complexity of the proposed mechanisms and we show that, due to their efficiency and simplicity, they are compliant with the limited resources of most mobile devices.1 Categories and Subject Descriptors C.0 [Computer-Communication Networks]: [Security and protection] General Terms Security, Positioning Keywords Security, Mobile Networks, Mobility, Security associations, Positioning 1 The work presented in this paper was supported...
Srdjan Capkun, Levente Buttyán, Jean-Pierre
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where SASN
Authors Srdjan Capkun, Levente Buttyán, Jean-Pierre Hubaux
Comments (0)
books