Routing worm: A fast, selective attack worm based on IP address information (2003)
Cached
Download Links
- [www.cs.ucf.edu]
- [tennis.ecs.umass.edu]
- [tennis.ecs.umass.edu]
- [www.cs.ucf.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 31 - 4 self |
BibTeX
@TECHREPORT{Zou03routingworm:,
author = {Cliff C. Zou and Don Towsley and Weibo Gong and Songlin Cai},
title = {Routing worm: A fast, selective attack worm based on IP address information},
institution = {},
year = {2003}
}
Years of Citing Articles
OpenURL
Abstract
Most well-known Internet worms, such as Code Red, Slammer, and Blaster, infected vulnerable computers by scanning the entire Internet IPv4 space. In this paper, we present a new scan-based worm called “routing worm”, which can use information provided by BGP routing tables to reduce its scanning space without ignoring any potential vulnerable computer. In this way, a routing worm can propagate twice to more than three times faster than a traditional worm. In addition, the geographic information of allocated IP addresses, especially BGP routing prefixes, enables a routing worm to conduct fine-grained selective attacks: hackers or terrorists can selectively impose heavy damage to vulnerable computers in a specific country, an Internet Service Provider, or an Autonomous System, without much collateral damage done to others. Routing worms can be easily implemented by attackers and they could cause considerable damage to our Internet. Since routing worms are scan-based worms, we believe that an effective way to defend against them and all other scan-based worms is to upgrade IPv4 to IPv6 — the vast address space of IPv6 ( 2 64 IP addresses for a single subnetwork) can prevent a worm from spreading through scanning. I.







