Srdjan Čapkun
Jean-Pierre Hubaux
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.
- D. Balfanz, D. Smetters, P. Stewart, and H. Wong. Talking to strangers: Authentication in ad hoc wireless networks. In Proceedings of NDSS, 2002.Google Scholar
- N. Ben Salem, L. Buttyán, J.-P. Hubaux, and M. Jakobsson. A charging and rewarding scheme for packet forwarding in multi-hop cellular networks. Proceedings of MobiHoc, 2003. Google ScholarDigital Library
- R. B. Bobba, L. Eschenauer, V. D. Gligor, and W. Arbaugh. Bootstrapping Security Associations Routing in Mobile Ad-Hoc Networks. Technical Report TR 2002-44, University of Maryland, May 2002.Google Scholar
- Stefan Brands and David Chaum. Distance-bounding protocols (extended abstract). In Theory and Application of Cryptographic Techniques, pages 344--359, 1993. Google ScholarDigital Library
- S. Buchegger and J. Y. Le Boudec. Performance analysis of the confidant protocol (cooperation of nodes - fairness in dynamic ad-hoc networks). In Proceedings of MobiHoc 2002, Lausanne, June 2002 Google ScholarDigital Library
- Haowen Chan, Adrian Perrig, and Dawn Song. Random key predistribution schemes for sensor networks. In IEEE Symposium on Security and Privacy, May 2003. Google ScholarDigital Library
- D. Coppersmith and M. Jakobsson. Almost Optimal Hash Sequence Traversal. In Proceedings of the Fifth Conference on Financial Cryptography (FC'02), 2002.Google Scholar
- S. Čapkun, J.-P. Hubaux, and L. Buttyán. Mobility Helps Security in Ad Hoc Networks. In Proceedings MobiHoc, 2003. Google ScholarDigital Library
- Y. Desmedt. Major security problems with the 'unforgeable' (feige)-fiat-shamir proofs of identity and how to overcome them. In SecuriCom'88, 1988.Google Scholar
- H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli Age Matters: Efficient Route Discovery in Mobile Hoc Networks Using Encounter Ages. In Proceedings of MobiHoc, 2003. Google ScholarDigital Library
- Ralf Hauser, Antoni Przygienda, and Gene Tsudik. Reducing the Cost of Security in Link State Routing In Proceedings of NDSS, February 1997. Google ScholarDigital Library
- Y.-C. Hu, Adrian Perrig, and David B. Johnson. Packet leashes: A defense against wormhole attacks in wireless networks. In Proceedings of IEEE Infocom, April 2003.Google ScholarCross Ref
- Y.-C. Hu, D. B. Johnson, and A. Perrig. SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks. In Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications, June 2002. Google ScholarDigital Library
- Y.-C. Hu, A. Perrig, and D. B. Johnson. Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks. In Proceedings of MobiCom, September 2002. Google ScholarDigital Library
- Y.-C. Hu, A. Perrig, and D. B. Johnson. Efficient Security Mechanisms for Routing Protocols. In Proceedings of NDSS, February 2003.Google Scholar
- J.-P. Hubaux, Th. Gross, J.-Y. Le Boudec, and M. Vetterli. Toward Self-Organized Mobile Ad Hoc Networks: The Terminodes Project. IEEE Communications Magazine, January 2001. Google ScholarDigital Library
- Markus Jakobsson, Jean-Pierre Hubaux, and Levente Buttyán. A Micropayment Scheme Encouraging Collaboration in Multi-hop Cellular Networks. In Proceedings of the 7th Financial Cryptography Conference, 2003.Google Scholar
- Markus Jakobsson, Tom Leighton, Silvio Micali, and Michael Szydlo. Fractal Merkle Tree Representation and Traversal. In RSA Cryptographers Track, 2003.Google ScholarCross Ref
- Ralph C. Merkle. Protocols for Public Key Cryptosystems. In Proceedings of the IEEE Symposium on Security and Privacy, 1980.Google Scholar
- P. Papadimitratos and Z. J. Haas. Secure Routing for Mobile Ad Hoc Networks. In Proceedings of CNDS, January 2002.Google ScholarDigital Library
- Michael Peirce. Multi-Party Electronic Payments for Mobile Communications. PhD thesis, 2000.Google Scholar
- A. Perrig, R. Canetti, J. D. Tygar, and D. Song. The TESLA Broadcast Authentication Protocol. RSA CryptoBytes, 5 (Summer), 2002.Google Scholar
- K. Romer. Time Synchronization in Ad Hoc Networks. In Proceedings of MobiHoc, 2001. Google ScholarDigital Library
- K. Sanzgiri, B. Dahill, B. N. Levine, C. Shields, and E. M. Belding-Royer. A Secure Routing Protocol for Ad hoc Networks. In Proceedings of ICNP, 2002. Google ScholarDigital Library
- Naveen Sastry, Umesh Shankar, and David Wagner. Secure Verification of Location Claims. Technical Report UCB//CSD-03-1245, EECS, University of California, Berkeley, 2003.Google ScholarDigital Library
- F. Stajano. Security for Ubiquitous Computing. John Wiley and Sons, February 2002.Google ScholarDigital Library
- Brent Waters and Ed Felten. Proving the Location of Tamper-Resistant Devices. Technical report, Princeton University.Google Scholar
- Kan Zhang. Efficient Protocols for Signing Routing Messages. In Proceedings of NDSS, March 1998.Google Scholar
Index Terms
- SECTOR: secure tracking of node encounters in multi-hop wireless networks
Recommendations
Virtual address space mapping for IP auto-configuration in MANET with security capability
ICAIT '08: Proceedings of the 2008 International Conference on Advanced Infocomm TechnologyMobile Ad Hoc Networks (MANETs) are networks with self-organizing capabilities and without a fixed infrastructure. Wireless nodes communicate among themselves using multi-hop radio relaying, without requiring the packets to pass through a central access ...
Mobility helps security in ad hoc networks
MobiHoc '03: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computingContrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We propose a technique in which security associations between nodes are ...
LIP: a lightweight interlayer protocol for preventing packet injection attacks in mobile ad hoc network
Most ad hoc networks do not implement any network access control, leaving these networks vulnerable to packet injection attacks where a malicious node injects packets into the network with the goal of depleting the resources of the nodes relaying the ...
Comments