Modeling and Verifying Ad Hoc Routing Protocols

Mobile ad hoc networks consist of mobile wireless devices which autonomously organize their infrastructure. In such a network, a central issue, ensured by routing protocols, is to find a route from one device to another. Those protocols use cryptographic mechanisms in order to prevent a malicious node from compromising the discovered route. We present a calculus for modeling and reasoning about security protocols, including in particular secured routing protocols. Our calculus extends standard symbolic models to take into account the characteristics of routing protocols and to model wireless communication in a more accurate way. Then, by using constraint solving techniques, we propose a decision procedure for analyzing routing protocols for a bounded number of sessions and for a fixed network topology. We demonstrate the usage and usefulness of our approach by analyzing the protocol SRP applied to DSR .

• Type: Conference
• Year: 2010
• Where: CSFW
• Authors: Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune
• Keywords: CSFW 2010, Mobile Ad Hoc Networks, Routing Protocols, Secured Routing Protocols, Security Privacy