The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Polygraph: Automatically Generating Signatures for Polymorphic Worms
Open accessAbstract
It is widely believed that content-signature-based intrusion detection systems (IDS) are easily evaded by polymorphic worms, which vary their payload on every infection attempt. In this paper, we present Polygraph, a signature generation system that successfully produces signatures that match polymorphic worms. Polygraph generates signatures that consist of multiple disjoint content substrings. In doing so, Polygraph leverages our insight that for a real-world exploit to function properly, multiple invariant substrings must often be present in all variants of a payload; these substrings typically correspond to protocol framing, return addresses, and in some cases, poorly obfuscated code. We contribute a definition of the polymorphic signature generation problem; propose classes of signature suited for matching polymorphic worm payloads; and present algorithms for automatic generation of signatures in these classes. Our evaluation of these algorithms on a range of polymorphic worms demonstrates that Polygraph produces signatures for polymorphic worms that exhibit low false negatives and false positives.
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
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
Fitting a mixture model by expectation maximization to discover motifs in biopolymers.
Bailey, T. L., & Elkan, C. (1994) · PubMed · Cited by 4,982
Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
Gusfield, D. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9780511574931 · Cited by 3,078
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
Detecting Subtle Sequence Signals: a Gibbs Sampling Strategy for Multiple Alignment
Lawrence, C. E., Altschul, S. F., Boguski, M. S., Liu, J. S., Neuwald, A. F., & Wootton, J. C. (1993) · Science · doi:10.1126/science.8211139 · Cited by 1,807
Algorithms on strings, trees, and sequences
Gusfield, D. (1997) · Cited by 1,697
Newsome, J., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6468716 · Cited by 1,270
Self-citationSingh, 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
An introduction to intrusion detection
Sundaram, A. (1996) · XRDS: Crossroads, The ACM Magazine for Students · doi:10.1145/332159.332161 · Cited by 345
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
Color Set Size problem with applications to string matching
Chi, L., & Hui, K. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-56024-6_19 · Cited by 165
MotifPrototyper: A Bayesian profile model for motif families
Xing, E. P., & Karp, R. M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0403564101 · Cited by 30
Cited by
Huang, L., Joseph, A. D., Nelson, B., Rubinstein, B. I. P., & Tygar, J. D. (2011) · Proceedings of the 4th ACM workshop on Security and artificial intelligence · doi:10.1145/2046684.2046692 · Cited by 1,194
GenProg: A Generic Method for Automatic Software Repair
Le Goues, C., Nguyen, T., Forrest, S., & Weimer, W. (2012) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2011.104 · Cited by 1,085
The security of machine learning
Barreno, M., Nelson, B., Joseph, A. D., & Tygar, J. D. (2010) · Machine Learning · doi:10.1007/s10994-010-5188-5 · Cited by 817
Schwartz, E. J., Avgerinos, T., & Brumley, D. (2010) · 2010 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2010.26 · Cited by 717
A Comprehensive Review on Malware Detection Approaches
Aslan, O., & Samet, R. (2020) · IEEE Access · doi:10.1109/access.2019.2963724 · Cited by 649
Metadata
- Authors
- Newsome, J., Karp, B., & Song, D.
- Venue
- 2005 IEEE Symposium on Security and Privacy (S&P'05)
- Publisher
- IEEE
- Published
- 2005-05-24
- Pages
- 226-241
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2137786570
- Cited by
- 670
- References
- 13
- FWCI
- 44.27
- Type
- conference paper
- Language
- en
- Open access
- green
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.