Classification of malware using structured control flow

By Silvio Cesare, Yang Xiang. 2010

154 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Attacking Graph-based Classification via Manipulating the Graph Structure (2019, methodology): “this paper, our attacks focus on evading node-level classification methods. In practice, graph-level classification methods have also been used for security analytics. For example, several approaches [13, 24] proposed to analyze and classify control-flow graphs for malware detection. These approache”
Evaluation and Design of Robust Neural Network Defenses (2018, methodology): “In the space of malware, machine learning has been used to detect malware from benign files [21, 104, 20, 29, 60, 108] (even using neural networks [24]) and an equal amount of work has been performed on attacking such classifiers [75, 134, 89, 92].”
Structural detection of android malware using embedded call graphs (2013, methodology): “Some of these methods rely on suboptimal strategies such as the graph edit distance [21] or the identification of maximum common subgraphs, while other ad hoc solutions propose the serialization of the graph structure [5] as a way to measure similarity.”
Dynamic Malware Analysis in the Modern Era—A State of the Art Survey (2019, background): “Other techniques like control flow tracking [72] or information flow tracking share many similar traits with data tainting and thus will not be covered here.”
Detection of Intrusions and Malware, and Vulnerability Assessment (2012, methodology): “21 Patrick Stewin and Iurii Bystrov Large-Scale Analysis of Malware Downloaders . . . . . . . . . . . . . . . . . . . . . . . 42 Christian Rossow, Christian Dietrich, and Herbert Bos Mobile Security Juxtapp: A Scalable System for Detecting Code Reuse among Android Applications . . . . . . . . . . . ”
Graph-based malware detection using dynamic analysis (2011, background): “Classification based on control flow graphs generally uses sub-graph matching [5,20] or edit-distance between graphs [8].”