Fuzzing: on the exponential cost of vulnerability discovery
| Autor: | Marcel Böhme, Brandon Falk |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Theoretical computer science
Computer science Code coverage 020207 software engineering 02 engineering and technology Fuzz testing Exponential function Exponential growth 020204 information systems Scalability 0202 electrical engineering electronic engineering information engineering Code (cryptography) Overhead (computing) Probabilistic analysis of algorithms |
| Zdroj: | ESEC/SIGSOFT FSE |
| DOI: | 10.1145/3368089.3409729 |
| Popis: | We present counterintuitive results for the scalability of fuzzing. Given the same non-deterministic fuzzer, finding the same bugs linearly faster requires linearly more machines. For instance, with twice the machines, we can find all known bugs in half the time. Yet, finding linearly more bugs in the same time requires exponentially more machines. For instance, for every new bug we want to find in 24 hours, we might need twice more machines. Similarly for coverage. With exponentially more machines, we can cover the same code exponentially faster, but uncovered code only linearly faster. In other words, re-discovering the same vulnerabilities is cheap but finding new vulnerabilities is expensive. This holds even under the simplifying assumption of no parallelization overhead. We derive these observations from over four CPU years worth of fuzzing campaigns involving almost three hundred open source programs, two state-of-the-art greybox fuzzers, four measures of code coverage, and two measures of vulnerability discovery. We provide a probabilistic analysis and conduct simulation experiments to explain this phenomenon. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|