Data networks (2nd ed.)
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Password authentication with insecure communication
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Cryptography: Theory and Practice,Second Edition
Cryptography: Theory and Practice,Second Edition
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Scalable analysis and design of ad hoc networks via random graph theory
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Rushing attacks and defense in wireless ad hoc network routing protocols
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
The sybil attack in sensor networks: analysis & defenses
Proceedings of the 3rd international symposium on Information processing in sensor networks
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
SeRLoc: secure range-independent localization for wireless sensor networks
Proceedings of the 3rd ACM workshop on Wireless security
Visualization of wormholes in sensor networks
Proceedings of the 3rd ACM workshop on Wireless security
Robust statistical methods for securing wireless localization in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Attack-resistant location estimation in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
ROPE: robust position estimation in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Almost optimal hash sequence traversal
FC'02 Proceedings of the 6th international conference on Financial cryptography
Analysis of range-free anchor-free localization in a wsn under wormhole attack
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Interactive wormhole detection and evaluation
Information Visualization
Visualisation of wormholes in underwater sensor networks: a distributed approach
International Journal of Security and Networks
Secure neighbor discovery in wireless networks: formal investigation of possibility
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Secure sensor network routing: a clean-slate approach
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Towards provable secure neighbor discovery in wireless networks
Proceedings of the 6th ACM workshop on Formal methods in security engineering
A practical secure neighbor verification protocol for wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
Resilient cluster leader election for wireless sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Wireless sensor network wormhole avoidance using disturbance-based routing schemes
ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
Secure walking GPS: a secure localization and key distribution scheme for wireless sensor networks
Proceedings of the third ACM conference on Wireless network security
Security-aware routing and localization for a directional mission critical network
IEEE Journal on Selected Areas in Communications
Wormhole-resilient secure neighbor discovery in underwater acoustic networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Secure multi-agent system for multi-hop environments
MMM-ACNS'10 Proceedings of the 5th international conference on Mathematical methods, models and architectures for computer network security
A sinkhole resilient protocol for wireless sensor networks: Performance and security analysis
Computer Communications
Statistical wormhole detection in sensor networks
ESAS'05 Proceedings of the Second European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Local connectivity tests to identify wormholes in wireless networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Detecting communities in sparse MANETs
IEEE/ACM Transactions on Networking (TON)
Wormholes no more? localized wormhole detection and prevention in wireless networks
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
A scalable wireless routing protocol secure against route truncation attacks
CMS'10 Proceedings of the 11th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security
Secure Neighborhood Creation in Wireless Ad Hoc Networks using Hop Count Discrepancies
Mobile Networks and Applications
CTAC: Control traffic tunneling attacks' countermeasures in mobile wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Topological detection on wormholes in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
On physical-layer identification of wireless devices
ACM Computing Surveys (CSUR)
Journal of Computer and System Sciences
Hi-index | 0.00 |
Wireless ad hoc networks are envisioned to be randomly deployed in versatile and potentially hostile environments. Hence, providing secure and uninterrupted communication between the un-tethered network nodes becomes a critical problem. In this paper, we investigate the wormhole attack in wireless ad hoc networks, an attack that can disrupt vital network functions such as routing. In the wormhole attack, the adversary establishes a low-latency unidirectional or bi-directional link, such as a wired or long-range wireless link, between two points in the network that are not within communication range of each other. The attacker then records one or more messages at one end of the link, tunnels them via the link to the other end, and replays them into the network in a timely manner. The wormhole attack is easily implemented and particularly challenging to detect, since it does not require breach of the authenticity and confidentiality of communication, or the compromise of any host. We present a graph theoretic framework for modeling wormhole links and derive the necessary and sufficient conditions for detecting and defending against wormhole attacks. Based on our framework, we show that any candidate solution preventing wormholes should construct a communication graph that is a subgraph of the geometric graph defined by the radio range of the network nodes. Making use of our framework, we propose a cryptographic mechanism based on local broadcast keys in order to prevent wormholes. Our solution does not need time synchronization or time measurement, requires only a small fraction of the nodes to know their location, and is decentralized. Hence, it is suitable for networks with the most stringent constraints such as sensor networks. Finally, we believe our work is the first to provide an analytical evaluation in terms of probabilities of the extent to which a method prevents wormholes.