BinDiffNN : Learning Distributed Representation of Assembly for Robust Binary Diffing Against Semantic Differences
Sami Ullah, Heekuck Oh · IEEE Transactions on Software Engineering · 2021
Binary diffing is a process to discover the differences and similarities in functionality between two binary programs. Previous research on binary diffing approaches it as afunction matchingproblem to formulate an initial 1:1 mapping between functions, and later a sequence matching ratio is computed to classify two functions being anexactmatch, apartialmatch orno-match. The accuracy of existing techniques is best only when detecting exact matches and they are not efficient in detecting partially changed functions; especially those with minor patches. These drawbacks are due to two major challenges (i) In the 1:1 mapping phase, using a strict policy to match function features (ii) In the classification phase, considering an assembly snippet as a normal text, and using sequence matching for similarity comparison. Instruction has a unique structure i.e. mnemonics and registers have a specific position in instruction and also have a semantic relationship, which makes assembly code different from general text. Sequence matching performs best for general text but it fails to detect structural and semantic changes at an instruction level thus, its use for classification produces many false results. In this research, we have addressed the aforementioned underlying challenges by proposing a two-fold solution. For the 1:1 mapping phase, we have proposed computationally inexpensive features, which are compared with distance-based selection criteria to map similar functions and filter unmatched functions. For the classification phase, we have proposed a Siamese binary-classification neural network where each branch is an attention-based distributed learning embedding neural network — that learn the semantic similarity among assembly instructions, learn to highlight the changes at an instruction level and a final stage fully connected layer learn to accurately classify two 1:1 mapped function either anexactor a partial match. We have used x86 kernel binaries for training and achieved$\sim 99\%$classification accuracy; which is higher than existing binarydiffingtechniques and tools.