Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks

Gergely Ács, Levente Buttyán, I. Vajda

Research output: Contribution to journalArticle

126 Citations (Scopus)

Abstract

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 has 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 proved to be secure in a rigorous manner. 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 use of our framework by proving that it is secure in our model.

Original languageEnglish
Pages (from-to)1533-1546
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume5
Issue number11
DOIs
Publication statusPublished - 2006

Fingerprint

Mobile ad hoc networks
Routing protocols
Network protocols
Ad hoc networks
Defects

Keywords

  • Mobile ad hoc networks
  • provable security
  • secure routing

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks. / Ács, Gergely; Buttyán, Levente; Vajda, I.

In: IEEE Transactions on Mobile Computing, Vol. 5, No. 11, 2006, p. 1533-1546.

Research output: Contribution to journalArticle

Ács, Gergely ; Buttyán, Levente ; Vajda, I. / Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks. In: IEEE Transactions on Mobile Computing. 2006 ; Vol. 5, No. 11. pp. 1533-1546.
@article{7f6cb6a7f24e4be1ad91a8efb67fa2fc,
title = "Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks",
abstract = "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 has 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 proved to be secure in a rigorous manner. 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 use of our framework by proving that it is secure in our model.",
keywords = "Mobile ad hoc networks, provable security, secure routing",
author = "Gergely {\'A}cs and Levente Butty{\'a}n and I. Vajda",
year = "2006",
doi = "10.1109/TMC.2006.170",
language = "English",
volume = "5",
pages = "1533--1546",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks

AU - Ács, Gergely

AU - Buttyán, Levente

AU - Vajda, I.

PY - 2006

Y1 - 2006

N2 - 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 has 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 proved to be secure in a rigorous manner. 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 use of our framework by proving that it is secure in our model.

AB - 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 has 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 proved to be secure in a rigorous manner. 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 use of our framework by proving that it is secure in our model.

KW - Mobile ad hoc networks

KW - provable security

KW - secure routing

UR - http://www.scopus.com/inward/record.url?scp=85008543309&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85008543309&partnerID=8YFLogxK

U2 - 10.1109/TMC.2006.170

DO - 10.1109/TMC.2006.170

M3 - Article

AN - SCOPUS:85008543309

VL - 5

SP - 1533

EP - 1546

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 11

ER -