Sequence Covering for Efficient Host-Based Intrusion Detection
- 4 September 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 14 (4) , 994-1006
Abstract
This paper introduces a new similarity measure, the covering similarity, which we formally define for evaluating the similarity between a symbolic sequence and a set of symbolic sequences. A pairwise similarity can also be directly derived from the covering similarity to compare two symbolic sequences. An efficient implementation to compute the covering similarity is proposed which uses a suffix-tree data structure, but other implementations, based on suffix array for instance, are possible and are possibly necessary for handling very large-scale problems. We have used this similarity to isolate attack sequences from normal sequences in the scope of host-based intrusion detection. We have assessed the covering similarity on two well-known benchmarks in the field. In view of the results reported on these two datasets for the state-of-the-art methods, according to the comparative study, we have carried out based on three challenging similarity measures commonly used for string processing, or in bioinformatics, we show that the covering similarity is particularly relevant to address the detection of anomalies in sequences of system calls.Keywords
All Related Versions
This publication has 34 references indexed in Scilit:
- Intrusion detection system: A comprehensive reviewJournal of Network and Computer Applications, 2013
- Database intrusion detection using sequence alignmentInternational Journal of Information Security, 2010
- Anomaly detectionACM Computing Surveys, 2009
- Replacing suffix trees with enhanced suffix arraysJournal of Discrete Algorithms, 2004
- Anomaly intrusion detection method based on HMMElectronics Letters, 2002
- On-line construction of suffix treesAlgorithmica, 1995
- Identification of common molecular subsequencesJournal of Molecular Biology, 1981
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- The String-to-String Correction ProblemJournal of the ACM, 1974
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970