Cupid - Automatic Fuzzer Selection for Collaborative Fuzzing.

ACSAC '20: Proceedings of the 36th Annual Computer Security Applications Conference(2020)

引用 13|浏览0
暂无评分
摘要
Combining the strengths of individual fuzzing methods is an appealing idea to find software faults more efficiently, especially when the computing budget is limited. In prior work, ENFUZZ introduced the idea of ensemble fuzzing and devised three heuristics to classify properties of fuzzers in terms of diversity. Based on these heuristics, the authors manually picked a combination of different fuzzers that collaborate. In this paper, we generalize this idea by collecting and applying empirical data from single, isolated fuzzer runs to automatically identify a set of fuzzers that complement each other when executed collaboratively. To this end, we present CUPID, a collaborative fuzzing framework allowing automated, data-driven selection of multiple complementary fuzzers for parallelized and distributed fuzzing. We evaluate the automatically selected target-independent combination of fuzzers by CUPID on Google's fuzzer-test-suite, a collection of real-world binaries, as well as on the synthetic LAVA-M dataset. We find that CUPID outperforms two expert-guided, target-specific and hand-picked combinations on Google's fuzzer-test-suite in terms of branch coverage, and improves bug finding on LAVA-M by 10%. Most importantly, we improve the latency for obtaining 95% and 99% of the coverage by 90% and 64%, respectively. Furthermore, CUPID reduces the amount of CPU hours needed to find a high-performing combination of fuzzers by multiple orders of magnitude compared to an exhaustive evaluation.
更多
查看译文
关键词
fuzzing, parallel fuzzing, collaborative fuzzing, ensemble fuzzing, automated bug finding
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要