The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
A Taxonomy of Botnet Structures
Abstract
We propose a taxonomy of botnet structures, based on their utility to the botmaster. We propose key metrics to measure their utility for various activities (e.g., spam, ddos). Using these performance metrics, we consider the ability of different response techniques to degrade or disrupt botnets. In particular, our models show that targeted responses are particularly effective against scale free botnets and efforts to increase the robustness of scale free networks comes at a cost of diminished transitivity. Botmasters do not appear to have any structural solutions to this problem in scale free networks. We also show that random graph botnets (e.g., those using P2P formations) are highly resistant to both random and targeted responses. We evaluate the impact of responses on different topologies using simulation and demonstrate the utility of our proposed metrics by performing novel measurements of a P2P network. Our analysis shows how botnets may be classified according to structure and given rank or priority using our proposed metrics. This may help direct responses and suggests which general remediation strategies are more likely to succeed.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
Bollobás, B. (1985) · Cited by 6,196
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Attack vulnerability of complex networks
Holme, P., Kim, B. J., Yoon, C. N., & Han, S. K. (2002) · Physical Review E · doi:10.1103/physreve.65.056109 · Cited by 1,891
Search and replication in unstructured peer-to-peer networks
Lv, Q., Cao, P., Cohen, E., Li, K., & Shenker, S. J. (2014) · International Conference on Supercomputing · doi:10.1145/2591635.2667182 · Cited by 1,612
Moore, D., Paxson, V., Savage, S., Shannon, C., Staniford, S., & Weaver, N. (2003) · IEEE Security & Privacy · doi:10.1109/msecp.2003.1219056 · Cited by 973
Code-Red: a case study on the spread and victims of an internet worm
Moore, D., Shannon, C., & claffy, K. (2002) · Proceedings of the second ACM SIGCOMM Workshop on Internet measurment - IMW '02 · doi:10.1145/637201.637244 · Cited by 787
Code red worm propagation modeling and analysis
Zou, C. C., Gong, W., & Towsley, D. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586130 · Cited by 722
BotHunter: detecting malware infection through IDS-driven dialog correlation
Gu, G., Porras, P. A., Yegneswaran, V., Fong, M. W., & Lee, W. (2007) · Cited by 696
Self-citationA multifaceted approach to understanding the botnet phenomenon
Abu Rajab, M., Zarfoss, J., Monrose, F., & Terzis, A. (2006) · Proceedings of the 6th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1177080.1177086 · Cited by 595
Internet quarantine: requirements for containing self-propagating code
Moore, D., Shannon, C., Voelker, G. M., & Savage, S. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209212 · Cited by 494
The Zombie roundup: understanding, detecting, and disrupting botnets
Cooke, E. M., Jahanian, F., & McPherson, D. (2005) · Cited by 489
Weaver, N. C., Paxson, V., Staniford, S., & Cunningham, R. K. (2003) · Workshop on Rapid Malcode · doi:10.1145/948187.948190 · Cited by 455
A taxonomy of computer program security flaws
Landwehr, C. E., Bull, A. R., McDermott, J. P., & Choi, W. S. (1994) · ACM Computing Surveys · doi:10.1145/185403.185412 · Cited by 449
Zhang⋆, Y., & Paxson, V. (2000) · Cited by 385
Peer-to-peer botnets: overview and case study
Grizzard, J. B., Sharma, V., Nunnery, C., Kang, B. B., & Dagon, D. (2007) · Cited by 353
Self-citationOn estimating end-to-end network path properties
Allman, M., & Paxson, V. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316230 · Cited by 344
Modeling Botnet Propagation Using Time Zones.
Dagon, D., Zou, C. C., & Lee, W. (2006) · Network and Distributed System Security Symposium · Cited by 343
Self-citationAn Advanced Hybrid Peer-to-Peer Botnet
Wang, P., Sparks, S., & Zou, C. C. (2010) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2008.35 · Cited by 333
Wide-scale botnet detection and characterization
Karasaridis, A., Rexroad, B., & Hoeflin, D. (2007) · Conference on Workshop on Hot Topics in Understanding Botnets · Cited by 320
Eclipse Attacks on Overlay Networks: Threats and Defenses
Singh, A., Ngan, T.-W., Druschel, P., & Wallach, D. S. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.231 · Cited by 317
Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems
Ripeanu, M., & Foster, I. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_8 · Cited by 315
Rishi: identify bot contaminated hosts by IRC nickname evaluation
Goebel, J., & Holz, T. (2007) · Cited by 298
Barford, P., & Yegneswaran, V. (2007) · Springer eBooks · doi:10.1007/978-0-387-44599-1_8 · Cited by 287
How to systematically classify computer security intrusions
Lindqvist, U., & Jonsson, E. (2002) · Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097) · doi:10.1109/secpri.1997.601330 · Cited by 264
Worm propagation modeling and analysis under dynamic quarantine defense
Zou, C. C., Gong, W., & Towsley, D. (2003) · Proceedings of the 2003 ACM workshop on Rapid malcode · doi:10.1145/948187.948197 · Cited by 251
My botnet is bigger than yours (maybe, better than yours): why size estimates remain challenging
Rajab, M. A., Zarfoss, J., Monrose, F., & Terzis, A. (2007) · Conference on Workshop on Hot Topics in Understanding Botnets · Cited by 220
A Taxonomy of Computer Program Security Flaws, with Examples
Landwehr, C. E., Bull, A. R., McDermott, J. P., & Choi, W. S. (1994) · doi:10.21236/ada465587 · Cited by 137
Routing Worm: A Fast, Selective Attack Worm Based on IP Address Information
Zou, C. C., Towsley, D., Gong, W., et al. (2005) · Workshop on Principles of Advanced and Distributed Simulation (PADS) · doi:10.1109/pads.2005.24 · Cited by 108
Vogt, R., Aycock, J., & Jacobson, M. J. (2007) · Cited by 97
A defense-centric taxonomy based on attack manifestations
Killourhy, K. S., Maxion, R. A., & Tan, K. M. C. (2004) · International Conference on Dependable Systems and Networks, 2004 · doi:10.1109/dsn.2004.1311881 · Cited by 64
Internet Relay Chat: Architecture
Kalt, C. (2000) · doi:10.17487/rfc2810 · Cited by 57
Virtual Playgrounds for Worm Behavior Investigation
Jiang, X., Xu, D., Wang, H. J., & Spafford, E. H. (2006) · Lecture notes in computer science · doi:10.1007/11663812_1 · Cited by 41
Cited by
Your botnet is my botnet: analysis of a botnet takeover
Stone-Gross, B., Cova, M., Cavallaro, L., Gilbert, B., Szydlowski, M., Kemmerer, R., Kruegel, C., & Vigna, G. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653738 · Cited by 577
An Overview of IP Flow-Based Intrusion Detection
Sperotto, A., Schaffrath, G., Sadre, R., Morariu, C., Pras, A., & Stiller, B. (2010) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2010.032210.00054 · Cited by 466
A Survey of Botnet and Botnet Detection
Feily, M., Shahrestani, A., & Ramadass, S. (2009) · 2009 Third International Conference on Emerging Security Information, Systems and Technologies · doi:10.1109/securware.2009.48 · Cited by 383
A Survey of Random Forest Based Methods for Intrusion Detection Systems
Resende, P. A. A., & Drummond, A. C. (2019) · ACM Computing Surveys · doi:10.1145/3178582 · Cited by 368
Silva, S. S. C., Silva, R. M. P., Pinto, R. C. G., & Salles, R. M. (2013) · Computer Networks · doi:10.1016/j.comnet.2012.07.021 · Cited by 356
Metadata
- Authors
- Dagon, D., Gu, G., Lee, C. P., & Lee, W.
- Venue
- Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007)
- Publisher
- IEEE
- Published
- 2007-12
- Pages
- 325-339
- OpenAlex
- W2152955531
- Cited by
- 255
- References
- 40
- FWCI
- 33.42
- Type
- conference paper
- 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.