Malware similarity analysis based on graph similarity flooding algorithm

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Malware is a pervasive problem in computer security. The traditional signature-based detecting method is ineffective to recognize the dramatically increased malware. Researches show that many of the malicious samples are just variations of previously encountered malware. Therefore, it would be preferable to analysis the similarity of malware to determine whether submitted samples are merely variations of existing ones. Static analysis of polymorphic malware variants plays an important role. Function call graph has shown to be an effective feature that represents functionality of malware semantically. In this paper we propose a novel algorithm by comparing the function call graph based on similarity flooding algorithm to analyze the similarity of malware. Similarity between malware can be determined by graph matching method. The evaluation shows that our algorithm is highly effective in terms of accuracy and computational complexity.

Cite

CITATION STYLE

APA

Liu, J., Wang, Y., Xie, P., Wang, Y., & Huang, Z. (2015). Malware similarity analysis based on graph similarity flooding algorithm. Lecture Notes in Electrical Engineering, 373, 31–37. https://doi.org/10.1007/978-981-10-0281-6_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free