Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocols and a wide range of applications. To thwart abuse of ND and the resultant compromise of the dependent functionality of wireless systems, numerous works proposed solutions to secure ND. Nonetheless, until very recently, there has been no formal analysis of secure ND protocols. We close this gap in [24], but we concentrate primarily on the derivation of an impossibility result for a class of protocols. In this paper, we focus on reasoning about specific protocols. First, we contribute a number of extensions and refinements on the framework of [24]. As we are particularly concerned with the practicality of provably secure ND protocols, we investigate availability and redefine accordingly the ND specification, and also consider composability of ND with other protocols. Then, we propose and analyze two secure ND protocols: We revisit one of the protocols analyzed in [24], and introduce and prove correct a more elaborate challenge-response protocol.

REFERENCES

• 1: http://www.multispectral.com/.
• 2: Gergely Acs , Levente Buttyan , Istvan Vajda, Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks, IEEE Transactions on Mobile Computing, v.5 n.11, p.1533-1546, November 2006 [doi>10.1109/TMC.2006.170]
• 3: Stefan Brands , David Chaum, Distance-bounding protocols, Workshop on the theory and application of cryptographic techniques on Advances in cryptology, p.344-359, January 1994, Lofthus, Norway
• 4: L. Bussard. Trust establishment protocols for communicating devices PhD thesis, October 2004.
• 5: L. Buttyán, L. Dóra, and I. Vajda. Statistical wormhole detection in sensor networks. In Second European Workshop on Security and Privacy in Ad hoc and Sensor Networks (ESAS) July 2005.
• 6: Iliano Cervesato , Catherine Meadows , Dusko Pavlovic, An Encapsulated Authentication Logic for Reasoning about Key Distribution Protocols, Proceedings of the 18th IEEE workshop on Computer Security Foundations, p.48-61, June 20-22, 2005 [doi>10.1109/CSFW.2005.7]
• 7: J. Clulow, G. P. Hancke, M. G. Kuhn, and T. Moore. So near and yet so far: Distance-bounding attacks in wireless networks. In Third European Workshop on Security and Privacy in Ad hoc and Sensor Networks (ESAS) September 2006.
• 8: Jakob Eriksson , Srikanth Krishnamurthy , Michalis Faloutsos, TrueLink: A Practical Countermeasure to the Wormhole Attack in Wireless Networks, Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols, p.75-84, November 12-15, 2006 [doi>10.1109/ICNP.2006.320200]
• 9: Gerhard P. Hancke , Markus G. Kuhn, An RFID Distance Bounding Protocol, Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks, p.67-73, September 05-09, 2005 [doi>10.1109/SECURECOMM.2005.56]
• 10: G. P. Hancke. Practical attacks on proximity identification systems (short paper). pages 328--333, May 2006.
• 11: Gerhard P. Hancke , Markus G. Kuhn, Attacks on time-of-flight distance bounding channels, Proceedings of the first ACM conference on Wireless network security, March 31-April 02, 2008, Alexandria, VA, USA [doi>10.1145/1352533.1352566]
• 12: Youssef Hanna , Hridesh Rajan , Wensheng Zhang, Slede: a domain-specific verification framework for sensor network security protocol implementations, Proceedings of the first ACM conference on Wireless network security, March 31-April 02, 2008, Alexandria, VA, USA [doi>10.1145/1352533.1352551]
• 13: Changhua He , Mukund Sundararajan , Anupam Datta , Ante Derek , John C. Mitchell, A modular correctness proof of IEEE 802.11i and TLS, Proceedings of the 12th ACM conference on Computer and communications security, November 07-11, 2005, Alexandria, VA, USA [doi>10.1145/1102120.1102124]
• 14: L. Hu and D. Evans. Using directional antennas to prevent wormhole attacks.In Symposium on Network and Distributed Systems Security (NDSS) February 2004.
• 15: Y.-C. Hu, A. Perrig, and D. B. Johnson. Packet leashes: A defense against wormhole attacks in wireless networks. In IEEE Conference on Computer Communications INFOCOM April 2003.
• 16: R. Maheshwari, J. Gao, and S. R. Das. Detecting wormhole attacks in wireless networks using connectivity information. In IEEE Conference on Computer Communications INFOCOM May 2007.
• 17: C. Meadows, R. Poovendran, D. Pavlovic, L.-W. Chang, and P. Syverson. Distance bounding protocols: Authentication logic analysis and collusion attacks. In Secure Localization and Time Synchronization for Wireless Sensor and Ad Hoc Networks Springer-Verlag, Series: Advances in Information Security, Vol. 30.
• 18: J. Munilla, A. Ortiz, and A. Peinado. Distance bounding protocols with void-challenges for RFID. In Printed handout at the Workshop on RFID Security, RFIDSec 06, Ecrypt July 2006.
• 19: Sebastian Nanz , Chris Hankin, A framework for security analysis of mobile wireless networks, Theoretical Computer Science, v.367 n.1, p.203-227, 24 November 2006 [doi>10.1016/j.tcs.2006.08.036]
• 20: P. Papadimitratos, Z. Haas, and J.-P. Hubaux. How to Specify and How to Prove Correctness of Secure Routing Protocols for MANET. In IEEE-CS Third International Conference on Broad Band Communications, Networks, and Systems October 2006.
• 21: P. Papadimitratos, M. Poturalski, P. Schaller, P. Lafourcade, D. Basin, S. Čapkun, and J.-P. Hubaux. Secure neighborhood discovery: A fundamental element for mobile ad hoc networking. IEEE Communications Magazine Vol. 46, No. 2, February 2008.
• 22: Dusko Pavlovic and Catherine Meadows. Deriving secrecy properties in key establishment protocols. In Dieter Gollmann and Andrei Sabelfeld, editors, Proceedings of ESORICS 2006 volume 4189, September 2006.
• 23: Radha Poovendran , Loukas Lazos, A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks, Wireless Networks, v.13 n.1, p.27-59, January 2007 [doi>10.1007/s11276-006-3723-x]
• 24: Marcin Poturalski , Panos Papadimitratos , Jean-Pierre Hubaux, Secure neighbor discovery in wireless networks: formal investigation of possibility, Proceedings of the 2008 ACM symposium on Information, computer and communications security, March 18-20, 2008, Tokyo, Japan [doi>10.1145/1368310.1368338]
• 25: M. Poturalski, P. Papadimitratos, and J-P. Hubaux. Towards provable secure neighbor discovery in wireless networks. Technical Report LCA-REPORT-2008--025, EPFL, October 2008.
• 26: Kasper B. Rasmussen and Srdjan Čapkun. Implications of radio fingerprinting on the security of sensor networks. In Proceedings of IEEE Secure Comm September 2007.
• 27: Jason Reid , Juan M. Gonzalez Nieto , Tee Tang , Bouchra Senadji, Detecting relay attacks with timing-based protocols, Proceedings of the 2nd ACM symposium on Information, computer and communications security, March 20-22, 2007, Singapore [doi>10.1145/1229285.1229314]
• 28: D. Singelée and B. Preneel. Distance bounding in noisy environments.In Fourth European Workshop on Security and Privacy in Ad hoc and Sensor Networks (ESAS) July 2007.
• 29: S. Čapkun and J. P. Hubaux. Secure Positioning in Wireless Networks.IEEE Journal on Selected Areas in Communications (JSAC)24(2): 221--232, 2006.
• 30: Srdjan Čapkun , Levente Buttyán , Jean-Pierre Hubaux, SECTOR: secure tracking of node encounters in multi-hop wireless networks, Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks, October 31, 2003, Fairfax, Virginia [doi>10.1145/986858.986862]
• 31: Weichao Wang , Bharat Bhargava, Visualization of wormholes in sensor networks, Proceedings of the 3rd ACM workshop on Wireless security, October 01-01, 2004, Philadelphia, PA, USA [doi>10.1145/1023646.1023657]
• 32: Shahan Yang , John S. Baras, Modeling vulnerabilities of ad hoc routing protocols, Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks, October 31, 2003, Fairfax, Virginia [doi>10.1145/986858.986861]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Security and protection (e.g., firewalls)

General Terms:
Security

Keywords:
relay attack, secure neighbor discovery, wireless networks security