Published December 7, 2019 | Version 1.0.0
Journal article Open

G3MD: Mining frequent opcode sub-graphs for metamorphic malware detection of existing families

  • 1. The University of Isfahan
  • 2. Shahid Beheshti University

Description

Attackers leverage various obfuscation techniques to create a metamorphic malware that can evade from detection by anti-malwares. To defeat, we propose Graph Mining for Metamorphic Malware Detection (G3MD), an intelligent system for static detection of metamorphic malwares. G3MD demonstrates one of the many aspects of what the current generation of machine-learning techniques and expert systems can do. It extends what is known about practical application of machine-learning techniques in the field of information security. It is intended to alleviate the burden of human experts and underlying costs. The novelty of G3MD is to apply graph mining on the opcode graphs of a metamorphic family of malwares to extract the frequent sub-graphs, so called micro-signatures. Based on these sub-graphs, a classifier is trained to distinguish between a benign file and a metamorphic malware. We conducted experiments on four families of metamorphic malwares common in previous studies, namely Next Generation Virus Generation Kit (NGVCK), Second Generation Virus Generator (G2), and Mass Produced Code Generation Kit (MPCGEN) viruses and Metamorphic Worm (MWOR) worms. The precision (over 99% in most cases) of metamorphic malware detection by the proposed approach corroborates its effectiveness over other existing approaches.

Files

G2.zip

Files (2.2 MB)

Name Size Download all
md5:80679d8e3699792e6f01d9f7b0e1ccdf
240.2 kB Preview Download
md5:f4e8c2a1f9f56d969d822f06b9890ba1
951.8 kB Preview Download
md5:20dcf375e1a07d684a317767472413a0
215.4 kB Preview Download
md5:a21e749814819628daf5d1146acec4fb
745.7 kB Preview Download