Cryptographically Sound Security Proof for On-Demand Source Routing Protocol EndairA

This paper presents the first cryptographically sound security proof of a routing protocol for mobile ad-hoc networks. More precisely, the authors show that the route discovery protocol does not output a non-existing path under arbitrary active attacks, where on a non-existing path there exists at least one pair of neighboring nodes without communication connection during the run of the route discovery protocol. The proof relies on the Dolev-Yao-style model of Backes, Pfitzmann and Waidner, which allows for mapping results obtained symbolically within this model to cryptographically sound proofs if certain assumptions are met.

Provided by: Budapest University of Technology and Economics Topic: Networking Date Added: Mar 2011 Format: PDF

Find By Topic