2009 30th IEEE Symposium on Security and Privacy 2009
DOI: 10.1109/sp.2009.27
|View full text |Cite
|
Sign up to set email alerts
|

Automatic Reverse Engineering of Malware Emulators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
82
0
2

Year Published

2009
2009
2018
2018

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 146 publications
(88 citation statements)
references
References 18 publications
0
82
0
2
Order By: Relevance
“…PVMs can greatly increase the search space for the attacker, provide misleading run-time information and continuously relocate critical code, making dynamic analysis exceedingly difficult to accomplish. There has been research which aims to reverse engineer PVM-protected applications, by identifying code belonging to the VM in the execution trace [15,44]. However, such methodologies usually involve performing complex analysis on the trace information and are targeted towards applications which are typically small in size (i.e., a few hundred instructions e.g., malware).…”
Section: Implications Of the Attackmentioning
confidence: 99%
“…PVMs can greatly increase the search space for the attacker, provide misleading run-time information and continuously relocate critical code, making dynamic analysis exceedingly difficult to accomplish. There has been research which aims to reverse engineer PVM-protected applications, by identifying code belonging to the VM in the execution trace [15,44]. However, such methodologies usually involve performing complex analysis on the trace information and are targeted towards applications which are typically small in size (i.e., a few hundred instructions e.g., malware).…”
Section: Implications Of the Attackmentioning
confidence: 99%
“…However, their scheme does not produce encouraging results when applied to complex applications. Sharif et al have also devised techniques to automatically reverse engineer malware that is obfuscated by such PVMs [44]. Although their goals are somewhat similar to this work, there are marked differences.…”
Section: Related Workmentioning
confidence: 99%
“…These methods proceed by monitoring the usage of memory and identifying unpacked code created at runtime. A similar approach is devised by Sharif et al [22], which defeats emulation-based packers using dynamic taint analysis. These unpackers enable a generic deobfuscation of malicious code, yet they operate at runtime and, similar to the analysis of documents in a sandbox, suffer from a runtime overhead.…”
Section: Related Workmentioning
confidence: 99%