Is Function Similarity Over-Engineered? Building a Benchmark
Rebecca Saul, Chang Liu, Noah Fleischmann, Richard Zak, Kristopher, Micinski, Edward Raff, James Holt

TL;DR
This paper introduces REFuSE-Bench, a new benchmark for binary function similarity detection that reveals simple byte-based methods outperform complex models, challenging current assumptions in the field.
Contribution
The paper presents a new benchmark dataset for binary function similarity, addressing data quality issues and evaluating ML models on Windows data, highlighting the effectiveness of simple byte-based approaches.
Findings
Byte-based models achieve state-of-the-art performance.
Complex models do not significantly outperform simple byte comparisons.
The benchmark reflects real-world malware analysis scenarios.
Abstract
Binary analysis is a core component of many critical security tasks, including reverse engineering, malware analysis, and vulnerability detection. Manual analysis is often time-consuming, but identifying commonly-used or previously-seen functions can reduce the time it takes to understand a new file. However, given the complexity of assembly, and the NP-hard nature of determining function equivalence, this task is extremely difficult. Common approaches often use sophisticated disassembly and decompilation tools, graph analysis, and other expensive pre-processing steps to perform function similarity searches over some corpus. In this work, we identify a number of discrepancies between the current research environment and the underlying application need. To remedy this, we build a new benchmark, REFuSE-Bench, for binary function similarity detection consisting of high-quality datasets and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsTime Series Analysis and Forecasting
