HMMPayl: An intrusion detection system based on Hidden Markov Models

被引:78
作者
Ariu, Davide [1 ]
Tronci, Roberto [1 ]
Giacinto, Giorgio [1 ]
机构
[1] Univ Cagliari Piazza Armi, Dept Elect & Elect Engn, I-09123 Cagliari, Italy
关键词
Network intrusion detection; Anomaly detection; Multiple classifiers; Hidden Markov Models; Payload analysis; PROBABILISTIC FUNCTIONS; FUSION;
D O I
10.1016/j.cose.2010.12.004
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nowadays the security of Web applications is one of the key topics in Computer Security. Among all the solutions that have been proposed so far, the analysis of the HTTP payload at the byte level has proven to be effective as it does not require the detailed knowledge of the applications running on the Web server. The solutions proposed in the literature actually achieved good results for the detection rate, while there is still room for reducing the false positive rate. To this end, in this paper we propose HMMPayl, an IDS where the payload is represented as a sequence of bytes, and the analysis is performed using Hidden Markov Models (HMM). The algorithm we propose for feature extraction and the joint use of HMM guarantee the same expressive power of n - gram analysis, while allowing to overcome its computational complexity. In addition, we designed HMMPayl following the Multiple Classifiers System paradigm to provide for a better classification accuracy, to increase the difficulty of evading the IDS, and to mitigate the weaknesses due to a non optimal choice of HMM parameters. Experimental results, obtained both on public and private datasets, show that the analysis performed by HMMPayl is particularly effective against the most frequent attacks toward Web applications (such as XSS and SQL-Injection). In particular, for a fixed false positive rate, HMMPayl achieves a higher detection rate respect to previously proposed approaches it has been compared with. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:221 / 241
页数:21
相关论文
共 49 条
[1]  
[Anonymous], 2004, COMBINING PATTERN CL, DOI DOI 10.1002/0471660264
[2]  
[Anonymous], 6 C EM ANT CEAS MOUN
[3]   GROWTH TRANSFORMATIONS FOR FUNCTIONS ON MANIFOLDS [J].
BAUM, LE ;
SELL, GR .
PACIFIC JOURNAL OF MATHEMATICS, 1968, 27 (02) :211-&
[4]   AN INEQUALITY WITH APPLICATIONS TO STATISTICAL ESTIMATION FOR PROBABILISTIC FUNCTIONS OF MARKOV PROCESSES AND TO A MODEL FOR ECOLOGY [J].
BAUM, LE ;
EAGON, JA .
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1967, 73 (03) :360-&
[5]   A MAXIMIZATION TECHNIQUE OCCURRING IN STATISTICAL ANALYSIS OF PROBABILISTIC FUNCTIONS OF MARKOV CHAINS [J].
BAUM, LE ;
PETRIE, T ;
SOULES, G ;
WEISS, N .
ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (01) :164-&
[6]  
Biggio B, 2009, LECT NOTES COMPUT SC, V5519, P132, DOI 10.1007/978-3-642-02326-2_14
[7]  
Biggio B, 2008, LECT NOTES COMPUT SC, V5342, P500, DOI 10.1007/978-3-540-89689-0_54
[8]   The use of the area under the roc curve in the evaluation of machine learning algorithms [J].
Bradley, AP .
PATTERN RECOGNITION, 1997, 30 (07) :1145-1159
[9]  
*BREACH SEC INC, 2009, WEBDEFEND
[10]  
*BREACH SEC INC, 2009, MODSECURITY OP SOURC