Proceedings DARPA Information Survivability Conference and Exposition
DOI: 10.1109/discex.2003.1194934
|View full text |Cite
|
Sign up to set email alerts
|

Techniques for intrusion-resistant ad hoc routing algorithms (TIARA)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 2 publications
0
3
0
Order By: Relevance
“…Security in Ariadne follows an end-to-end approach, while the SEAD protocol employs hop-by-hop security mechanisms due to the distance vector routing philosophy it adopts. Ariadne assumes the existence of a shared secret key between two nodes, and uses a message authentication code (MAC) in order to authenticate point-to-point messages between these nodes [31]. Additionally, Ariadne employs the TESLA broadcast authentication protocol to authenticate broadcast messages, such as route requests.…”
Section: Secure Efficient Ad Hoc Distance Vector Routing -Thementioning
confidence: 99%
See 1 more Smart Citation
“…Security in Ariadne follows an end-to-end approach, while the SEAD protocol employs hop-by-hop security mechanisms due to the distance vector routing philosophy it adopts. Ariadne assumes the existence of a shared secret key between two nodes, and uses a message authentication code (MAC) in order to authenticate point-to-point messages between these nodes [31]. Additionally, Ariadne employs the TESLA broadcast authentication protocol to authenticate broadcast messages, such as route requests.…”
Section: Secure Efficient Ad Hoc Distance Vector Routing -Thementioning
confidence: 99%
“…Therefore, every node that forwards the route error toward the destination of the message is able to authenticate it. The intermediate nodes buffer the route error message and its authentication does not take place until the node that generated it discloses the key [31].…”
Section: Secure Efficient Ad Hoc Distance Vector Routing -Thementioning
confidence: 99%
“…While all the nodes accommodate host-based monitoring sensors of IDS, we use a distributed algorithm to assign a few nodes to host sensors that monitor network packets, and agents that make decisions. We logically divide a mobile network into clusters (similar to Clustered Gateway Switch Routing protocol described in [9,10,11,12]) with a single cluster head for each cluster that monitors packets within the cluster.…”
Section: Agent Distributionmentioning
confidence: 99%