ESANN 2021 Proceedings 2021
DOI: 10.14428/esann/2021.es2021-82
|View full text |Cite
|
Sign up to set email alerts
|

Robust Malware Classification via Deep Graph Networks on Call Graph Topologies

Abstract: We propose a malware classification system that is shown to be robust to some common intra-procedural obfuscation techniques. Indeed, by training the Contextual Graph Markov Model on the call graph representation of a program, we classify it using only topological information, which is unaffected by such obfuscations. In particular, we show that the structure of the call graph is sufficient to achieve good accuracy on a multi-class classification benchmark.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 10 publications
0
4
0
Order By: Relevance
“…Errica et al . (Errica et al ., 2020) used nested cross-validation (CV) to fairly compare different GNN models. Briefly, a nested CV contains an external and an internal CV, where CV can choose the k-fold or holdout technique.…”
Section: Methodsmentioning
confidence: 99%
“…Errica et al . (Errica et al ., 2020) used nested cross-validation (CV) to fairly compare different GNN models. Briefly, a nested CV contains an external and an internal CV, where CV can choose the k-fold or holdout technique.…”
Section: Methodsmentioning
confidence: 99%
“…Malware Android apps from CICMalDroid2020 dataset are used for evaluation, with a best F1-score of 92.23%. For the detection of obfuscated malware, the paper [40] leverages a call graph where nodes are attributed with nodes' out-degree only. The Contextual Graph Markov Model (CGMM) [118] is used to learn the embeddings that are then classified using a standard feed-forward network, achieving a macro F1-score of 97.2%.…”
Section: Fcg Approachesmentioning
confidence: 99%
“…• Errica et al [40] propose a deep Hidden Markov Model for temporal graphs. The model consists of a stack of layers which perform probabilistic message passing, trained with Expectation-Maximization.…”
Section: Special Session's Contributionsmentioning
confidence: 99%