Poster: Directed hybrid fuzzing on binary code

16Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Hybrid fuzzers combine both fuzzing and concolic execution with the wish that the fuzzer will quickly explore input spaces and the concolic execution will solve the complex path conditions. However, existing hybrid fuzzers such as Driller cannot be effectively directed, for instance, towards unsafe system calls or suspicious locations, or towards functions in the call stack of a reported vulnerability that we wish to reproduce. In this poster, we propose DrillerGO, a directed hybrid fuzzing system, to mitigate this problem. It mainly consists of a static analysis and a dynamic analysis module. In the static analysis, it searches suspicious API call strings in the recovered control flow graph (CFG). After targeting some suspicious API call lines, it runs the concolic execution along with path guiding. The path guiding is helped by backward pathfinding, which is a novel technique to find paths backward from the target to the start of main(). Also, we will show that DrillerGo can find the crashes faster than Driller through experimental results.

Cite

CITATION STYLE

APA

Kim, J., & Yun, J. (2019). Poster: Directed hybrid fuzzing on binary code. In Proceedings of the ACM Conference on Computer and Communications Security (pp. 2637–2639). Association for Computing Machinery. https://doi.org/10.1145/3319535.3363275

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free