An Efficient Secure Route Discovery Protocol for DSR

Ensuring cryptographic integrity of the route discovery process in on demand ad hoc routing approaches like dynamic source routing (DSR) require the ability to verify that no nodes have been deleted from the path, and no node can be inserted in the path without a valid authentication. We discuss the need for early detection of inconsistencies involving inserted or deleted nodes in route request (RREQ) packets and investigate the challenges associated with catering for this requirement. We propose an efficient strategy to achieve this employing only symmetric cryptographic primitives, which is made possible due to a recently proposed multi-source broadcast encryption scheme. We outline a protocol for secure route discovery in DSR that employs such a security primitive, and provide quantitative estimates (through simulations) of gains that can be achieved by early detection of inconsistent RREQs.

[1]  Panagiotis Papadimitratos,et al.  Secure link state routing for mobile ad hoc networks , 2003, 2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings..

[2]  Mahalingam Ramkumar Broadcast Encryption Using Probabilistic Key Distribution and Applications , 2006, J. Comput..

[3]  Donal O'Mahony,et al.  Secure routing for mobile ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.

[4]  Ran Canetti,et al.  Efficient and Secure Source Authentication for Multicast , 2001, NDSS.

[5]  Moni Naor,et al.  Revocation and Tracing Schemes for Stateless Receivers , 2001, CRYPTO.

[6]  Gene Tsudik,et al.  SRDP: securing route discovery in DSR , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[7]  Yih-Chun Hu,et al.  Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2002, MobiCom '02.

[8]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[9]  Ahmed Obied,et al.  Broadcast Encryption , 2008, Encyclopedia of Multimedia.

[10]  Mahalingam Ramkumar NIS06-2: I-HARPS: An Efficient Key Predistribution Scheme for Mobile Computing Applications , 2006, IEEE Globecom 2006.