DMCA
SECTOR: secure tracking of node encounters in multi-hop wireless networks (2003)
Cached
Download Links
- [www.hit.bme.hu]
- [www.syssec.ethz.ch]
- [infoscience.epfl.ch]
- [www.mics.org]
- DBLP
Other Repositories/Bibliography
| Venue: | In ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN |
| Citations: | 162 - 22 self |
BibTeX
@INPROCEEDINGS{Capkun03sector:secure,
author = {Srdjan Capkun and Levente Buttyán and Jean-Pierre Hubaux},
title = {SECTOR: secure tracking of node encounters in multi-hop wireless networks},
booktitle = {In ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN},
year = {2003},
pages = {21--32}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
