FProbe:通过群活动分析检测隐秘的基于dga的僵尸网络

Jiawei Sun, Yuan Zhou, Shupeng Wang, Lei Zhang, Junjiao Liu, Junteng Hou, Zhicheng Liu
{"title":"FProbe:通过群活动分析检测隐秘的基于dga的僵尸网络","authors":"Jiawei Sun, Yuan Zhou, Shupeng Wang, Lei Zhang, Junjiao Liu, Junteng Hou, Zhicheng Liu","doi":"10.1109/IPCCC50635.2020.9391539","DOIUrl":null,"url":null,"abstract":"Nowadays, we have witnessed the rise of botnet malicious activities. These botnets, as expected, are launched by Domain generation algorithm (DGA) to evade detection. There is a growing concern that the artificially designed DGA detection features are being vulnerable to attackers, where any well-designed manipulations would evade these existing feature-based detection and even the more robust behavior-based detection. One common point of existing evasion for behavior detection is using domain names with low query rate. In this paper, we propose FProbe, a novel technology using co-occurrence matrix and relaxed clustering procedure, which performs excellent performance in the scene of detecting low query rate and multi-domain evasion. We use a simple intuition, that is, DGA queries have a strong correlation between temporal and spatial features, but these temporal and spatial correlations are not very synchronous. The FProbe uses the co-occurrence matrix, which is widely used in the field of product recommendation and word frequency co-occurrence, and use these unsupervised methods to cluster infected hosts. In particular, through this matrix, we can quickly and effectively locate infected hosts in the scene of low query rate, instead of discarding the domain for its high threshold. Then, we use the relax association rules of Frequent Sequence Tree to cluster related domain names, and use supervised learning to determine malicious clusters. The FProbe has been evaluated in the campus network (4000 active users in peak load hours) and ISP DNS traffic (one billion queries per hour). The experimental results ( 96.3% accuracy rate of 1.9% false positive on average) illustrate the efficiency and accuracy of FProbe.","PeriodicalId":226034,"journal":{"name":"2020 IEEE 39th International Performance Computing and Communications Conference (IPCCC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"FProbe: Detecting Stealthy DGA-based Botnets by Group Activities Analysis\",\"authors\":\"Jiawei Sun, Yuan Zhou, Shupeng Wang, Lei Zhang, Junjiao Liu, Junteng Hou, Zhicheng Liu\",\"doi\":\"10.1109/IPCCC50635.2020.9391539\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, we have witnessed the rise of botnet malicious activities. These botnets, as expected, are launched by Domain generation algorithm (DGA) to evade detection. There is a growing concern that the artificially designed DGA detection features are being vulnerable to attackers, where any well-designed manipulations would evade these existing feature-based detection and even the more robust behavior-based detection. One common point of existing evasion for behavior detection is using domain names with low query rate. In this paper, we propose FProbe, a novel technology using co-occurrence matrix and relaxed clustering procedure, which performs excellent performance in the scene of detecting low query rate and multi-domain evasion. We use a simple intuition, that is, DGA queries have a strong correlation between temporal and spatial features, but these temporal and spatial correlations are not very synchronous. The FProbe uses the co-occurrence matrix, which is widely used in the field of product recommendation and word frequency co-occurrence, and use these unsupervised methods to cluster infected hosts. In particular, through this matrix, we can quickly and effectively locate infected hosts in the scene of low query rate, instead of discarding the domain for its high threshold. Then, we use the relax association rules of Frequent Sequence Tree to cluster related domain names, and use supervised learning to determine malicious clusters. The FProbe has been evaluated in the campus network (4000 active users in peak load hours) and ISP DNS traffic (one billion queries per hour). The experimental results ( 96.3% accuracy rate of 1.9% false positive on average) illustrate the efficiency and accuracy of FProbe.\",\"PeriodicalId\":226034,\"journal\":{\"name\":\"2020 IEEE 39th International Performance Computing and Communications Conference (IPCCC)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 39th International Performance Computing and Communications Conference (IPCCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPCCC50635.2020.9391539\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 39th International Performance Computing and Communications Conference (IPCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPCCC50635.2020.9391539","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

如今,我们目睹了僵尸网络恶意活动的兴起。正如预期的那样,这些僵尸网络是由域生成算法(DGA)发起的,以逃避检测。越来越多的人担心人为设计的DGA检测特征容易受到攻击者的攻击,任何精心设计的操作都会逃避这些现有的基于特征的检测,甚至是更强大的基于行为的检测。现有逃避行为检测的一个常见问题是使用查询率低的域名。本文提出了一种基于共现矩阵和放松聚类过程的新技术FProbe,该技术在检测低查询率和多域逃避的场景中表现优异。我们使用一个简单的直觉,即DGA查询在时间和空间特征之间具有很强的相关性,但是这些时间和空间相关性不是很同步。FProbe使用在产品推荐和词频共现领域广泛使用的共现矩阵,并使用这些无监督方法对感染主机进行聚类。特别是,通过该矩阵,我们可以快速有效地定位查询率低的场景中被感染的主机,而不是因为阈值高而丢弃该域。然后,我们使用频繁序列树的松弛关联规则对相关域名进行聚类,并使用监督学习来确定恶意聚类。FProbe已经在校园网(峰值负载时4000个活跃用户)和ISP DNS流量(每小时10亿次查询)中进行了评估。实验结果(平均准确率为96.3%,假阳性率为1.9%)说明了FProbe的效率和准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
FProbe: Detecting Stealthy DGA-based Botnets by Group Activities Analysis
Nowadays, we have witnessed the rise of botnet malicious activities. These botnets, as expected, are launched by Domain generation algorithm (DGA) to evade detection. There is a growing concern that the artificially designed DGA detection features are being vulnerable to attackers, where any well-designed manipulations would evade these existing feature-based detection and even the more robust behavior-based detection. One common point of existing evasion for behavior detection is using domain names with low query rate. In this paper, we propose FProbe, a novel technology using co-occurrence matrix and relaxed clustering procedure, which performs excellent performance in the scene of detecting low query rate and multi-domain evasion. We use a simple intuition, that is, DGA queries have a strong correlation between temporal and spatial features, but these temporal and spatial correlations are not very synchronous. The FProbe uses the co-occurrence matrix, which is widely used in the field of product recommendation and word frequency co-occurrence, and use these unsupervised methods to cluster infected hosts. In particular, through this matrix, we can quickly and effectively locate infected hosts in the scene of low query rate, instead of discarding the domain for its high threshold. Then, we use the relax association rules of Frequent Sequence Tree to cluster related domain names, and use supervised learning to determine malicious clusters. The FProbe has been evaluated in the campus network (4000 active users in peak load hours) and ISP DNS traffic (one billion queries per hour). The experimental results ( 96.3% accuracy rate of 1.9% false positive on average) illustrate the efficiency and accuracy of FProbe.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信