Sciweavers

85 search results - page 5 / 17
» Distance Hijacking Attacks on Distance Bounding Protocols
Sort
View
GLOBECOM
2006
IEEE
14 years 1 months ago
Wormhole Attack in Wireless Ad Hoc Networks: Analysis and Countermeasure
— The wormhole attack is one of the most severe security attacks in wireless ad hoc networks. In this paper, we analyze the effect of the wormhole attack in shortest path routing...
Majid Khabbazian, Hugues Mercier, Vijay K. Bhargav...
USS
2010
13 years 5 months ago
Realization of RF Distance Bounding
One of the main obstacles for the wider deployment of radio (RF) distance bounding is the lack of platforms that implement these protocols. We address this problem and we build a ...
Kasper Bonne Rasmussen, Srdjan Capkun
TIFS
2008
154views more  TIFS 2008»
13 years 7 months ago
On the Distinguishability of Distance-Bounded Permutations in Ordered Channels
Ordered channels, such as those provided by Internet protocol and transmission control protocol protocols, rely on sequence numbers to recover from packet reordering due to network...
Juan M. Estévez-Tapiador, Julio Césa...
ESAS
2005
Springer
14 years 28 days ago
Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks
Abstract. In this paper, we propose a framework for the security analysis of on-demand, distance vector routing protocols for ad hoc networks, such as AODV, SAODV, and ARAN. The pr...
Gergely Ács, Levente Buttyán, Istv&a...
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 3 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled