8 citations found. Retrieving documents...
Manel Guerrero Zapata. Secure Ad hoc On-Demand Distance Vector (SAODV) Routing. IETF MANET Mailing List, Message-ID 3BC17B40.BBF52E09@nokia.com, ftp://manet.itd.nrl.navy.mil/pub/manet/2001-10.mail, October 8, 2001.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc.. - Hu, Perrig, Johnson (2002)   (86 citations)  (Correct)

....to high performance workstations. To make our results as general as possible, we have designed Ariadne to support nodes with few resources, such as a Palm Pilot or RIM pager. Most previous work on secure ad hoc network routing relies on asymmetric cryptography such as digital signatures [56, 58]. However, computing such signatures on resource constrained nodes is expensive, and we assume that nodes in the ad hoc network may be so constrained. For example, Brown et al. analyze the computation time of digital signature algorithms on various platforms [8] on a Palm Pilot or RIM pager, a ....

....rates of mobility in an ad hoc network. Kumar also discusses threats to both distance vector protocols and link state protocols, and describes techniques for securing distance vector protocols. However, these techniques are vulnerable to the compromise of a single node. Zhou and Haas [58] Zapata [56], and Dahill et al. [13] propose the use of asymmetric cryptography to secure on demand ad hoc network routing protocols. However, as above, when the nodes in an ad hoc network are generally unable to verify asymmetric signatures quickly enough, or when network bandwidth is insufficient, these ....

Manel Guerrero Zapata. Secure Ad hoc On-Demand Distance Vector (SAODV) Routing. IETF MANET Mailing List, Message-ID: 3BC17B40.BBF52E09@nokia.com, Available at ftp://manet.itd.nrl.navy.mil/ pub/manet/2001-10.mail, October 8, 2001.


Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc.. - Hu, Perrig, Johnson (2002)   (86 citations)  (Correct)

....to high performance workstations. To make our results as general as possible, we have designed Ariadne to support nodes with few resources, such as a Palm Pilot or RIM pager. Most previous work on secure ad hoc network routing relies on asymmetric cryptography such as digital signatures [55, 57]. However, computing such signatures on resource constrained nodes is expensive, and we assume that nodes in the ad hoc network may be so constrained. For example, Brown et al. analyze the computation time of digital signature algorithms on various platforms [8] on a Palm Pilot or RIM pager, a ....

....rates of mobility in an ad hoc network. Kumar also discusses threats to both distance vector protocols and link state protocols, and describes techniques for securing distance vector protocols. However, these techniques are vulnerable to the compromise of a single node. Zhou and Haas [57] Zapata [55], and Dahill et al. [12] propose the use of asymmetric cryptography to secure on demand ad hoc network routing protocols. However, as above, when the nodes in an ad hoc network are generally unable to verify asymmetric signatures quickly enough, or when network bandwidth is insufficient, these ....

Manel Guerrero Zapata. Secure Ad hoc On-Demand Distance Vector (SAODV) Routing. IETF MANET Mailing List, Message-ID: 3BC17B40.BBF52E09@nokia.com, Available at ftp://manet.itd.nrl.navy.mil/ pub/manet/2001-10.mail, October 8, 2001.


Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc.. - Hu, Perrig, Johnson (2002)   (86 citations)  (Correct)

....to high performance workstations. To make our results as general as possible, we have designed Ariadne to support nodes with few resources, such as a Palm Pilot or RIM pager. Most previous work on secure ad hoc network routing relies on asymmetric cryptography such as digital signatures [56, 58]. However, computing such signatures on resource constrained nodes is expensive, and we assume that nodes in the ad hoc network may be so constrained. For example, Brown et al. analyze the computation time of digital signature algorithms on various platforms [8] on a Palm Pilot or RIM pager, a ....

....rates of mobility in an ad hoc network. Kumar also discusses threats to both distance vector protocols and link state protocols, and describes techniques for securing distance vector protocols. However, these techniques are vulnerable to the compromise of a single node. Zhou and Haas [58] Zapata [56], and Dahill et al. [13] propose the use of asymmetric cryptography to secure on demand ad hoc network routing protocols. However, as above, when the nodes in an ad hoc network are generally unable to verify asymmetric signatures quickly enough, or when network bandwidth is insufficient, these ....

