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 条
  • [41] GoFFish: A Sub-graph Centric Framework for Large-Scale Graph Analytics
    Simmhan, Yogesh
    Kumbhare, Alok
    Wickramaarachchi, Charith
    Nagarkar, Soonil
    Ravi, Santosh
    Raghavendra, Cauligi
    Prasanna, Viktor
    EURO-PAR 2014 PARALLEL PROCESSING, 2014, 8632 : 451 - 462
  • [42] Product Recognition in Store Shelves as a Sub-Graph Isomorphism Problem
    Tonioni, Alessio
    Di Stefano, Luigi
    IMAGE ANALYSIS AND PROCESSING,(ICIAP 2017), PT I, 2017, 10484 : 682 - 693
  • [43] Sub-Graph Regularization for Scalable Semi-supervised Classification
    Zhao, Mingbo
    Zhang, Yhe
    Tang, Xue-Song
    2019 IEEE 17TH INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS (INDIN), 2019, : 1488 - 1491
  • [44] Understanding the Roles of Sub-graph Features for Graph Classification: An Empirical Study Perspective
    Guo, Ting
    Zhu, Xingquan
    PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, : 817 - 822
  • [45] Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learning
    Jiao, Yizhu
    Xiong, Yun
    Zhang, Jiawei
    Zhang, Yao
    Zhang, Tianqi
    Zhu, Yangyong
    20TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2020), 2020, : 222 - 231
  • [46] Heterogeneous Temporal Graph Transformer: An Intelligent System for Evolving Android Malware Detection
    Fan, Yujie
    Ju, Mingxuan
    Hou, Shifu
    Ye, Yanfang
    Wan, Wenqiang
    Wang, Kui
    Mei, Yinming
    Xiong, Qi
    KDD '21: PROCEEDINGS OF THE 27TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2021, : 2831 - 2839
  • [47] A Control Task Assignment Algorithm based on sub-graph isomorphism
    Yu, Feng
    Li, Xixian
    Zhang, Huimin
    Wang, Li-e
    2020 EIGHTH INTERNATIONAL CONFERENCE ON ADVANCED CLOUD AND BIG DATA (CBD 2020), 2020, : 265 - 271
  • [48] Cryptocurrency Mining Malware Detection Based on Behavior Pattern and Graph Neural Network
    Zheng, Rui
    Wang, Qiuyun
    He, Jia
    Fu, Jianming
    Suri, Guga
    Jiang, Zhengwei
    SECURITY AND COMMUNICATION NETWORKS, 2022, 2022
  • [49] Combining exhaustive and approximate methods for improved sub-graph matching
    Baerecke, Thomas
    Detyniecki, Marcin
    PROGRESS IN PATTERN RECOGNITION, 2007, : 17 - +
  • [50] An algorithm for weighted sub-graph matching based on gradient flows
    Tao, Songqiao
    Wang, Shuting
    INFORMATION SCIENCES, 2016, 340 : 104 - 121