An Application of Pattern Matching in Intrusion Detection (1994)
by
Sandeep Kumar
,
Eugene H. Spafford
| Citations: | 58 - 4 self |
BibTeX
@MISC{Kumar94anapplication,
author = {Sandeep Kumar and Eugene H. Spafford},
title = { An Application of Pattern Matching in Intrusion Detection},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This report examines and classifies the characteristics of signatures used in misuse intrusion detection. Efficient algorithms to match patterns in some of these classes are described. A generalized model for matching intrusion signatures based on Colored Petri Nets is presented, and some of its properties are derived.
Citations
| 487 | A fast string searching algorithm - Boyer, Moore - 1977 |
| 353 | J.J.: Secure computer systems: mathematical foundations, Mitre technical report 2547 - Bell, Padula - 1973 |
| 203 | Bayesian networks without tears - Charniak - 1991 |
| 17 | NIDX - an expert system for real-time network intrusion detection - Bauer, Koblentz - 1988 |
| 13 | E cient string matching: an aid to bibliographic search - Aho, Corasick - 1975 |
| 10 | Integrity Constraints for Secure Computer Systems. Techni� cal Report ESD�TR�76�372 - Biba - 1977 |
| 10 | Autoclass: A bayesian classi cation system - Chessman, Kelly, et al. - 1988 |
| 6 | A New Approach toText Searching - Baeza-Yates, Gonnet - 1992 |
| 4 | An Inductive Engine for the Acquisition of Temporal Knowl� edge - Chen - 1988 |
| 4 | Bayesian classi cation with correlation and inheritance - Hanson, Stutz, et al. |
