Polygraph: Automatically generating signatures for polymorphic worms

被引:189
作者
Newsome, J [1 ]
Karp, B [1 ]
Song, D [1 ]
机构
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
来源
2005 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS | 2005年
关键词
D O I
10.1109/SP.2005.15
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It is widely believed that content-signature-based intrusion detection systems (IDSes) are easily evaded by polymorphic worms, which vary their payload on every infection attempt. In this paper, we present Polygraph, a signature generation system that successfully produces signatures that match polymorphic worms. Polygraph generates signatures that consist of multiple disjoint content substrings. In doing so, Polygraph leverages our insight that for a real-world exploit to function properly, multiple invariant substrings must often be present in all variants Of a payload; these substrings typically correspond to protocol framing, return addresses, and in some cases, poorly obfuscated code. We contribute a definition of the polymorphic signature generation problem; propose classes of signature suited for matching polymorphic worm payloads; and present algorithms for automatic generation of signatures in these classes. Our evaluation of these algorithms on a range of polymorphic worms demonstrates that Polygraph produces signatures for polymorphic worms that exhibit low false negatives and false positives.
引用
收藏
页码:226 / 241
页数:16
相关论文
共 19 条
[1]  
[Anonymous], 1997, ALGORITHMS STRINGS T, DOI DOI 10.1017/CBO9780511574931
[2]  
Bailey T., 1994, P 2 INT C INT SYST M, P28
[3]  
Detristan T., POLYMORPHIC SHELLCOD
[4]  
HUI L, 1992, P 3 S COMB PATT MATC
[5]  
KIM HA, 2004, P 13 USENIX SEC S AU
[6]  
KREIBICH C, 2003, P 2 WORKSH HOT TOP N
[7]   DETECTING SUBTLE SEQUENCE SIGNALS - A GIBBS SAMPLING STRATEGY FOR MULTIPLE ALIGNMENT [J].
LAWRENCE, CE ;
ALTSCHUL, SF ;
BOGUSKI, MS ;
LIU, JS ;
NEUWALD, AF ;
WOOTTON, JC .
SCIENCE, 1993, 262 (5131) :208-214
[8]  
NACHANBERG C, 1997, COMMUNICATIONS ACM
[9]  
Newsome James, 2005, NDSS, V5, P3
[10]  
Pasupulati A, 2004, IEEE IFIP NETW OP MA