The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Honeycomb: creating intrusion detection signatures using honeypots
Abstract
This paper describes a system for automated generation of attack signatures for network intrusion detection systems. Our system applies pattern-matching techniques and protocol conformance checks on multiple levels in the protocol hierarchy to network traffic captured a honeypot system. We present results of running the system on an unprotected cable modem connection for 24 hours. The system successfully created precise traffic signatures that otherwise would have required the skills and time of a security officer to inspect the traffic manually.
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
Snort - Lightweight Intrusion Detection for Networks
Roesch, M. (1999) · Cited by 3,163
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
Linear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
Algorithms on strings, trees, and sequences
Gusfield, D. (1997) · Cited by 1,697
A Space-Economical Suffix Tree Construction Algorithm
McCreight, E. M. (1976) · Journal of the ACM · doi:10.1145/321941.321946 · Cited by 1,511
On-line construction of suffix trees
Ukkonen, E. (1995) · Algorithmica · doi:10.1007/bf01206331 · Cited by 1,472
(2002) · International Linear Collider · Cited by 717
Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection
Ptacek, T. H., & Newsham, T. N. (1998) · Cited by 649
Network intrusion detection: evasion, traffic normalization, and end-to-end protocol semantics
Handley, M. J., Paxson, V., & Kreibich, C. (2001) · Cited by 384
Self-citationThe Cuckoo's Egg : Tracking a Spy Through the Maze of Computer Espionage
Stoll, C. (1991) · Cited by 206
An Evening with Berferd In Which a Cracker is Lured, Endured, and Studied
Cheswick, B. (1991) · Cited by 164
The Design of a Secure Internet Gateway.
Cheswick, B. (1990) · Cited by 44
Cheswick, W. (1997) · ACM Press/Addison-Wesley Publishing Co. eBooks · Cited by 25
(1997)
Cited by
Survey of intrusion detection systems: Techniques, datasets and challenges
Khraisat, A., Gondal, I., Vamplew, P., & Kamruzzaman, J. (2019) · Cybersecurity · doi:10.1186/s42400-019-0038-7 · Cited by 2,024
Newsome, J., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6468716 · Cited by 1,270
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
Uncovering social spammers: social honeypots + machine learning
Lee, K., Caverlee, J., & Webb, S. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835522 · Cited by 619
Khraisat, A., & Alazab, A. (2021) · Cybersecurity · doi:10.1186/s42400-021-00077-7 · Cited by 508
Metadata
- Authors
- Kreibich, C., & Crowcroft, J.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2004-01
- Volume
- 34
- Issue
- 1
- Pages
- 51-56
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2033811087
- Cited by
- 523
- References
- 15
- FWCI
- 54.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.