Empirical Evidence for Non-equilibrium Behaviors within Peer-to-Peer Structured Botnets

D. Arora, Teghan Godkin, Adam Verigin, S. Neville
{"title":"Empirical Evidence for Non-equilibrium Behaviors within Peer-to-Peer Structured Botnets","authors":"D. Arora, Teghan Godkin, Adam Verigin, S. Neville","doi":"10.1109/BWCCA.2013.50","DOIUrl":null,"url":null,"abstract":"Although we have become adept at taking-down individual botnets, the global botnet threat has remained largely unabated, particularly if one considers the more recent generation of peer-to-peer (P2P) structured botnets. A potential formal explanation for this dichotomy is that P2P botnets simply fail to behave as statistically equilibrium systems, (i.e., as systems possessing singular statistical steady-states). Equilibrium assumptions have been commonly applied in the construction of botnet defenses, but these assumption have gone untested. This work shows empirically via standard Monte Carlo packet-level simulations that well studied Kademlia P2P botnet protocol can easily produce both statistically non-stationary and non-ergodic behaviors once the Internet routing processes are modeled. Moreover, it is shown that by re-tuning a botnet's run-time parameters a botmaster can make the botnet behave as a non-stationary process from the defender's perspective. More formally, this work provides empirical evidence that network level botnet detection features need not be measure invariant as has generally been presupposed.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"493 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BWCCA.2013.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Although we have become adept at taking-down individual botnets, the global botnet threat has remained largely unabated, particularly if one considers the more recent generation of peer-to-peer (P2P) structured botnets. A potential formal explanation for this dichotomy is that P2P botnets simply fail to behave as statistically equilibrium systems, (i.e., as systems possessing singular statistical steady-states). Equilibrium assumptions have been commonly applied in the construction of botnet defenses, but these assumption have gone untested. This work shows empirically via standard Monte Carlo packet-level simulations that well studied Kademlia P2P botnet protocol can easily produce both statistically non-stationary and non-ergodic behaviors once the Internet routing processes are modeled. Moreover, it is shown that by re-tuning a botnet's run-time parameters a botmaster can make the botnet behave as a non-stationary process from the defender's perspective. More formally, this work provides empirical evidence that network level botnet detection features need not be measure invariant as has generally been presupposed.
点对点结构化僵尸网络中非均衡行为的经验证据
尽管我们已经能够熟练地摧毁单个僵尸网络,但全球僵尸网络的威胁在很大程度上仍然有增无减,特别是如果考虑到最近一代的点对点(P2P)结构化僵尸网络。对这种二分法的一种可能的正式解释是,P2P僵尸网络根本无法表现为统计平衡系统(即,作为具有单一统计稳态的系统)。均衡假设通常应用于构建僵尸网络防御,但这些假设尚未经过测试。这项工作通过标准蒙特卡罗包级模拟表明,一旦对互联网路由过程进行建模,经过充分研究的Kademlia P2P僵尸网络协议可以很容易地产生统计上的非平稳和非遍历行为。此外,从防御者的角度来看,通过重新调整僵尸网络的运行时参数,僵尸管理员可以使僵尸网络表现为非平稳过程。更正式地说,这项工作提供了经验证据,证明网络级僵尸网络检测特征不需要像通常假设的那样是测量不变的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信