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

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

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

14 Scopus citations

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 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. We show, through both theoretical examination and simulations, that SEAR provides better security with significantly less overhead than other existing secure AODV protocols.

Original languageEnglish (US)
Title of host publicationProceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08
Pages201-204
Number of pages4
DOIs
StatePublished - 2008
Event2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08 - Tokyo, Japan
Duration: Mar 18 2008Mar 20 2008

Publication series

NameProceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08

Other

Other2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08
CountryJapan
CityTokyo
Period3/18/083/20/08

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Science Applications

Keywords

  • Authenticator
  • One-way hash function
  • SEAR

Fingerprint Dive into the research topics of 'SEAR: A secure efficient ad hoc on demand routing protocol for wireless networks'. Together they form a unique fingerprint.

Cite this