The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A fast automaton-based method for detecting anomalous program behaviors
Abstract
Anomaly detection on system call sequences has become perhaps the most successful approach for detecting novel intrusions. A natural way for learning sequences is to use a finite-state automaton (FSA). However previous research indicates that FSA-learning is computationally expensive, that it cannot be completely automated or that the space usage of the FSA may be excessive. We present a new approach that overcomes these difficulties. Our approach builds a compact FSA in a fully automatic and efficient manner, without requiring access to source code for programs. The space requirements for the FSA is low - of the order of a few kilobytes for typical programs. The FSA uses only a constant time per system call during the learning as well as the detection period. This factor leads to low overheads for intrusion detection. Unlike many of the previous techniques, our FSA-technique can capture both short term and long term temporal relationships among system calls, and thus perform more accurate detection. This enables our approach to generalize and predict future behaviors from past behaviors. As a result, the training periods needed for our FSA based approach are shorter. Moreover false positives are reduced without increasing the likelihood of missing attacks. This paper describes our FSA based technique and presents a comprehensive experimental evaluation of the technique.
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
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Intrusion detection using sequences of system calls
Hofmeyr, S. A., Forrest, S., & Somayaji, A. (1998) · Journal of Computer Security · doi:10.3233/jcs-980109 · Cited by 1,313
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
Data Mining Approaches for Intrusion Detection
Lee, W., & Stolfo, S. J. (2000) · doi:10.21236/ada401496 · Cited by 1,179
Detecting intrusions using system calls: alternative data models
Warrender, C., Forrest, S., & Pearlmutter, B. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766910 · Cited by 1,106
Evaluating intrusion detection systems: the 1998 DARPA off-line intrusion detection evaluation
Lippmann, R. P., Fried, D. J., Graf, I., Haines, J. W., Kendall, K. R., McClung, D., Weber, D., Webster, S. E., Wyschogrod, D., Cunningham, R. K., et al. (2002) · Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00 · doi:10.1109/discex.2000.821506 · Cited by 917
State transition analysis: a rule-based intrusion detection approach
Ilgun, K., Kemmerer, R. A., & Porras, P. A. (1995) · IEEE Transactions on Software Engineering · doi:10.1109/32.372146 · Cited by 747
Cryptographic limitations on learning Boolean formulae and finite automata
Kearns, M., & Valiant, L. (1994) · Journal of the ACM · doi:10.1145/174644.174647 · Cited by 733
EMERALD: Event Monitoring Enabling Responses to Anomalous Live Disturbances
Porras, P. A., Neumann, P. G., & Avenue, R. (2002) · Cited by 699
Learning Program Behavior Profiles for Intrusion Detection
Ghosh, A. K., Schwartzbard, A., & Schatz, M. X. (1999) · Cited by 394
Next-generation Intrusion Detection Expert System (NIDES)A Summary
Anderson, D., Frivold, T., & Valdes, A. (1997) · Cited by 354
Crytographic limitations on learning Boolean formulae and finite automata
Kearns, M., & Valiant, L. G. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73049 · Cited by 266
Detecting anomalous and unknown intrusions against programs
Ghosh, A. K., Wanken, J., & Charron, F. (2002) · Proceedings 14th Annual Computer Security Applications Conference (Cat. No.98EX217) · doi:10.1109/csac.1998.738646 · Cited by 237
Intrusion detection via system call traces
Kosoresow, A. P., & Hofmeyer, S. A. (1997) · IEEE Software · doi:10.1109/52.605929 · Cited by 199
Penetration state transition analysis: A rule-based intrusion detection approach
Porras, P. A., & Kemmerer, R. A. (2003) · doi:10.1109/csac.1992.228217 · Cited by 132
Intrusion detection. Applying machine learning to Solaris audit data
Endler, D. (2002) · Annual Computer Security Applications Conference · doi:10.1109/csac.1998.738647 · Cited by 109
SLIC: an extensibility system for commodity operating systems
Ghormley, D. P., Petrou, D., Rodrigues, S. H., & Anderson, T. E. (1998) · Cited by 109
Jain, K., & Sekar, R. (2000) · Cited by 107
Self-citationUsing kernel hypervisors to secure applications
Mitchem, T., Lu, R., & O'Brien, R. (2002) · Annual Computer Security Applications Conference · doi:10.1109/csac.1997.646188 · Cited by 55
Using Finite Automata to Mine Execution Data for Intrusion Detection: A Preliminary Report
Michael, C. C., & Ghosh, A. K. (2000) · Lecture notes in computer science · doi:10.1007/3-540-39945-3_5 · Cited by 46
Cited by
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
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
Control-flow integrity principles, implementations, and applications
Abadi, M., Budiu, M., Erlingsson, Ú., & Ligatti, J. (2009) · ACM Transactions on Information and System Security · doi:10.1145/1609956.1609960 · Cited by 795
HOLMES: Real-Time APT Detection through Correlation of Suspicious Information Flows
Milajerdi, S. M., Gjomemo, R., Eshete, B., Sekar, R., & Venkatakrishnan, V. N. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00026 · Cited by 573
Self-citationAn Analysis of the 1999 DARPA/Lincoln Laboratory Evaluation Data for Network Anomaly Detection
Mahoney, M. V., & Chan, P. K. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45248-5_13 · Cited by 535
Metadata
- Authors
- Sekar, R., Bendre, M., Dhurjati, D., & Bollineni, P.
- Venue
- Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-13
- Pages
- 144-155
- OpenAlex
- W2106649514
- Cited by
- 554
- References
- 20
- FWCI
- 16.50
- 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.