The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Wormhole attacks in wireless networks
Abstract
As mobile ad hoc network applications are deployed, security emerges as a central requirement. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts, and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them (possibly selectively) to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many ad hoc network routing protocols and location-based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a general mechanism, called packet leashes, for detecting and, thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes. We also discuss topology-based wormhole detection, and show that it is impossible for these approaches to detect some wormhole topologies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Ad-hoc on-demand distance vector routing
Perkins, C. E., & Royer, E. M. (1999) · Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.1999.749281 · Cited by 10,313
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
Self-citationHighly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190336 · Cited by 2,914
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
SPINS: security protocols for sensor networks
Perrig, A., Szewczyk, R., Wen, V., Culler, D., & Tygar, J. D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381696 · Cited by 2,532
Self-citationZhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
THE ALOHA SYSTEM: another alternative for computer communications
Abramson, N. (1970) · Proceedings of the November 17-19, 1970, fall joint computer conference on - AFIPS '70 (Fall) · doi:10.1145/1478462.1478502 · Cited by 2,029
Next century challenges: mobile networking for “Smart Dust”
Kahn, J. M., Katz, R. H., & Pister, K. S. J. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313558 · Cited by 1,660
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
Theory of Spread-Spectrum Communications - A Tutorial
Pickholtz, R., Schilling, D., & Milstein, L. (1982) · IEEE Transactions on Communications · doi:10.1109/tcom.1982.1095533 · Cited by 1,370
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks
Stajano, F., & Anderson, R. (2000) · Lecture Notes in Computer Science · doi:10.1007/10720107_24 · Cited by 1,160
Efficient authentication and signing of multicast streams over lossy channels
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848446 · Cited by 946
Self-citationBrands, S., & Chaum, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_30 · Cited by 804
THE ALOHA SYSTEM - ANOTHER ALTERNATIVE FOR COMPUTER COMMUNICATIONS
Abramson, N. (1970) · doi:10.21236/ad0707853 · Cited by 785
The quest for security in mobile ad hoc networks
Hubaux, J., Buttyán, L., & Capkun, S. (2001) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/501436.501437 · Cited by 730
A microfabricated atomic clock
Knappe, S. A., Shah, V., Schwindt, P. D. D., Hollberg, L. W., Kitching, J. E., Liew, L., & Moreland, J. (2004) · Applied Physics Letters · doi:10.1063/1.1787942 · Cited by 689
Providing robust and ubiquitous security support for mobile ad-hoc networks
Jiej, Petros, Z., Luo, H., Lu, S., & Zhang, L. (2001) · Proceedings Ninth International Conference on Network Protocols ICNP 2001 ICNP-01 · doi:10.1109/icnp.2001.992905 · Cited by 688
Using Directional Antennas to Prevent Wormhole Attacks.
Hu, L., & Evans, D. (2004) · Cited by 532
The quest for security in mobile ad hoc networks
Hubaux, J.-P., Buttyán, L., & Capkun, S. (2001) · Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '01 · doi:10.1145/501416.501437 · Cited by 453
Goldwasser, S., & Bellare, M. (1996) · Cited by 258
Visualization of wormholes in sensor networks
Wang, W., & Bhargava, B. (2004) · Proceedings of the 3rd ACM workshop on Wireless security · doi:10.1145/1023646.1023657 · Cited by 253
A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks
Poovendran, R., & Lazos, L. (2007) · Wireless Networks · doi:10.1007/s11276-006-3723-x · Cited by 224
A reliable, efficient topology broadcast protocol for dynamic networks
Bellur, B., & Ogier, R. G. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749266 · Cited by 184
Zero-interaction authentication
Corner, M. D., & Noble, B. D. (2002) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/570645.570647 · Cited by 180
Touch, J. D. (1995) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/217382.217414 · Cited by 70
Cited by
SVELTE: Real-time intrusion detection in the Internet of Things
Raza, S., Wallgren, L., & Voigt, T. (2013) · Ad Hoc Networks · doi:10.1016/j.adhoc.2013.04.014 · Cited by 907
A survey of routing attacks in mobile ad hoc networks
Kannhavong, B., Nakayama, H., Nemoto, Y., Kato, N., & Jamalipour, A. (2007) · IEEE Wireless Communications · doi:10.1109/mwc.2007.4396947 · Cited by 487
Poisoning Network Visibility in Software-Defined Networks: New Attacks and Countermeasures
Hong, S., Xu, L., Wang, H., & Gu, G. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23283 · Cited by 393
Key Reinstallation Attacks: Forcing Nonce Reuse in WPA2
Vanhoef, M., & Piessens, F. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134027 · Cited by 380
Relay Attacks on Passive Keyless Entry and Start Systems in Modern Cars
Francillon, A., Danev, B., & Čapkun, S. (2011) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-006708714 · Cited by 343
Metadata
- Authors
- Hu, Y.-C., Perrig, A., & Johnson, D. B.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2006-02
- Volume
- 24
- Issue
- 2
- Pages
- 370-380
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2157921329
- Cited by
- 660
- References
- 30
- FWCI
- 28.20
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.