Frequent sub-graph mining for intelligent malware detection

被引:12
|
作者
Eskandari, Mojtaba [1 ]
Raesi, Hooman [2 ]
机构
[1] Shiraz Univ, Dept Comp Sci & Engn, Shiraz, Fars, Iran
[2] Islamic Azad Univ, Arak Branch, Dept Comp Engn, Arak, Iran
关键词
malware; intelligent detection; semantic signature; programming style; frequent sub-graph; CFG; ARCHITECTURE;
D O I
10.1002/sec.902
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Malware is a serious threat that has caused catastrophic disasters in recent decades. To deal with this issue, various approaches have been proposed. One effective and widely used method is signature-based detection. However, there is a substantial problem in detecting new instances; therefore, this method is solely useful for second malware attacks. In addition, owing to the rapid proliferation of malware and the significant human effort requirement to extract signatures, this approach is an inadequate solution; thus, an intelligent malware detection system is required. One of the major phases of such a system is feature extraction, used to construct a learning model. This paper introduces an approach to generate a group of semantic signatures, represented by a set of learning models, in which various features indicate the different programming styles of the execution files. A set of these signatures is obtained by mining frequent sub-graphs, common code sub-structures employed for malware writing, in a group of control flow graphs. The experimental results depict an improved F-measure rate in comparison with the classic graph-based approach. Copyright (c) 2014 John Wiley & Sons, Ltd.
引用
收藏
页码:1872 / 1886
页数:15
相关论文
共 50 条
  • [21] An algorithm portfolio for the sub-graph isomorphism problem
    Battiti, Roberto
    Mascia, Franco
    ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007, 4638 : 106 - +
  • [22] Metamorphic Malware Detection using Control Flow Graph Mining
    Eskandari, Mojtaba
    Hashemi, Sattar
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2011, 11 (12): : 1 - 6
  • [23] A Quantum Algorithm for the Sub-graph Isomorphism Problem
    Mariella, Nicola
    Simonetto, Andrea
    ACM TRANSACTIONS ON QUANTUM COMPUTING, 2023, 4 (02):
  • [24] ODES: an overlapping dense sub-graph algorithm
    Long, James
    Hartman, Chris
    BIOINFORMATICS, 2010, 26 (21) : 2788 - 2789
  • [25] G3MD: Mining frequent opcode sub-graphs for metamorphic malware detection of existing families
    Khalilian, Alireza
    Nourazar, Amir
    Vahidi-Asl, Mojtaba
    Haghighi, Hassan
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 112 : 15 - 33
  • [26] Enhanced Sub-graph Reconstruction Graph Neural Network for Recommendation
    Liu, Zhe
    Lou, Xiaojun
    Li, Jian
    Liu, Guanjun
    APPLIED ARTIFICIAL INTELLIGENCE, 2024, 38 (01)
  • [27] Sub-graph Mining: Identifying Micro-architectures in Evolving Object-oriented Software
    Belderrar, Ahmed
    Kpodjedo, Segla
    Gueheneuc, Yann-Gael
    Antoniol, Giuliano
    Galinier, Philippe
    2011 15TH EUROPEAN CONFERENCE ON SOFTWARE MAINTENANCE AND REENGINEERING (CSMR), 2011, : 171 - 180
  • [28] A Dynamic Stain Analysis Method on Maximal Frequent Sub Graph Mining
    Guo F.
    Wang X.
    Wang H.
    Lü H.
    Hu Y.
    Wu F.
    Feng G.
    Zhao Q.
    Feng, Guangsheng (fengguangsheng@hrbeu.edu.cn), 1600, Science Press (57): : 631 - 638
  • [29] An Android Malware Detection Method Using Frequent Graph Convolutional Neural Networks
    Zhao, Yulong
    Sun, Shi
    Huang, Xiaofeng
    Zhang, Jixin
    ELECTRONICS, 2025, 14 (06):
  • [30] Even-aged restrictions with sub-graph adjacency
    T.M. Barrett
    J.K. Gilless
    Annals of Operations Research, 2000, 95 : 159 - 175