Provable security fof on-demand distance vector routing in wireless ad hoc networks

Gergely Ács, L. Buttyán, István Vajda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

24 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages113-127
Number of pages15
Volume3813 LNCS
Publication statusPublished - 2005
EventSecond European Workshop on Security and Privacy in Ad-hoc and Sensor Networks, ESAS 2005 - Visegrad, Hungary
Duration: Jul 13 2005Jul 14 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3813 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherSecond European Workshop on Security and Privacy in Ad-hoc and Sensor Networks, ESAS 2005
CountryHungary
CityVisegrad
Period7/13/057/14/05

Fingerprint

Provable Security
Wireless Ad Hoc Networks
Wireless ad hoc networks
Routing Protocol
Routing protocols
Routing
Security Analysis
Ad hoc networks
Ad Hoc Networks
Paradigm
Attack
Network protocols
Demonstrate
Simulation
Framework
Demand
Model

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Ács, G., Buttyán, L., & Vajda, I. (2005). Provable security fof on-demand distance vector routing in wireless ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3813 LNCS, pp. 113-127). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3813 LNCS).

Provable security fof on-demand distance vector routing in wireless ad hoc networks. / Ács, Gergely; Buttyán, L.; Vajda, István.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3813 LNCS 2005. p. 113-127 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3813 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ács, G, Buttyán, L & Vajda, I 2005, Provable security fof on-demand distance vector routing in wireless ad hoc networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3813 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3813 LNCS, pp. 113-127, Second European Workshop on Security and Privacy in Ad-hoc and Sensor Networks, ESAS 2005, Visegrad, Hungary, 7/13/05.
Ács G, Buttyán L, Vajda I. Provable security fof on-demand distance vector routing in wireless ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3813 LNCS. 2005. p. 113-127. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Ács, Gergely ; Buttyán, L. ; Vajda, István. / Provable security fof on-demand distance vector routing in wireless ad hoc networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3813 LNCS 2005. pp. 113-127 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2148662fafc544fba103a654f9ed0306,
title = "Provable security fof 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.",
author = "Gergely {\'A}cs and L. Butty{\'a}n and Istv{\'a}n Vajda",
year = "2005",
language = "English",
isbn = "3540309128",
volume = "3813 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "113--127",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Provable security fof on-demand distance vector routing in wireless ad hoc networks

AU - Ács, Gergely

AU - Buttyán, L.

AU - Vajda, István

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

AN - SCOPUS:33745747748

SN - 3540309128

SN - 9783540309123

VL - 3813 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 113

EP - 127

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -