Adaptive blacklist-based packet filter with a statistic-based approach in network intrusion detection

被引:25
作者
Meng, Yuxin [1 ]
Kwok, Lam-For [1 ]
机构
[1] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
关键词
Network intrusion detection; Packet filter; Blacklist generation; Adaptive system; Signature matching; CLASSIFICATION;
D O I
10.1016/j.jnca.2013.05.009
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Network intrusion detection systems (NIDS) are widely deployed in various network environments. Compared to an anomaly based NIDS, a signature-based NIDS is more popular in real-world applications, because of its relatively lower false alarm rate. However, the process of signature matching is a key limiting factor to impede the performance of a signature-based NIDS, in which the cost is at least linear to the size of an input string and the CPU occupancy rate can reach more than 80% in the worst case. In this paper, we develop an adaptive blacklist-based packet filter using a statistic-based approach aiming to improve the performance of a signature-based NIDS. The filter employs a blacklist technique to help filter out network packets based on IP confidence and the statistic-based approach allows the blacklist generation in an adaptive way, that is, the blacklist can be updated periodically. In the evaluation, we give a detailed analysis of how to select weight values in the statistic-based approach, and investigate the performance of the packet filter with a DARPA dataset, a real dataset and in a real network environment. Our evaluation results under various scenarios show that our proposed packet filter is encouraging and effective to reduce the burden of a signature-based NIDS without affecting network security. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:83 / 92
页数:10
相关论文
共 43 条
[11]  
Axelsson S., 2000, ACM Transactions on Information and Systems Security, V3, P186, DOI 10.1145/357830.357849
[12]   A prefix-based approach for managing hybrid specifications in complex packet filtering [J].
Ben Neji, Nizar ;
Bouhoula, Adel .
COMPUTER NETWORKS, 2012, 56 (13) :3055-3064
[13]   FAST STRING SEARCHING ALGORITHM [J].
BOYER, RS ;
MOORE, JS .
COMMUNICATIONS OF THE ACM, 1977, 20 (10) :762-772
[14]   On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns [J].
Cantone, Domenico ;
Faro, Simone ;
Giaquinta, Emanuele .
JOURNAL OF DISCRETE ALGORITHMS, 2012, 11 (01) :25-36
[15]   A fast pattern matching algorithm with multi-byte search unit for high-speed network security [J].
Choi, Yoon-Ho ;
Jung, Moon-Young ;
Seo, Seung-Woo .
COMPUTER COMMUNICATIONS, 2011, 34 (14) :1750-1763
[16]  
Dietrich CJ, 2008, P 5 C EM ANT CEAS, P1
[17]  
Dreger H., 2004, Proceedings of the 11th ACM conference on Computer and communications security, P2
[18]  
Durian B, 2010, LECT NOTES COMPUT SC, V6049, P129, DOI 10.1007/978-3-642-13193-6_12
[19]   Wire-Speed TCAM-Based Architectures for Multimatch Packet Classification [J].
Faezipour, Miad ;
Nourani, Mehrdad .
IEEE TRANSACTIONS ON COMPUTERS, 2009, 58 (01) :5-17
[20]  
Fisk M., 2002, CS20010670 U CAL