BinRec: Attack Surface Reduction Through Dynamic Binary Recovery
Compile-time specialization and feature pruning through static binary rewriting have been proposed repeatedly as techniques for reducing the attack surface of large programs, and for minimizing the trusted computing base. We propose a new approach to attack surface reduction: dynamic binary lifting and recompilation.
We present BinRec, a binary recompilation framework that lifts binaries to a compiler-level intermediate representation (IR) to allow complex transformations on the captured code. After transformation, BinRec lowers the IR back to a “recovered” binary, which is semantically equivalent to the input binary, but does have its unnecessary features removed. Unlike existing approaches, which are mostly based on static analysis and rewriting, our framework analyzes and lifts binaries dynamically. The crucial advantage is that we can not only observe the full program including all of its dependencies, but we can also determine which program features the end-user actually uses. We evaluate the correctness and performance of BinRec, and show that our approach enables aggressive pruning of unwanted features in COTS binaries.
Thu 19 Jul Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
16:00 - 18:30
|On the Effectiveness of Kernel Debloating via Compile-time Configuration|
|WALA Everywhere: Cross Language Deep Analysis and Cross IDE Tool Support|
Julian DolbyIBM Thomas J. Watson Research Center
|Detection of Spectre vulnerabilities via static analysis|
Omer TrippGoogle Inc.
|BinRec: Attack Surface Reduction Through Dynamic Binary Recovery|