Manel Guerrero Zapata. Secure Ad hoc On-Demand Distance Vector (SAODV) Routing. IETF MANET Mailing List, Message-ID: 3BC17B40.BBF52E09@nokia.com, Available at ftp://manet.itd.nrl.navy. mil/ pub/manet/2001-10.mail, October 8, 2001.


Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc.. - Hu, Perrig, Johnson (2002)   (86 citations)  (Correct)

....We present the design and performance evaluation of a new on demand secure ad hoc network routing protocol, called Ariadne, that withstands node compromise and relies only on highly efficient symmetric cryptography. Relative to previous work in securing ad hoc network routing protocols (e.g. [5, 21, 52, 61, 70, 90, 92]) Ariadne is either more secure, more efficient, or more general (e.g. Ariadne does not require a trusted infrastructure and does not require powerful processors) In Section 2, we summarize the basic operation of the Dynamic Source Routing protocol (DSR) 37, 38, 39] on which we base the ....

....nodes perhaps equivalent in functionality to high performance workstations. To make our results as general as possible, we design our protocol for nodes with minimal resources. Most previous work on secure ad hoc network routing relies on asymmetric cryptography such as digital signatures [90, 92]. However, computing such signatures on resource constrained nodes is quite expensive [5, 70] and we assume that some nodes in the ad hoc network may be so constrained. For example, Brown et al. analyze the computation time of digital signature algorithms on various platforms [13] on a Palm ....

[Article contains additional citation context not shown here]

Manel Guerrero Zapata. Secure Ad hoc On-Demand Distance Vector (SAODV) routing. IETF MANET Mailing List, Message-ID: 3BC 17B40.BBF52E09 @nokia.com, Available at ftp://manet.itd.nrl.navy. mil/pub/manet/ 2001-10.mail, October 8, 2001.


SEAD: Secure Efficient Distance Vector Routing for Mobile.. - Hu, Johnson, Perrig (2002)   (41 citations)  (Correct)

....vector routing protocols, and present countermeasures that provide security. However, their techniques do not apply well in an ad hoc network since they require knowledge of which links are possible, whereas in an ad hoc network, any pair of nodes could be within range and form a link. Zapata [43] proposes security extensions to AODV, using a new one way hash chain for each Route Discovery to secure the metric field in an RREQ packet. Our protocol uses a single hash chain for a node s routing information and can therefore authenticate sequence number information, and also minimizes the ....

....[2, 26] These protocols protect the integrity of the packet from modification, but they do not prevent a node from advertising a route that does not actually exist. Several researchers have proposed the use of asymmetric cryptography to secure both wired and ad hoc network routing protocols [9, 22, 33, 43, 44]. However, when the nodes in an ad hoc network are unable to verify asymmetric signatures quickly enough, these protocols may not be suitable and may create Denial of Service (DOS) attacks; these protocols also generally require more network bandwidth than does SEAD with its hash values. Cheung ....

Manel Guerrero Zapata. Secure Ad hoc On-Demand Distance Vector (SAODV) Routing. 1ETF MANET Mailing List, Message-ID 3BC17B40.BBF52E09@nokia.com, ftp://manet .itd.nrl.navy. mil/pub/manet/2001-10.mail, Octo- ber 8, 2001.


SEAD: Secure Efficient Distance Vector Routing - For Mobile Wireless   (Correct)

No context found.

Manel Guerrero Zapata. Secure Ad hoc On-Demand Distance Vector (SAODV) Routing. IETF MANET Mailing List, Message-ID 3BC17B40.BBF52E09@nokia.com, ftp://manet.itd.nrl.navy.mil/pub/manet/2001-10.mail, October 8, 2001.


Performance of the Ad-hoc On-Demand Distance Vector Routing.. - Kullberg (2004)   (Correct)

No context found.

Manel Guerrero Zapata. Secure Ad hoc On-Demand Distance Vector (SAODV) Routing". IETF Internet Draft, draft-guerrero-manet-saodv-00.txt, August 2001 (Work in Progress).


SEAD: Secure Efficient Distance Vector Routing for Mobile.. - Hu, Johnson, Perrig (2002)   (41 citations)  (Correct)

No context found.

Manel Guerrero Zapata. Secure Ad hoc On-Demand Distance Vector (SAODV) Routing. IETF MANET Mailing List, Message-ID 3BC17B40.BBF52E09@nokia.com, ftp://manet.itd.nrl.navy.mil/pub/manet/2001-10.mail, October 8, 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC