Buttercup: on network-based detection of polymorphic buffer overflow vulnerabilities
Pasupulati, A.; Coit, J.; Levitt, K.; Wu, S.F.; Li, S.H.; Kuo, J.C.; Fan, K.P.
Network Operations and Management Symposium, 2004. NOMS 2004. IEEE/IFIP
Volume 1, Issue , 23-23 April 2004 Page(s):235 - 248 Vol.1
Digital Object Identifier 10.1109/NOMS.2004.1317662
Summary:Attack polymorphism is a powerful tool for the attackers in the Internet to evade signature-based intrusion detection/prevention systems. In addition, new and faster Internet worms can be coded and launched easily by even high school students anytime against our critical infrastructures, such as DNS or update servers. We believe that polymorphic Internet worms will be developed in the future such that many of our current solutions might have a very small chance to survive. In this paper, we propose a simple solution called "Buttercup" to counter against attacks based on buffer-overflow exploits (such as CodeRed, Nimda, Slammer, and Blaster). We have implemented our idea in SNORT, and included 19 return address ranges of buffer-overflow exploits. With a suite of tests against 55 TCPdump traces, the false positive rate for our best algorithm is as low as 0.01%. This indicates that, potentially, Buttercup can drop 100% worm attack packets on the wire while only 0.01% of the good packets will be sacrificed.
View citation and abstract |
Cart
