TY - JOUR
T1 - Mal-Netminer
T2 - Malware Classification Approach Based on Social Network Analysis of System Call Graph
AU - Jang, Jae Wook
AU - Woo, Jiyoung
AU - Mohaisen, Aziz
AU - Yun, Jaesung
AU - Kim, Huy Kang
N1 - Publisher Copyright:
© 2015 Jae-wook Jang et al.
PY - 2015
Y1 - 2015
N2 - As the security landscape evolves over time, where thousands of species of malicious codes are seen every day, antivirus vendors strive to detect and classify malware families for efficient and effective responses against malware campaigns. To enrich this effort and by capitalizing on ideas from the social network analysis domain, we build a tool that can help classify malware families using features driven from the graph structure of their system calls. To achieve that, we first construct a system call graph that consists of system calls found in the execution of the individual malware families. To explore distinguishing features of various malware species, we study social network properties as applied to the call graph, including the degree distribution, degree centrality, average distance, clustering coefficient, network density, and component ratio. We utilize features driven from those properties to build a classifier for malware families. Our experimental results show that "influence-based" graph metrics such as the degree centrality are effective for classifying malware, whereas the general structural metrics of malware are less effective for classifying malware. Our experiments demonstrate that the proposed system performs well in detecting and classifying malware families within each malware class with accuracy greater than 96%.
AB - As the security landscape evolves over time, where thousands of species of malicious codes are seen every day, antivirus vendors strive to detect and classify malware families for efficient and effective responses against malware campaigns. To enrich this effort and by capitalizing on ideas from the social network analysis domain, we build a tool that can help classify malware families using features driven from the graph structure of their system calls. To achieve that, we first construct a system call graph that consists of system calls found in the execution of the individual malware families. To explore distinguishing features of various malware species, we study social network properties as applied to the call graph, including the degree distribution, degree centrality, average distance, clustering coefficient, network density, and component ratio. We utilize features driven from those properties to build a classifier for malware families. Our experimental results show that "influence-based" graph metrics such as the degree centrality are effective for classifying malware, whereas the general structural metrics of malware are less effective for classifying malware. Our experiments demonstrate that the proposed system performs well in detecting and classifying malware families within each malware class with accuracy greater than 96%.
UR - http://www.scopus.com/inward/record.url?scp=84944185088&partnerID=8YFLogxK
U2 - 10.1155/2015/769624
DO - 10.1155/2015/769624
M3 - Article
AN - SCOPUS:84944185088
SN - 1024-123X
VL - 2015
JO - Mathematical Problems in Engineering
JF - Mathematical Problems in Engineering
M1 - 769624
ER -