The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Vigilante: end-to-end containment of internet worms
Abstract
Worm containment must be automatic because worms can spread too fast for humans to respond. Recent work has proposed network-level techniques to automate worm containment; these techniques have limitations because there is no information about the vulnerabilities exploited by worms at the network level. We propose Vigilante, a new end-to-end approach to contain worms automatically that addresses these limitations. Vigilante relies on collaborative worm detection at end hosts, but does not require hosts to trust each other. Hosts run instrumented software to detect worms and broadcast self-certifying alerts (SCAs) upon worm detection. SCAs are proofs of vulnerability that can be inexpensively verified by any vulnerable host. When hosts receive an SCA, they generate filters that block infection by analysing the SCA-guided execution of the vulnerable software. We show that Vigilante can automatically contain fast-spreading worms that exploit unknown vulnerabilities without blocking innocuous traffic.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The Mathematics of Infectious Diseases
Hethcote, H. W. (2000) · SIAM Review · doi:10.1137/s0036144500371907 · Cited by 6,687
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Snort - Lightweight Intrusion Detection for Networks
Roesch, M. (1999) · Cited by 3,163
Bro: a system for detecting network intruders in real-time
Paxson, V. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00112-7 · Cited by 2,636
A survey of rollback-recovery protocols in message-passing systems
Elnozahy, E. N. (., Alvisi, L., Wang, Y.-M., & Johnson, D. B. (2002) · ACM Computing Surveys · doi:10.1145/568522.568525 · Cited by 1,804
Zegura, E. W., Calvert, K. L., & Bhattacharjee, S. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1996.493353 · Cited by 1,703
A Virtual Machine Introspection Based Architecture for Intrusion Detection.
Garfinkel, T., & Rosenblum, M. (2003) · Cited by 1,323
StackGuard: Automatic Adaptive Detection and Prevention of Buffer-Overflow Attacks
Cowan, C., Pu, C., Maier, D., Hintony, H., Walpole, J., Bakke, P., Beattie, S., Grier, A., Wagle, P., & Zhang, Q. (1998) · PDXScholar (Portland State University) · Cited by 1,278
How to Own the Internet in Your Spare Time
Staniford, S., Paxson, V., & Weaver, N. C. (2002) · USENIX Security Symposium · Cited by 1,169
Abadi, M., Budiu, M., Erlingsson, Ú., & Ligatti, J. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102165 · Cited by 1,032
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
Secure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., & Wallach, D. S. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844156 · Cited by 743
Self-citationSecure program execution via dynamic information flow tracking
Suh, G. E., Lee, J. W., Zhang, D., & Devadas, S. (2004) · Proceedings of the 11th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1024393.1024404 · Cited by 740
Polygraph: Automatically Generating Signatures for Polymorphic Worms
Newsome, J., Karp, B., & Song, D. (2005) · 2005 IEEE Symposium on Security and Privacy (S&P'05) · doi:10.1109/sp.2005.15 · Cited by 670
Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection
Ptacek, T. H., & Newsham, T. N. (1998) · Cited by 649
Countering code-injection attacks with instruction-set randomization
Kc, G. S., Keromytis, A. D., & Prevelakis, V. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948146 · Cited by 646
Secure Execution Via Program Shepherding
Kiriansky, V., Bruening, D. L., & Amarasinghe, S. P. (2002) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 532
Singh, S. R., Estan, C., Varghese, G., & Savage, S. (2004) · Cited by 525
Honeycomb: creating intrusion detection signatures using honeypots
Kreibich, C., & Crowcroft, J. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/972374.972384 · Cited by 523
Self-citationNecula, G. C., McPeak, S., & Weimer, W. R. (2012) · ACM SIGPLAN Notices · doi:10.1145/2442776.2442786 · Cited by 502
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
Heberlein, L. T., Dias, G. V., Levitt, K. N., Mukherjee, B., Wood, J., & Wolber, D. (1990) · Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1990.63859 · Cited by 381
Necula, G. C., McPeak, S., & Weimer, W. R. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503286 · Cited by 375
Minos: Control Data Attack Prevention Orthogonal to Memory Model
Crandall, J. R., & Chong, F. T. (2005) · Proceedings of the ... annual International Symposium on Microarchitecture/Proceedings of the annual International Symposium on Microarchitecture · doi:10.1109/micro.2004.26 · Cited by 372
Enhancing server availability and security through failure-oblivious computing
Rinard, M., Cadar, C., Dumitran, D., Roy, D. M., Leu, T., & Beebee, W. S. (2004) · Cited by 345
Secure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., & Wallach, D. S. (2002) · Proceedings of the 5th symposium on Operating systems design and implementation - OSDI '02 · doi:10.1145/1060289.1060317 · Cited by 328
Self-citationVery fast containment of scanning worms
Weaver, N. C., Staniford, S., & Paxson, V. (2004) · Cited by 266
Shield: vulnerability-driven network filters for preventing known vulnerability exploits
Wang, H. J., Guo, C., Simon, D. R., & Zugenmaier, A. (2004) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1015467.1015489 · Cited by 265
Building a Reactive Immune System for Software Services
Sidiroglou, S., Locasto, M. E., Boyd, S. W., & Keromytis, A. D. (2004) · doi:10.7916/d86d6562 · Cited by 170
Countering Network Worms Through Automatic Patch Generation
Sidiroglou, S., & Keromytis, A. D. (2005) · IEEE Security & Privacy · doi:10.1109/msp.2005.144 · Cited by 136
DIRA: Automatic Detection, Identification and Repair of Control-Hijacking Attacks.
Смирнов, А. В., & Chiueh, T. (2005) · Cited by 105
Operating System I/O Speculation: How Two Invocations Are Faster Than One
Faser, K., & Chang, F. W. (2003) · USENIX Annual Technical Conference · Cited by 50
Costa, M., Crowcroft, J., Castro, M., & Rowstron, A. I. T. (2004) · Cited by 39
Self-citation
Cited by
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs
Cadar, C., Dunbar, D., & Engler, D. (2008) · doi:10.5555/1855741.1855756 · Cited by 2,620
TaintDroid: an information-flow tracking system for realtime privacy monitoring on smartphones
Enck, W., Gilbert, P., Chun, B.-G., Cox, L. P., Jung, J., McDaniel, P. D., & Sheth, A. N. (2010) · doi:10.5555/1924943.1924971 · Cited by 2,238
Enck (2014) · doi:10.1145/2619091 · Cited by 1,203
BitBlaze: A New Approach to Computer Security via Binary Analysis
Song, D., Brumley, D., Yin, H., Caballero, J., Jager, I., Kang, M. G., Liang, Z., Newsome, J., Poosankam, P., & Saxena, P. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89862-7_1 · Cited by 718
Metadata
- Authors
- Costa, M., Crowcroft, J., Castro, M., Rowstron, A., Zhou, L., Zhang, L., & Barham, P.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 2005-10-20
- Volume
- 39
- Issue
- 5
- Pages
- 133-147
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2165100126
- Cited by
- 441
- References
- 33
- FWCI
- 70.99
- 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.