The DOI matches its Crossref record; 68 of the 68 references it cites were found in a registry or an index.
A data mining framework for building intrusion detection models
Open accessAbstract
There is often the need to update an installed intrusion detection system (IDS) due to new attack methods or upgraded computing environments. Since many current IDSs are constructed by manual encoding of expert knowledge, changes to IDSs are expensive and slow. We describe a data mining framework for adaptively building Intrusion Detection (ID) models. The central idea is to utilize auditing programs to extract an extensive set of features that describe each network connection or host session, and apply data mining programs to learn rules that accurately capture the behavior of intrusions and normal activities. These rules can then be used for misuse detection and anomaly detection. New detection models are incorporated into an existing IDS through a meta-learning (or co-operative learning) process, which produces a meta detection model that combines evidence from multiple models. We discuss the strengths of our data mining programs, namely, classification, meta-learning, association rules, and frequent episodes. We report on the results of applying these programs to the extensively gathered network audit data for the 1998 DARPA Intrusion Detection Evaluation Program.
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 Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,320
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_9 · Cited by 4,387
Cohen, W. W. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50023-2 · Cited by 3,787
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
Brown, K. S. (1976) · Graduate texts in mathematics · doi:10.1007/978-1-4684-9327-6 · Cited by 3,166
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
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
Wiley Series in Probability and Mathematics Statistics
(1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250.scard · Cited by 2,220
Modular Elliptic Curves and Fermat's Last Theorem
Wiles, A. (1995) · The Annals of Mathematics · doi:10.2307/2118559 · Cited by 2,060
The KDD process for extracting useful knowledge from volumes of data
Fayyad, U., Piatetsky-Shapiro, G., & Smyth, P. (1996) · Communications of the ACM · doi:10.1145/240455.240464 · Cited by 1,934
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
Elliptic Curves in Cryptography
Blake, I. F., Seroussi, G., & Smart, N. P. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9781107360211 · Cited by 1,828
Approximate formulas for some functions of prime numbers
Rosser, J. B., & Schoenfeld, L. (1962) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255631807 · Cited by 1,546
Walker, R. J. (1950) · Cited by 1,240
Lower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Data Mining Approaches for Intrusion Detection
Lee, W., & Stolfo, S. J. (2000) · doi:10.21236/ada401496 · Cited by 1,179
Self-citationAuthentication and authenticated key exchanges
Diffie, W., Van Oorschot, P. C., & Wiener, M. J. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,154
Mukherjee, B., Heberlein, L. T., & Levitt, K. N. (1994) · IEEE Network · doi:10.1109/65.283931 · Cited by 1,043
Foundations of Cryptography: Basic Tools
Goldreich, O. (2000) · Cambridge University Press eBooks · Cited by 1,019
Factoring Integers with Elliptic Curves
Lenstra, H. W. (1987) · The Annals of Mathematics · doi:10.2307/1971363 · Cited by 974
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825
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
EMERALD: Event Monitoring Enabling Responses to Anomalous Live Disturbances
Porras, P. A., Neumann, P. G., & Avenue, R. (2002) · Cited by 699
The State of Elliptic Curve Cryptography
Koblitz, N., Menezes, A., & Vanstone, S. (2000) · Designs, Codes and Cryptography · doi:10.1023/a:1008354106356 · Cited by 685
Urn models and their application
Johnson, N. L. (1977) · Cited by 682
Chaum, D., & van Antwerpen, H. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_20 · Cited by 605
Die Typen der Multiplikatorenringe elliptischer Funktionenkörper
Deuring, M. (1941) · Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg · doi:10.1007/bf02940746 · Cited by 600
Discovering Frequent Episodes in Sequences.
Mannila, H., Toivonen, H. T. T., & Verkamo, A. I. (1995) · Knowledge Discovery and Data Mining · Cited by 590
A Survey of Fast Exponentiation Methods
Gordon, D. M. (1998) · Journal of Algorithms · doi:10.1006/jagm.1997.0913 · Cited by 534
Class number, a theory of factorization, and genera
Shanks, D. (1971) · Proceedings of Symposia in Pure Mathematics · doi:10.1090/pspum/020/0316385 · Cited by 518
Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications
Vernam, G. S. (1926) · Transactions of the American Institute of Electrical Engineers · doi:10.1109/t-aiee.1926.5061224 · Cited by 480
Koblitz, N. (1989) · Journal of Cryptology · doi:10.1007/bf02252872 · Cited by 455
Groupes algébriques et corps de classes
Serre, J.-P. (1997) · Groupes algébriques et corps de classes · doi:10.3917/herm.serre.1997.02.0163 · Cited by 430
Computing in the Jacobian of a hyperelliptic curve
Cantor, D. G. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866101-0 · Cited by 405
Discovering generalized episodes using minimal occurrences
Mannila, H., & Toivonen, H. T. T. (1996) · Cited by 306
Constructive and destructive facets of Weil descent on elliptic curves
Gaudry, P., Hess, F., & Smart, N. P. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0011-x · Cited by 300
JAM: java agents for meta-learning over distributed databases
Stolfo, S. J., Prodromidis, A. L., Tselepis, S., Lee, W., Fan, D. W., & Chan, P. K. (1997) · Cited by 285
Self-citationCoppersmith, D., Odlzyko, A. M., & Schroeppel, R. (1986) · Algorithmica · doi:10.1007/bf01840433 · Cited by 271
Multiuser cryptographic techniques
Diffie, W., & Hellman, M. E. (1976) · Proceedings of the June 7-10, 1976, national computer conference and exposition on - AFIPS '76 · doi:10.1145/1499799.1499815 · Cited by 270
Mining Audit Data to Build Intrusion Detection Models
Lee, W., Stolfo, S. J., & Mok, K. W. (1998) · doi:10.7916/d8fx7h6x · Cited by 251
Self-citationThe Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
Frey, G., Muller, M., & Ruck, H.-G. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771254 · Cited by 242
Mining in a data-flow environment: experience in network intrusion detection
Lee, W., Stolfo, S. J., & Mok, K. W. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312212 · Cited by 223
Self-citationCryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
Chaum, D., van Heijst, E., & Pfitzmann, B. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_38 · Cited by 201
An improved Monte Carlo factorization algorithm
Brent, R. P. (1980) · BIT · doi:10.1007/bf01933190 · Cited by 189
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
Gaudry, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_2 · Cited by 178
A key distribution system equivalent to factoring
McCurley, K. S. (1988) · Journal of Cryptology · doi:10.1007/bf02351718 · Cited by 176
Sequence Matching and Learning in Anomaly Detection for Computer Security
Lane, T. D. R., & Brodley, C. E. (1997) · Cited by 157
Toward parallel and distributed learning by meta-learning
Chan, P. K., & Stolfo, S. J. (1993) · Cited by 151
Self-citationKangaroos, Monopoly and Discrete Logarithms
Pollard, J. M. (2000) · Journal of Cryptology · doi:10.1007/s001450010010 · Cited by 146
Discrete Logarithms: The Past and the Future
Odlyzko, A. M. (2000) · Designs Codes and Cryptography · doi:10.1023/a:1008350005447 · Cited by 145
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
Maurer, U. M., & Wolf, S. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539796302749 · Cited by 136
Generalized Jacobian Varieties
Rosenlicht, M. (1954) · Annals of Mathematics · doi:10.2307/1969715 · Cited by 116
Smith, P. J., & Lennon, M. (1993) · Cited by 110
Constructing Elliptic Curve Cryptosystems in Characteristic 2
Koblitz, N. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_11 · Cited by 61
Fast Computation of Discrete Logarithms in GF (q)
Hellman, M. E., & Reyneri, J. M. (1983) · Springer eBooks · doi:10.1007/978-1-4757-0602-4_1 · Cited by 37
Cited by
A Survey of Data Mining and Machine Learning Methods for Cyber Security Intrusion Detection
Buczak, A. L., & Guven, E. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2494502 · Cited by 3,332
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
A survey of network anomaly detection techniques
Ahmed, M., Naser Mahmood, A., & Hu, J. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2015.11.016 · Cited by 1,750
An overview of anomaly detection techniques: Existing solutions and latest technological trends
Patcha, A., & Park, J.-M. (2007) · Computer Networks · doi:10.1016/j.comnet.2007.02.001 · Cited by 1,561
Intrusion detection in wireless ad-hoc networks
Zhang, Y., & Lee, W. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345958 · Cited by 1,100
Self-citation
Metadata
- Authors
- Lee, W., Stolfo, S. J., & Mok, K. W.
- Venue
- Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344)
- Publisher
- IEEE Comput. Soc
- Published
- 2003-01-20
- Pages
- 120-132
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W1884606608
- Cited by
- 1,148
- References
- 68
- FWCI
- 44.35
- 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.