Sciweavers

Share
ESAS
2005
Springer

Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks

9 years 28 days ago
Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks
Abstract. In this paper, we propose a framework for the security analysis of on-demand, distance vector routing protocols for ad hoc networks, such as AODV, SAODV, and ARAN. The proposed approach is an adaptation of the simulation paradigm that is used extensively for the analysis of cryptographic algorithms and protocols, and it provides a rigorous method for proving that a given routing protocol is secure. We demonstrate the approach by representing known and new attacks on SAODV in our framework, and by proving that ARAN is secure in our model.
Gergely Ács, Levente Buttyán, Istv&a
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ESAS
Authors Gergely Ács, Levente Buttyán, István Vajda
Comments (0)
books