Главная
Study mode:
on
1
Introduction
2
Why Manual Duplication
3
Control Flow Graph Recovery
4
Binary Code
5
Attack Predicate
6
Tag Tampering
7
Small Graph
8
Dynamic Analysis
9
Dynamic Symbolic Execution
10
Challenge
11
Experimental Evaluation
12
Control Experiments
13
Conclusion
Description:
Explore a 22-minute IEEE conference talk on Backward-bounded DSE, a novel approach for addressing infeasibility questions in software deobfuscation and malware analysis. Learn how this method complements existing Dynamic Symbolic Execution techniques by offering a precise, efficient, and robust solution for detecting protection schemes like opaque predicates and call stack tampering. Discover the successful application of Backward-bounded DSE on state-of-the-art packers and the government-grade X-Tunnel malware, leading to complete deobfuscation. Gain insights into sparse disassembly, a combination of Backward-bounded DSE and static disassembly that enhances dynamic disassembly capabilities for heavily-obfuscated binaries. Understand the potential impact of this research on developing more robust, efficient, and precise disassembly tools for security analysis.

Backward-Bounded DSE - Targeting Infeasibility Questions on Obfuscated Codes

IEEE
Add to list