The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Network intrusion detection
Abstract
Intrusion detection is a new, retrofit approach for providing a sense of security in existing computers and data networks, while allowing them to operate in their current "open" mode. The goal of intrusion detection is to identify unauthorized use, misuse, and abuse of computer systems by both system insiders and external penetrators. The intrusion detection problem is becoming a challenging task due to the proliferation of heterogeneous computer networks since the increased connectivity of computer systems gives greater access to outsiders and makes it easier for intruders to avoid identification. Intrusion detection systems (IDSs) are based on the beliefs that an intruder's behavior will be noticeably different from that of a legitimate user and that many unauthorized actions are detectable. Typically, IDSs employ statistical anomaly and rulebased misuse models in order to detect intrusions. A number of prototype IDSs have been developed at several institutions, and some of them have also been deployed on an experimental basis in operational systems. In the present paper, several host-based and network-based IDSs are surveyed, and the characteristics of the corresponding systems are identified. The host-based systems employ the host operating system's audit trails as the main source of input to detect intrusive activity, while most of the network-based IDSs build their detection mechanism on monitored network traffic, and some employ host audit trails as well. An outline of a statistical anomaly detection algorithm employed in a typical IDS is also included.>
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
Denning, D. E. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.232894 · Cited by 3,427
Davidson, G. W., & Crase, D. (1989) · Death Studies · doi:10.1080/07481188908252281 · Cited by 2,848
Security problems in the TCP/IP protocol suite
Bellovin, S. M. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/378444.378449 · Cited by 550
DIDS (distributed intrusion detection system)—motivation, architecture, and an early prototype
Snapp, S. R., Brentano, J., Dias, G., Goan, T., Heberlein, L. T., Ho, C.-L., Levitt, K., Mukherjee, B., Smaha, S. E., Grance, T., et al. (1997) · Cited by 393
Self-citationHeberlein, 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
Self-citationHaystack: an intrusion detection system
Smaha, S. E. (2003) · [Proceedings 1988] Fourth Aerospace Computer Security Applications · doi:10.1109/acsac.1988.113412 · Cited by 297
The SRI IDES statistical anomaly detector
Javitz, H. S., & Valdes, A. (2002) · Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1991.130799 · Cited by 250
Adaptive real-time anomaly detection using inductively generated sequential patterns
Teng, H. S., Chen, K., & Lu, S. C. (1990) · Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1990.63857 · Cited by 207
Bellovin, S. M. (1992) · doi:10.7916/d8v12bj6 · Cited by 62
A system for distributed intrusion detection
Snapp, S. R., Brentano, J., Dias, G. V., Goan, T., Grance, T., Heberlein, L. T., Ho, C.-L., Levitt, K., Mukherjee, B., Mansur, D., et al. (2002) · IEEE Computer Society International Conference (COMPCON Spring) · doi:10.1109/cmpcon.1991.128802 · Cited by 54
Self-citationAnalysis of an algorithm for distributed recognition and accountability
Ko, C., Frincke, D. A., Goan, T., Heberlein, T., Levitt, K., Mukherjee, B., & Wee, C. E. (1993) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/168588.168608 · Cited by 32
Self-citationTowards Detecting Intrusions in a Networked Environment
Heberlein, L. T., Mukherjee, B., Levitt, K., Dias, G., & Mansur, D. (2017) · Cited by 10
Self-citation
Cited by
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
Deep Learning Approach for Intelligent Intrusion Detection System
Vinayakumar, R., Alazab, M., Soman, K. P., Poornachandran, P., Al-Nemrat, A., & Venkatraman, S. (2019) · IEEE Access · doi:10.1109/access.2019.2895334 · Cited by 1,946
Intrusion detection system: A comprehensive review
Liao, H.-J., Richard Lin, C.-H., Lin, Y.-C., & Tung, K.-Y. (2013) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2012.09.004 · Cited by 1,630
A data mining framework for building intrusion detection models
Lee, W., Stolfo, S. J., & Mok, K. W. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766909 · Cited by 1,148
A framework for constructing features and models for intrusion detection systems
Lee, W., & Stolfo, S. J. (2000) · ACM Transactions on Information and System Security · doi:10.1145/382912.382914 · Cited by 974
Metadata
- Authors
- Mukherjee, B., Heberlein, L. T., & Levitt, K. N.
- Venue
- IEEE Network
- Published
- 1994-05
- Volume
- 8
- Issue
- 3
- Pages
- 26-41
- ISSN
- 0890-8044 (ISSN-L)
- OpenAlex
- W3105682467
- Cited by
- 1,043
- References
- 12
- FWCI
- 13.33
- 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.