Enhancing GNN Explanations for Malware Detection with Dual Subgraph Matching

The increasing sophistication of malware has challenged the effectiveness of conventional detection techniques, motivating the adoption of Graph Neural Networks (GNNs) for their ability to model the structural and semantic information embedded in control flow graphs. While GNNs offer high detection performance, their lack of transparency limits their applicability in security-critical domains. To address this, we present an explainable malware detection framework, which contains a dual explainer. This dual explainer integrates a GNN explainer with a neural subgraph matching approach and the VF2 algorithm. The proposed method identifies and verifies discriminative subgraphs during training, which are later used to explain new predictions through efficient matching. To enhance the generalization of the neural subgraph matcher, we train it using curriculum learning, gradually increasing subgraph complexity to improve matching quality. Experimental evaluations on benchmark datasets demonstrate that the proposed framework retains high classification accuracy while significantly improving interpretability. By unifying explainable graph learning techniques with subgraph matching, the proposed framework enables analysts to gain actionable insights, fostering greater trust in GNN-based malware detectors.