arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.12681cs.CRcs.LG
收藏

骗你一次:关于二进制代码相似性检测模型在保持语义变换下的鲁棒性

Fool Me If You Can: On the Robustness of Binary Code Similarity Detection Models against Semantics-preserving Transformations

Sungkyunkwan University(首尔大学);Stony Brook University(石溪大学)

Jiyong Uhm, Minseok Kim, Michalis Polychronakis, Hyungjoon Koo

AI总结:

研究评估了二进制代码相似性检测模型在语义保持变换下的鲁棒性,揭示了模型鲁棒性依赖于处理流程、对抗性变换的有效性限制以及精心设计的变换对模型决策的破坏作用。

摘要:

二进制代码分析在网络安全中发挥着关键作用,有助于逆向工程以揭示在没有源代码的情况下程序的内部运作。传统方法,如静态和动态分析,从剥离的二进制中提取有价值的见解,但通常需要大量的专业知识和手动工作。近年来,深度学习的进步为通过捕捉潜在特征和揭示底层代码语义来增强二进制分析提供了有希望的机会。尽管基于机器学习的二进制分析模型越来越多,但它们在二进制层面的对抗性代码变换中的鲁棒性仍然研究不足。我们评估了深度学习模型在语义保持变换下的二进制代码相似性检测(BCSD)任务的鲁棒性。机器指令的独特性质与在其他领域中常见的典型输入扰动有显著差异。我们介绍了asmFooler,一个系统,通过使用一组多样化的对抗性代码变换来评估BCSD模型的韧性,这些变换保持功能语义。我们通过在六个代表性的BCSD模型上应用八种语义保持变换,构建了包含9,565个二进制变体的9,565个二进制变体数据集。我们的主要发现突显了几个关键见解:i)模型鲁棒性依赖于处理流程,包括代码预处理、架构和特征选择;ii)对抗性变换的有效性受到由模型特定约束如输入大小和指令表达能力塑造的预算限制;iii)精心设计的变换可以以最小的扰动高度有效;iv)此类变换通过专注于语义重要的指令,高效地破坏模型决策(例如,误导为假阳性或假阴性)

英文摘要:

Binary code analysis plays an essential role in cybersecurity, facilitating reverse engineering to reveal the inner workings of programs in the absence of source code. Traditional approaches, such as static and dynamic analysis, extract valuable insights from stripped binaries, but often demand substantial expertise and manual effort. Recent advances in deep learning have opened promising opportunities to enhance binary analysis by capturing latent features and disclosing underlying code semantics. Despite the growing number of binary analysis models based on machine learning, their robustness to adversarial code transformations at the binary level remains underexplored. We evaluate the robustness of deep learning models for the task of binary code similarity detection (BCSD) under semantics-preserving transformations. The unique nature of machine instructions presents distinct challenges compared to the typical input perturbations found in other domains. We introduce asmFooler, a system that evaluates the resilience of BCSD models using a diverse set of adversarial code transformations that preserve functional semantics. We construct a dataset of 9,565 binary variants from 620 baseline samples by applying eight semantics-preserving transformations across six representative BCSD models. Our major findings highlight several key insights: i) model robustness relies on the processing pipeline, including code pre-processing, architecture, and feature selection; ii) adversarial transformation effectiveness is bounded by a budget shaped by model-specific constraints like input size and instruction expressive capacity; iii) well-crafted transformations can be highly effective with minimal perturbations; and iv) such transformations efficiently disrupt model decisions (e.g., misleading to false positives or false negatives) by focusing on semantically significant instructions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