Statistical foundations of audit trail analysis for the detection of computer misuse
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We model computer transactions as generated by two stationary stochastic processes, the legitimate (normal) process N and the misuse process M. We define misuse (anomaly) detection to be the identification of transactions most likely to have been generated by M. We formally demonstrate that the accuracy of misuse detectors is bounded by a function of the difference of the densities of the processes N and M over the space of transactions. In practice, detection accuracy can be far below this bound, and generally improves with increasing sample size of historical (training) data. Careful selection of transaction attributes also can improve detection accuracy; we suggest several criteria for attribute selection, including adequate sampling rate and separation between models. We demonstrate that exactly optimizing even the simplest of these criteria is NP-hard, thus motivating a heuristic approach. We further differentiate between modeling (density estimation) and nonmodeling approaches.>
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
Discrete Multivariate Analysis.
Gokhale, D. V., Bishop, Y. M. M., Fienberg, S. E., & Holland, P. W. (1976) · Biometrics · doi:10.2307/2529528 · Cited by 1,287
Cited by
Towards a taxonomy of intrusion-detection systems
Debar, H., Dacier, M., & Wespi, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(98)00017-6 · Cited by 829
The base-rate fallacy and the difficulty of intrusion detection
Axelsson, S. (2000) · ACM Transactions on Information and System Security · doi:10.1145/357830.357849 · Cited by 638
Application of SVM and ANN for intrusion detection
Chen, W.-H., Hsu, S.-H., & Shen, H.-P. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2004.03.019 · Cited by 412
A revised taxonomy for intrusion-detection systems
Debar, H., Dacier, M., & Wespi, A. (2000) · Annales Des Télécommunications · doi:10.1007/bf02994844 · Cited by 359
The base-rate fallacy and its implications for the difficulty of intrusion detection
Axelsson, S. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319710 · Cited by 325
Metadata
- Authors
- Helman, P., & Liepins, G.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 1993
- Volume
- 19
- Issue
- 9
- Pages
- 886-901
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2157021454
- Cited by
- 121
- References
- 1
- FWCI
- 0.53
- 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.