From: Adrian Perrig (adrian@ece.cmu.edu)
Date: 01/24/03
Forgot to mention the date in my previous email, the talk is on Monday 1/27.
Below is the same email, this time *with* the date.
Yih-Chun Hu is giving an interesting talk on the SEAD secure ad hoc
network routing protocol. The talk is on Monday 1/27 at noon in Wean
Hall 7220. Greetings,
Adrian
Title: SEAD: Secure Efficient Distance Vector Routing for Mobile
Wireless Ad Hoc Networks
Abstract: An ad hoc network is a collection of wireless computers
(nodes), communicating among themselves over possibly multihop
paths, without the help of any infrastructure such as base stations
or access points. Although many previous ad hoc network routing
protocols have been based in part on distance vector approaches,
they have generally assumed a trusted environment. In this paper,
we design and evaluate the Secure Efficient Ad hoc Distance vector
routing protocol (SEAD), a secure ad hoc network routing protocol
based on the design of the Destination-Sequenced Distance-Vector
routing protocol (DSDV). In order to support use with nodes of
limited CPU processing capability, and to guard against
Denial-of-Service (DoS) attacks in which an attacker attempts to
cause other nodes to consume excess network bandwidth or processing
time, we use efficient one-way hash functions and do not use
asymmetric cryptographic operations in the protocol. SEAD performs
well over the range of scenarios we tested, and is robust against
multiple uncoordinated attackers creating incorrect routing state
in any other node, even in spite of any active attackers or
compromised nodes in the network.
URL: http://monarch.cs.rice.edu/monarch-papers/wmcsa02.ps
This archive was generated by hypermail 2.1.5 : 01/24/03 EST