Asm2Vec: Boosting Static Representation Robustness for Binary Clone Search against Code Obfuscation and Compiler Optimization

被引:253
作者
Ding, Steven H. H. [1 ]
Fung, Benjamin C. M. [1 ]
Charland, Philippe [2 ]
机构
[1] McGill Univ, Sch Informat Studies, Data Min & Secur Lab, Montreal, PQ, Canada
[2] Def R&D Canada Valcartier, Mission Crit Cyber Secur Sect, Quebec City, PQ, Canada
来源
2019 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2019) | 2019年
基金
加拿大自然科学与工程研究理事会;
关键词
D O I
10.1109/SP.2019.00003
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Reverse engineering is a manually intensive but necessary technique for understanding the inner workings of new malware, finding vulnerabilities in existing systems, and detecting patent infringements in released software. An assembly clone search engine facilitates the work of reverse engineers by identifying those duplicated or known parts. However, it is challenging to design a robust clone search engine, since there exist various compiler optimization options and code obfuscation techniques that make logically similar assembly functions appear to be very different. A practical clone search engine relies on a robust vector representation of assembly code. However, the existing clone search approaches, which rely on a manual feature engineering process to form a feature vector for an assembly function, fail to consider the relationships between features and identify those unique patterns that can statistically distinguish assembly functions. To address this problem, we propose to jointly learn the lexical semantic relationships and the vector representation of assembly functions based on assembly code. We have developed an assembly code representation learning model Asm2Vec. It only needs assembly code as input and does not require any prior knowledge such as the correct mapping between assembly functions. It can find and incorporate rich semantic relationships among tokens appearing in assembly code. We conduct extensive experiments and benchmark the learning model with state-of-the-art static and dynamic clone search approaches. We show that the learned representation is more robust and significantly outperforms existing methods against changes introduced by obfuscation and optimizations.
引用
收藏
页码:472 / 489
页数:18
相关论文
共 47 条
  • [1] Compiler-Agnostic Function Detection in Binaries
    Andriesse, Dennis
    Slowinska, Asia
    Bos, Herbert
    [J]. 2017 IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY (EUROS&P), 2017, : 177 - 189
  • [2] [Anonymous], P 33 INT C SOFTW ENG
  • [3] [Anonymous], 2008, P INT C INF COMM SEC
  • [4] [Anonymous], P IEEE S SEC PRIV SP
  • [5] [Anonymous], P INT C INF SEC CRYP
  • [6] [Anonymous], 2012, P IEEE S SEC PRIV SP
  • [7] Code Obfuscation Against Symbolic Execution Attacks
    Banescu, Sebastian
    Collberg, Christian
    Ganesh, Vijay
    Newsham, Zack
    Pretschner, Alexander
    [J]. 32ND ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE (ACSAC 2016), 2016, : 189 - 200
  • [8] Clone detection using abstract syntax trees
    Baxter, ID
    Yahin, A
    Moura, L
    Sant'Anna, M
    Bier, L
    [J]. INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE, PROCEEDINGS, 1998, : 368 - 377
  • [9] Bourquin M., 2013, P 2 ACM SIGPLAN PROG, P1
  • [10] Brown S., 2016, Binary diffing with kam1n0