Buttercup:基于网络的多态缓冲区溢出漏洞检测

Archana Pasupulati, Jason Coit, K. Levitt, S. F. Wu, S. Li, J. Kuo, K. Fan
{"title":"Buttercup:基于网络的多态缓冲区溢出漏洞检测","authors":"Archana Pasupulati, Jason Coit, K. Levitt, S. F. Wu, S. Li, J. Kuo, K. Fan","doi":"10.1109/NOMS.2004.1317662","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"69","resultStr":"{\"title\":\"Buttercup: on network-based detection of polymorphic buffer overflow vulnerabilities\",\"authors\":\"Archana Pasupulati, Jason Coit, K. Levitt, S. F. Wu, S. Li, J. Kuo, K. Fan\",\"doi\":\"10.1109/NOMS.2004.1317662\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":260367,\"journal\":{\"name\":\"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"69\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NOMS.2004.1317662\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOMS.2004.1317662","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 69

摘要

攻击多态性是攻击者规避基于签名的入侵检测/防御系统的有力工具。此外,即使是高中生也可以随时对我们的关键基础设施(如DNS或更新服务器)进行编码和发射新的更快的互联网蠕虫。我们相信,未来将会开发出多态互联网蠕虫,这样我们当前的许多解决方案可能会有很小的生存机会。在本文中,我们提出了一个简单的解决方案,称为“Buttercup”,以对抗基于缓冲区溢出漏洞的攻击(如CodeRed, Nimda, Slammer和Blaster)。我们已经在SNORT中实现了我们的想法,并包含了19个缓冲区溢出漏洞的返回地址范围。通过一组针对55个TCPdump跟踪的测试,我们的最佳算法的误报率低至0.01%。这表明,Buttercup可能会在网络上丢弃100%的蠕虫攻击数据包,而只有0.01%的良好数据包会被牺牲。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Buttercup: on network-based detection of polymorphic buffer overflow vulnerabilities
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信