Welcome to the resource topic for 2004/159
Provably Secure On-demand Source Routing in Mobile Ad Hoc Networks
Authors: Gergely Acs, Levente Buttyan, Istvan VajdaAbstract:
Routing is one of the most basic networking functions in mobile ad
hoc networks. Hence, an adversary can easily paralyze the
operation of the network by attacking the routing protocol. This
has been realized by many researchers, and several ``secure’’
routing protocols have been proposed for ad hoc networks. However,
the security of those protocols have mainly been analyzed by
informal means only. In this paper, we argue that flaws in ad hoc
routing protocols can be very subtle, and we advocate a more
systematic way of analysis. We propose a mathematical framework in
which security can be precisely defined, and routing protocols for
mobile ad hoc networks can be analyzed rigorously. Our framework
is tailored for on-demand source routing protocols, but the
general principles are applicable to other types of protocols too.
Our approach is based on the simulation paradigm, which has
already been used extensively for the analysis of key
establishment protocols, but to the best of our knowledge, it has
not been applied in the context of ad hoc routing so far. We also
propose a new on-demand source routing protocol, called endairA,
and we demonstrate the usage of our framework by proving that it
is secure in our model.
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .