SEAR: A secure efficient ad hoc on demand routing protocol for wireless networks

Qing Li, Meiyuan Zhao, Jesse Walker, Yih-Chun Hu, Adrian Perrig, Wade Trappe

Research output: Contribution to journalArticle

Abstract

Multi-hop routing is essential to the operation of wireless ad hoc networks. Unfortunately, it is very easy for an adversary to forge or modify routing messages to inflict severe damage on the underlying routing protocol. In this paper, we present SEAR, a secure efficient ad hoc routing (SEAR) protocol for ad hoc networks that is mainly based on efficient symmetric cryptography, with asymmetric cryptography used only for the distribution of initial key commitments. SEAR uses one-way hash functions to protect the propagation of the routing messages. Intermediate nodes verify the routing messages by applying one-way functions, while malicious nodes cannot construct beneficial false routing messages when forwarding them. Route error (RERR) messages are protected through a variation of the TESLA broadcast authentication scheme. The SEAR protocol does not require any additional routing packet formats, and thus follows the same basic design as ad hoc on-demand distance vector (AODV). We show, through both theoretical examination and simulations, that SEAR provides better security with significantly less overhead than other existing secure AODV (SAODV) protocols.

Original languageEnglish (US)
Pages (from-to)325-340
Number of pages16
JournalSecurity and Communication Networks
Volume2
Issue number4
DOIs
StatePublished - Jan 1 2009

Fingerprint

Routing protocols
Wireless networks
Cryptography
Hash functions
Wireless ad hoc networks
Ad hoc networks
Authentication
Network protocols

Keywords

  • Ad hoc networks
  • Authenticator
  • One-way hash function
  • SEAR
  • Secure routing

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Cite this

SEAR : A secure efficient ad hoc on demand routing protocol for wireless networks. / Li, Qing; Zhao, Meiyuan; Walker, Jesse; Hu, Yih-Chun; Perrig, Adrian; Trappe, Wade.

In: Security and Communication Networks, Vol. 2, No. 4, 01.01.2009, p. 325-340.

Research output: Contribution to journalArticle

Li, Qing ; Zhao, Meiyuan ; Walker, Jesse ; Hu, Yih-Chun ; Perrig, Adrian ; Trappe, Wade. / SEAR : A secure efficient ad hoc on demand routing protocol for wireless networks. In: Security and Communication Networks. 2009 ; Vol. 2, No. 4. pp. 325-340.
@article{52779ca6ef014a26bc798ecb27937de4,
title = "SEAR: A secure efficient ad hoc on demand routing protocol for wireless networks",
abstract = "Multi-hop routing is essential to the operation of wireless ad hoc networks. Unfortunately, it is very easy for an adversary to forge or modify routing messages to inflict severe damage on the underlying routing protocol. In this paper, we present SEAR, a secure efficient ad hoc routing (SEAR) protocol for ad hoc networks that is mainly based on efficient symmetric cryptography, with asymmetric cryptography used only for the distribution of initial key commitments. SEAR uses one-way hash functions to protect the propagation of the routing messages. Intermediate nodes verify the routing messages by applying one-way functions, while malicious nodes cannot construct beneficial false routing messages when forwarding them. Route error (RERR) messages are protected through a variation of the TESLA broadcast authentication scheme. The SEAR protocol does not require any additional routing packet formats, and thus follows the same basic design as ad hoc on-demand distance vector (AODV). We show, through both theoretical examination and simulations, that SEAR provides better security with significantly less overhead than other existing secure AODV (SAODV) protocols.",
keywords = "Ad hoc networks, Authenticator, One-way hash function, SEAR, Secure routing",
author = "Qing Li and Meiyuan Zhao and Jesse Walker and Yih-Chun Hu and Adrian Perrig and Wade Trappe",
year = "2009",
month = "1",
day = "1",
doi = "10.1002/sec.60",
language = "English (US)",
volume = "2",
pages = "325--340",
journal = "Security and Communication Networks",
issn = "1939-0122",
publisher = "John Wiley and Sons Inc.",
number = "4",

}

TY - JOUR

T1 - SEAR

T2 - A secure efficient ad hoc on demand routing protocol for wireless networks

AU - Li, Qing

AU - Zhao, Meiyuan

AU - Walker, Jesse

AU - Hu, Yih-Chun

AU - Perrig, Adrian

AU - Trappe, Wade

PY - 2009/1/1

Y1 - 2009/1/1

N2 - Multi-hop routing is essential to the operation of wireless ad hoc networks. Unfortunately, it is very easy for an adversary to forge or modify routing messages to inflict severe damage on the underlying routing protocol. In this paper, we present SEAR, a secure efficient ad hoc routing (SEAR) protocol for ad hoc networks that is mainly based on efficient symmetric cryptography, with asymmetric cryptography used only for the distribution of initial key commitments. SEAR uses one-way hash functions to protect the propagation of the routing messages. Intermediate nodes verify the routing messages by applying one-way functions, while malicious nodes cannot construct beneficial false routing messages when forwarding them. Route error (RERR) messages are protected through a variation of the TESLA broadcast authentication scheme. The SEAR protocol does not require any additional routing packet formats, and thus follows the same basic design as ad hoc on-demand distance vector (AODV). We show, through both theoretical examination and simulations, that SEAR provides better security with significantly less overhead than other existing secure AODV (SAODV) protocols.

AB - Multi-hop routing is essential to the operation of wireless ad hoc networks. Unfortunately, it is very easy for an adversary to forge or modify routing messages to inflict severe damage on the underlying routing protocol. In this paper, we present SEAR, a secure efficient ad hoc routing (SEAR) protocol for ad hoc networks that is mainly based on efficient symmetric cryptography, with asymmetric cryptography used only for the distribution of initial key commitments. SEAR uses one-way hash functions to protect the propagation of the routing messages. Intermediate nodes verify the routing messages by applying one-way functions, while malicious nodes cannot construct beneficial false routing messages when forwarding them. Route error (RERR) messages are protected through a variation of the TESLA broadcast authentication scheme. The SEAR protocol does not require any additional routing packet formats, and thus follows the same basic design as ad hoc on-demand distance vector (AODV). We show, through both theoretical examination and simulations, that SEAR provides better security with significantly less overhead than other existing secure AODV (SAODV) protocols.

KW - Ad hoc networks

KW - Authenticator

KW - One-way hash function

KW - SEAR

KW - Secure routing

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

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

U2 - 10.1002/sec.60

DO - 10.1002/sec.60

M3 - Article

AN - SCOPUS:70049105507

VL - 2

SP - 325

EP - 340

JO - Security and Communication Networks

JF - Security and Communication Networks

SN - 1939-0122

IS - 4

ER -