半自动判定分配潜在的恶意程序

Ciprian Oprișa, George Cabau, G. Sebestyen
{"title":"半自动判定分配潜在的恶意程序","authors":"Ciprian Oprișa, George Cabau, G. Sebestyen","doi":"10.1109/ICCP.2015.7312616","DOIUrl":null,"url":null,"abstract":"Deciding if a given program is malicious or not is a recurring problem in anti-malware research, giving the fact that it is generally undecidable. Although field experts are able to perform correct classifications, the amount of both clean and malicious samples that appear every day is too high for relying only on manual analysis. In practice, the files collections are clustered and intensive analysis is performed only on a couple of representatives for each cluster. Some insights about each file can also be provided by automated analysis tools but they are less reliable than human experts. Based on the assumption that similar programs are likely to share the same verdict, we propose an algorithm for verdicts inference that is able to auto-correct wrong verdicts or request further manual analysis if auto-correction is not possible. The algorithm considers all the available sources of information together with their reliability and assigns verdicts to all the samples in the cluster. The system was tested on a collection of more than 200000 clusters built using the single linkage approach on a collection of over 20 million samples.","PeriodicalId":158453,"journal":{"name":"2015 IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Semi-automated verdicts assignment for potentially malicious programs\",\"authors\":\"Ciprian Oprișa, George Cabau, G. Sebestyen\",\"doi\":\"10.1109/ICCP.2015.7312616\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Deciding if a given program is malicious or not is a recurring problem in anti-malware research, giving the fact that it is generally undecidable. Although field experts are able to perform correct classifications, the amount of both clean and malicious samples that appear every day is too high for relying only on manual analysis. In practice, the files collections are clustered and intensive analysis is performed only on a couple of representatives for each cluster. Some insights about each file can also be provided by automated analysis tools but they are less reliable than human experts. Based on the assumption that similar programs are likely to share the same verdict, we propose an algorithm for verdicts inference that is able to auto-correct wrong verdicts or request further manual analysis if auto-correction is not possible. The algorithm considers all the available sources of information together with their reliability and assigns verdicts to all the samples in the cluster. The system was tested on a collection of more than 200000 clusters built using the single linkage approach on a collection of over 20 million samples.\",\"PeriodicalId\":158453,\"journal\":{\"name\":\"2015 IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCP.2015.7312616\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCP.2015.7312616","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在反恶意软件研究中,确定一个给定的程序是否是恶意程序是一个反复出现的问题,因为它通常是无法确定的。虽然现场专家能够执行正确的分类,但每天出现的干净和恶意样本的数量太高,无法仅依靠人工分析。在实践中,文件集合是集群的,并且只对每个集群的几个代表执行深入分析。自动化分析工具也可以提供关于每个文件的一些见解,但它们不如人类专家可靠。基于类似程序可能共享相同判决的假设,我们提出了一种判决推理算法,该算法能够自动纠正错误的判决,或者在无法自动纠正时要求进一步的人工分析。该算法考虑所有可用的信息来源及其可靠性,并对聚类中的所有样本进行判定。该系统在超过2000万个样本的集合上使用单链接方法构建的超过20万个集群上进行了测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Semi-automated verdicts assignment for potentially malicious programs
Deciding if a given program is malicious or not is a recurring problem in anti-malware research, giving the fact that it is generally undecidable. Although field experts are able to perform correct classifications, the amount of both clean and malicious samples that appear every day is too high for relying only on manual analysis. In practice, the files collections are clustered and intensive analysis is performed only on a couple of representatives for each cluster. Some insights about each file can also be provided by automated analysis tools but they are less reliable than human experts. Based on the assumption that similar programs are likely to share the same verdict, we propose an algorithm for verdicts inference that is able to auto-correct wrong verdicts or request further manual analysis if auto-correction is not possible. The algorithm considers all the available sources of information together with their reliability and assigns verdicts to all the samples in the cluster. The system was tested on a collection of more than 200000 clusters built using the single linkage approach on a collection of over 20 million samples.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信