|
Published Articles >> Table of Contents >> Abstract
Source Code Analysis and Manipulation, Fourth IEEE International Workshop on (SCAM'04)
pp. 17-26
Abstracting Stack to Detect Obfuscated Calls in Binaries
Arun Lakhotia, University of Louisiana at Lafayette, LA
Eric Uday Kumar, University of Louisiana at Lafayette, LA
Full Article Text:
 
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SCAM.2004.2
Send link to a friend
| Abstract |
|
Information about calls to the operating system (or kernel libraries) made by a binary executable may be used to determine whether the binary is malicious. Being aware of this approach, malicious programmers hide this information by making such calls without using the call instruction. For instance, the 'call addr' instruction may be replaced by two push instructions and a return instruction, the first push pushes the address of the instruction after the return instruction, and the second push pushes the address addr. The code may be further obfuscated by spreading the three instructions and by splitting each instruction into multiple instructions. This paper presents a method to statically detect obfuscated calls in binary code. The notion of abstract stack is introduced to associate each element in the stack to the instruction that pushes the element. An abstract stack graph is a concise representation of all abstract stacks at every point in the program. An abstract stack graph, created by abstract interpretation of the binary executables, may be used to detect obfuscated calls and other stack related obfuscations.
|
 Additional Information
|
Citation:
Arun Lakhotia, Eric Uday Kumar,
"Abstracting Stack to Detect Obfuscated Calls in Binaries,"
scam,
pp. 17-26,
Source Code Analysis and Manipulation, Fourth IEEE International Workshop on (SCAM'04),
2004
|
|
