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 条
  • [1] Maximal Frequent Sub-graph Mining for Malware Detection
    Hellal, Aya
    Ben Romdhane, Lotfi
    2015 15TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA), 2015, : 31 - 39
  • [2] Frequent Sub-graph Mining on Edge Weighted Graphs
    Jiang, Chuntao
    Coenen, Frans
    Zito, Michele
    DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, 2010, 6263 : 77 - 88
  • [3] Data service Mashup recommendation method based on frequent sub-graph mining
    Zhang Z.-M.
    Wang G.-L.
    Zhang S.
    Han Y.-B.
    Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2016, 45 (02): : 263 - 269
  • [4] Connected Sub-graph Detection
    Qian, Jing
    Saligrama, Venkatesh
    Chen, Yuting
    ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 33, 2014, 33 : 796 - 804
  • [5] Design Patterns Mining using Neural Sub-graph Matching
    Ardimento, Pasquale
    Aversano, Lerina
    Bernardi, Mario Luca
    Cimitile, Marta
    37TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, 2022, : 1545 - 1553
  • [6] Unsupervised Exceptional Attributed Sub-graph Mining in Urban Data
    Bendimerad, Ahmed Anes
    Plantevit, Marc
    Robardet, Celine
    2016 IEEE 16TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2016, : 21 - 30
  • [7] Approximately duplicate records detection based on complete sub-graph
    Software School, Xiamen University, Xiamen, Fujian, China
    Adv. Inf. Sci. Serv. Sci., 11 (352-361):
  • [8] Minimal contrast frequent pattern mining for malware detection
    Hellal, Aya
    Ben Romdhane, Lotfi
    COMPUTERS & SECURITY, 2016, 62 : 19 - 32
  • [9] Semantic Malware Detection by Deploying Graph Mining
    Karbalaie, Fatemeh
    Sami, Ashkan
    Ahmadi, Mansour
    International Journal of Computer Science Issues, 2012, 9 (1 1-3): : 373 - 379
  • [10] A Privacy Policy Conflict Detection Method based on Sub-graph Isomorphism
    Ren, Yi
    Peng, Zhiyong
    Cheng, Fangquan
    Guo, Sipei
    MINES 2009: FIRST INTERNATIONAL CONFERENCE ON MULTIMEDIA INFORMATION NETWORKING AND SECURITY, VOL 1, PROCEEDINGS, 2009, : 107 - +