NetShield: Massive Semantics-Based Vulnerability Signature Matching for High-Speed Networks

被引:24
作者
Li, Zhichun [1 ]
Xia, Gao [2 ]
Gao, Hongyu [1 ]
Tang, Yi [2 ]
Chen, Yan [1 ]
Liu, Bin [2 ]
Jiang, Junchen [2 ]
Lv, Yuezhou [2 ]
机构
[1] Northwestern Univ, Evanston, IL 60208 USA
[2] Tsinghua Univ, Beijing, Peoples R China
关键词
Algorithms; Design; Performance; Security; vulnerability signature; intrusion detection; signature matching; deep packet inspection;
D O I
10.1145/1851275.1851216
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Accuracy and speed are the two most important metrics for Network Intrusion Detection/Prevention Systems (NIDS/NIPSes). Due to emerging polymorphic attacks and the fact that in many cases regular expressions (regexes) cannot capture the vulnerability conditions accurately, the accuracy of existing regex-based NIDS/NIPS systems has become a serious problem. In contrast, the recently-proposed vulnerability signatures [10, 29] (a.k.a. data patches) can exactly describe the vulnerability conditions and achieve better accuracy. However, how to efficiently apply vulnerability signatures to high speed NIDS/NIPS with a large ruleset remains an untouched but challenging issue. This paper presents the first systematic design of vulnerability signature based parsing and matching engine, NetShield, which achieves multi-gigabit throughput while offering much better accuracy. Particularly, we made the following contributions: (i) we proposed a candidate selection algorithm which efficiently matches thousands of vulnerability signatures simultaneously requiring a small amount of memory; (ii) we proposed an automatic lightweight parsing state machine achieving fast protocol parsing. Experimental results show that the core engine of NetShield achieves at least 1.9+Gbps signature matching throughput on a 3.8GHz single-core PC, and can scale-up to at least 11+Gbps under a 8-core machine for 794 HTTP vulnerability signatures. We release our prototype and sample signatures at www.nshield.org.
引用
收藏
页码:279 / 290
页数:12
相关论文
共 29 条
[1]  
[Anonymous], DAG card
[2]  
[Anonymous], CONFICKER
[3]  
[Anonymous], 1998 DARPA INTRUSION
[4]  
[Anonymous], PRX TRAFFIC MANAGER
[5]  
Baboescu Florin., 2001, P ACM SIGCOMM
[6]  
Becchi M., 2007, P ACM CONEXT
[7]  
Becchi M., 2008, P IEEE ACM ANCS
[8]  
Borisov N., 2007, P NDSS
[9]  
BRUMLEY D, 2006, P IEEE SEC PRIV S
[10]   LOWER BOUNDS FOR ORTHOGONAL RANGE SEARCHING .2. THE ARITHMETIC MODEL [J].
CHAZELLE, B .
JOURNAL OF THE ACM, 1990, 37 (03) :439-463