.png){kind=icon}
Return
Towards Practical Binary Code Similarity Detection: Vulnerability Verification via Patch Semantic Analysis
.png){kind=icon}
OA
AI
DOI：10.1145/3604608.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Vulnerability is a major threat to software security. It has been proven that binary code similarity detection approaches are efficient to search for recurring vulnerabilities introduced by code sharing in binary software. However, these approaches suffer from high false-positive rates (FPRs) since they usually take the patched functions as vulnerable, and they usually do not work well when binaries are compiled with different compilation settings. To this end, we propose an approach, named ROBIN, to confirm recurring vulnerabilities by filtering out patched functions. ROBIN is powered by a lightweight symbolic execution to solve the set of function inputs that can lead to the vulnerability-related code. It then executes the target functions with the same inputs to capture the vulnerable or patched behaviors for patched function filtration. Experimental results show that ROBIN achieves high accuracy for patch detection across different compilers and compiler optimization levels respectively on 287 real-world vulnerabilities of 10 different software. Based on accurate patch detection, ROBIN significantly reduces the false-positive rate of state-of-the-art vulnerability detection tools (by 94.3% on average), making them more practical. ROBIN additionally detects 12 new potentially vulnerable functions.
Keywords:
Patch detection
vulnerability detection
under constrained symbolic execution
malicious function input
Journal
A
IF:
6.2
Papers:
1.2K
Citations:
3.4K
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSavePeptidomimetic inhibitors ofN-myristoyltransferase from human malaria and leishmaniasis parasites
OAAI
OAAIShareSaveShareSaveShareSaveShareSaveShareSaveShareSave View more