基于LCS和LCSS的新型恶意软件检测方法

Fahad Mira, Antony Brown, Wei Huang
{"title":"基于LCS和LCSS的新型恶意软件检测方法","authors":"Fahad Mira, Antony Brown, Wei Huang","doi":"10.1109/IConAC.2016.7604978","DOIUrl":null,"url":null,"abstract":"The field of computer security faces numerous vulnerabilities which cause network resources to become unavailable and violate systems confidentiality and integrity. Malicious software (Malware) has become one of the most serious security threats on the Internet. Malware is a widespread problem and despite the common use of anti-virus software, the diversity of malware is still increasing. A major challenge facing the anti-virus industry is how to effectively detect thousands of malware samples that are received every day. In this paper, a novel approach based on dynamic analysis of malware is proposed whereby Longest Common Subsequence (LCSS) and Longest Common Substring (LCS) algorithms are adopted to accurately detect malware. The empirical results show that the proposed approach performs favorably compared to other related work that use API call sequences.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Novel malware detection methods by using LCS and LCSS\",\"authors\":\"Fahad Mira, Antony Brown, Wei Huang\",\"doi\":\"10.1109/IConAC.2016.7604978\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The field of computer security faces numerous vulnerabilities which cause network resources to become unavailable and violate systems confidentiality and integrity. Malicious software (Malware) has become one of the most serious security threats on the Internet. Malware is a widespread problem and despite the common use of anti-virus software, the diversity of malware is still increasing. A major challenge facing the anti-virus industry is how to effectively detect thousands of malware samples that are received every day. In this paper, a novel approach based on dynamic analysis of malware is proposed whereby Longest Common Subsequence (LCSS) and Longest Common Substring (LCS) algorithms are adopted to accurately detect malware. The empirical results show that the proposed approach performs favorably compared to other related work that use API call sequences.\",\"PeriodicalId\":375052,\"journal\":{\"name\":\"2016 22nd International Conference on Automation and Computing (ICAC)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 22nd International Conference on Automation and Computing (ICAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IConAC.2016.7604978\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 22nd International Conference on Automation and Computing (ICAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IConAC.2016.7604978","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

计算机安全领域面临着许多漏洞,这些漏洞导致网络资源不可用,违反了系统的机密性和完整性。恶意软件(Malware)已经成为互联网上最严重的安全威胁之一。恶意软件是一个普遍存在的问题,尽管反病毒软件的普遍使用,恶意软件的多样性仍在增加。反病毒行业面临的一个主要挑战是如何有效地检测每天收到的数千个恶意软件样本。本文提出了一种基于恶意软件动态分析的新方法,即采用最长公共子序列(LCSS)和最长公共子串(LCS)算法来准确检测恶意软件。实证结果表明,与其他使用API调用序列的相关工作相比,所提出的方法具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Novel malware detection methods by using LCS and LCSS
The field of computer security faces numerous vulnerabilities which cause network resources to become unavailable and violate systems confidentiality and integrity. Malicious software (Malware) has become one of the most serious security threats on the Internet. Malware is a widespread problem and despite the common use of anti-virus software, the diversity of malware is still increasing. A major challenge facing the anti-virus industry is how to effectively detect thousands of malware samples that are received every day. In this paper, a novel approach based on dynamic analysis of malware is proposed whereby Longest Common Subsequence (LCSS) and Longest Common Substring (LCS) algorithms are adopted to accurately detect malware. The empirical results show that the proposed approach performs favorably compared to other related work that use API call sequences.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信