GraphMoco:a Graph Momentum Contrast Model that Using Multimodel Structure Information for Large-scale Binary Function Representation Learning
Not on the map. Why?
Abstract (arXiv)
In the field of cybersecurity, the ability to compute similarity scores at the function level is import. Considering that a single binary file may contain an extensive amount of functions, an effective learning framework must exhibit both high accuracy and efficiency when handling substantial volumes of data. Nonetheless, conventional methods encounter several limitations. Firstly, accurately annotating different pairs of functions with appropriate labels poses a significant challenge, thereby making it difficult to employ supervised learning methods without risk of overtraining on erroneous labels. Secondly, while SOTA models often rely on pre-trained encoders or fine-grained graph comparison techniques, these approaches suffer from drawbacks related to time and memory consumption. Thirdly, the momentum update algorithm utilized in graph-based contrastive learning models can result in information leakage. Surprisingly, none of the existing articles address this issue. This research focuses on addressing the challenges associated with large-scale BCSD. To overcome the aforementioned problems, we propose GraphMoco: a graph momentum contrast model that leverages multimodal structural information for efficient binary function representation learning on a large scale. Our approach employs a CNN-based model and departs from the usage of memory-intensive pre-trained models. We adopt an unsupervised learning strategy that effectively use the intrinsic structural information present in the binary code. Our approach eliminates the need for manual labeling of similar or dissimilar information.Importantly, GraphMoco demonstrates exceptional performance in terms of both efficiency and accuracy when operating on extensive datasets. Our experimental results indicate that our method surpasses the current SOTA approaches in terms of accuracy.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 May 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 2; 2026: 1.
5 papers.
- 2024BLens: Contrastive Captioning of Binary Functions using Ensemble Embeddingcited by 3
- 2025Dual Explanations via Subgraph Matching for Malware Detectioncited by 2
- 2025Cross-modal Retrieval Models for Stripped Binary Analysiscited by 1
- 2024Know Your Neighborhood: General and Zero-Shot Capable Binary Function Search Powered by Call Graphletscited by 0
- 2026SoK: AI-Augmented Binary Reversingcited by 0
- 2026SoK: AI-Augmented Binary Reversing16 Jun 2026
- 2025Cross-modal Retrieval Models for Stripped Binary Analysis11 Dec 2025
- 2025Dual Explanations via Subgraph Matching for Malware Detection29 Apr 2025
- 2024BLens: Contrastive Captioning of Binary Functions using Ensemble Embedding12 Sep 2024
- 2024Know Your Neighborhood: General and Zero-Shot Capable Binary Function Search Powered by Call Graphlets2 Jun 2024