HI-CFG: Construction by binary analysis, and application to attack polymorphism

Abstract. Security analysis often requires understanding both the con-trol and data-flow structure of a binary. We introduce a new program representation, a hybrid information- and control-flow graph (HI-CFG), and give algorithms to infer it from an instruction-level trace. As an application, we consider the task of generalizing an attack against a pro-gram whose inputs undergo complex transformations before reaching a vulnerability. We apply the HI-CFG to find the parts of the program that implement each transformation, and then generate new attack in-puts under a user-specified combination of transformations. Structural knowledge allows our approach to scale to applications that are infeasible with monolithic symbolic execution. Such attack polymorphism shows the insufficiency of any filter that does not support all the same trans-formations as the vulnerable application. In case studies, we show this attack capability against a PDF viewer and a word processor.