TY - CHAP
T1 - Identifying Reused Functions in Binary Code
AU - Alrabaee, Saed
AU - Debbabi, Mourad
AU - Shirani, Paria
AU - Wang, Lingyu
AU - Youssef, Amr
AU - Rahimian, Ashkan
AU - Nouh, Lina
AU - Mouheb, Djedjiga
AU - Huang, He
AU - Hanna, Aiman
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - Discovering reused binary functions is crucial for many security applications, especially considering the fact that many modern malware typically contain a significant amount of functions borrowed from open-source software packages. This process will not only reduce the odds of common libraries leading to false correlations between unrelated code bases but also improve the efficiency of reverse engineering. We introduce a system for fingerprinting reused functions in binary code. More specifically, we introduce a new representation, namely, the semantic integrated graph (SIG), which integrates control flow graph, register flow graph, function-call graph, and other structural information, into a joint data structure. Such a comprehensive representation captures different semantic descriptors of common functionalities in a unified manner as graph traces of SIG graphs.
AB - Discovering reused binary functions is crucial for many security applications, especially considering the fact that many modern malware typically contain a significant amount of functions borrowed from open-source software packages. This process will not only reduce the odds of common libraries leading to false correlations between unrelated code bases but also improve the efficiency of reverse engineering. We introduce a system for fingerprinting reused functions in binary code. More specifically, we introduce a new representation, namely, the semantic integrated graph (SIG), which integrates control flow graph, register flow graph, function-call graph, and other structural information, into a joint data structure. Such a comprehensive representation captures different semantic descriptors of common functionalities in a unified manner as graph traces of SIG graphs.
UR - http://www.scopus.com/inward/record.url?scp=85080953244&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85080953244&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-34238-8_5
DO - 10.1007/978-3-030-34238-8_5
M3 - Chapter
AN - SCOPUS:85080953244
T3 - Advances in Information Security
SP - 101
EP - 122
BT - Advances in Information Security
PB - Springer
ER -