从剽窃到恶意软件检测

Ciprian Oprișa, George Cabau, Adrian Colesa
{"title":"从剽窃到恶意软件检测","authors":"Ciprian Oprișa, George Cabau, Adrian Colesa","doi":"10.1109/SYNASC.2013.37","DOIUrl":null,"url":null,"abstract":"We have often seen how malware families evolve over time: the malware authors add new features, change the order of functions, modify some strings or add random useless code. They do all that to evade detection. In a similar way, computer science students that copy homework will change variable and function names, rephrase comments or even replace some small portions of the code. In both cases, the essence remains the same and it is easy for one to see it, by comparing two samples or two source codes. The challenge however, is to automatically find groups of similar items in a large collection. Our research shows that we can apply the same techniques in order to cluster new malicious samples into malware families and detect plagiarized students work. The paper proposes a novel approach for computing the similarity between two items, based not only on their features, but also based on the frequencies of those features in a given population. The new similarity function was tested in a clustering algorithm and it proved better than other approaches. Also, the nature of the method allows it to be used in other document classification tasks.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"From Plagiarism to Malware Detection\",\"authors\":\"Ciprian Oprișa, George Cabau, Adrian Colesa\",\"doi\":\"10.1109/SYNASC.2013.37\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have often seen how malware families evolve over time: the malware authors add new features, change the order of functions, modify some strings or add random useless code. They do all that to evade detection. In a similar way, computer science students that copy homework will change variable and function names, rephrase comments or even replace some small portions of the code. In both cases, the essence remains the same and it is easy for one to see it, by comparing two samples or two source codes. The challenge however, is to automatically find groups of similar items in a large collection. Our research shows that we can apply the same techniques in order to cluster new malicious samples into malware families and detect plagiarized students work. The paper proposes a novel approach for computing the similarity between two items, based not only on their features, but also based on the frequencies of those features in a given population. The new similarity function was tested in a clustering algorithm and it proved better than other approaches. Also, the nature of the method allows it to be used in other document classification tasks.\",\"PeriodicalId\":293085,\"journal\":{\"name\":\"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2013.37\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2013.37","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

我们经常看到恶意软件家族是如何随着时间的推移而演变的:恶意软件作者添加新功能,改变函数的顺序,修改一些字符串或添加随机无用的代码。他们这么做是为了逃避侦查。类似地,抄作业的计算机科学专业的学生会更改变量和函数名,改写注释,甚至替换一小部分代码。在这两种情况下,本质是相同的,通过比较两个示例或两个源代码,很容易看出这一点。然而,挑战在于如何在一个大的集合中自动找到一组相似的项目。我们的研究表明,我们可以应用相同的技术来将新的恶意样本聚类到恶意软件家族中,并检测剽窃的学生作业。本文提出了一种新的方法来计算两个项目之间的相似性,不仅基于它们的特征,而且基于这些特征在给定群体中的频率。在聚类算法中测试了新的相似度函数,证明了它优于其他方法。此外,该方法的性质允许将其用于其他文档分类任务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
From Plagiarism to Malware Detection
We have often seen how malware families evolve over time: the malware authors add new features, change the order of functions, modify some strings or add random useless code. They do all that to evade detection. In a similar way, computer science students that copy homework will change variable and function names, rephrase comments or even replace some small portions of the code. In both cases, the essence remains the same and it is easy for one to see it, by comparing two samples or two source codes. The challenge however, is to automatically find groups of similar items in a large collection. Our research shows that we can apply the same techniques in order to cluster new malicious samples into malware families and detect plagiarized students work. The paper proposes a novel approach for computing the similarity between two items, based not only on their features, but also based on the frequencies of those features in a given population. The new similarity function was tested in a clustering algorithm and it proved better than other approaches. Also, the nature of the method allows it to be used in other document classification tasks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信