Sciweavers

85 search results - page 7 / 17
» Distance Hijacking Attacks on Distance Bounding Protocols
Sort
View
ADHOC
2005
134views more  ADHOC 2005»
14 years 9 months ago
How to misuse AODV: a case study of insider attacks against mobile ad-hoc routing protocols
This paper presents a systematic analysis of insider attacks against mobile ad-hoc routing protocols, using the Ad hoc On-Demand Distance Vector (AODV) protocol as an example. It ...
Peng Ning, Kun Sun
INFOCOM
2011
IEEE
14 years 1 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
RFIDSEC
2010
14 years 8 months ago
Cryptanalysis of the David-Prasad RFID Ultralightweight Authentication Protocol
In September 2009, David and Prasad proposed at MobiSec’09 an interesting new ultralightweight mutual authentication protocol for low-cost RFID tags. In this paper, we present a ...
Julio César Hernández Castro, Pedro ...
ACISP
2009
Springer
15 years 4 months ago
Towards Denial-of-Service-Resilient Key Agreement Protocols
Denial of service resilience is an important practical consideration for key agreement protocols in any hostile environment such as the Internet. There are well-known models that ...
Douglas Stebila, Berkant Ustaoglu
TPHOL
2000
IEEE
15 years 2 months ago
Routing Information Protocol in HOL/SPIN
We provide a proof using HOL and SPIN of convergence for the Routing Information Protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp re...
Karthikeyan Bhargavan, Carl A. Gunter, Davor Obrad...