2019-07-01 09:28:12 +00:00
<!DOCTYPE html>
2019-08-09 03:54:43 +00:00
< html class = "theme-next gemini use-motion" lang = "zh-Hans" >
2019-07-01 09:28:12 +00:00
< head > < meta name = "generator" content = "Hexo 3.8.0" >
< meta charset = "UTF-8" >
< meta http-equiv = "X-UA-Compatible" content = "IE=edge" >
< meta name = "viewport" content = "width=device-width, initial-scale=1, maximum-scale=1" >
< meta name = "theme-color" content = "#222" >
< meta http-equiv = "Cache-Control" content = "no-transform" >
< meta http-equiv = "Cache-Control" content = "no-siteapp" >
< link href = "/lib/fancybox/source/jquery.fancybox.css?v=2.1.5" rel = "stylesheet" type = "text/css" >
< link href = "/lib/font-awesome/css/font-awesome.min.css?v=4.6.2" rel = "stylesheet" type = "text/css" >
< link href = "/css/main.css?v=5.1.4" rel = "stylesheet" type = "text/css" >
< link rel = "apple-touch-icon" sizes = "180x180" href = "/images/hackerrank.png?v=5.1.4" >
< link rel = "icon" type = "image/png" sizes = "32x32" href = "/images/hackerrank.png?v=5.1.4" >
< link rel = "icon" type = "image/png" sizes = "16x16" href = "/images/hackerrank.png?v=5.1.4" >
< link rel = "mask-icon" href = "/images/logo.svg?v=5.1.4" color = "#222" >
2019-07-01 11:52:45 +00:00
< meta name = "keywords" content = "AFL,模糊测试," >
2019-07-01 09:28:12 +00:00
2019-07-01 11:52:45 +00:00
< meta name = "description" content = "接触这个词语已经有一年了, 但还没有学习过更没有上手实践过, 正好趁这个机会好好弄弄AFL。提起模糊测试, 我们总会联想起这样或那样的专业术语——测试用例、代码覆盖率、执行路径等等, 你可能和我一样一头雾水, 这次我们就来看个明白 0x01 模糊测试首先, 模糊测试( Fuzzing) 是一种测试手段, 它把系统看成一个摸不清内部结构的黑盒, 只是向其输入接口随机地发送合法测试用例, 这些用例并不是开发者所预期的输入" >
< meta name = "keywords" content = "AFL,模糊测试" >
2019-07-01 09:28:12 +00:00
< meta property = "og:type" content = "article" >
2019-07-09 09:27:51 +00:00
< meta property = "og:title" content = "模糊测试与AFL" >
2019-07-01 09:28:12 +00:00
< meta property = "og:url" content = "https://cool-y.github.io/2019/07/01/AFL-first-learn/index.html" >
< meta property = "og:site_name" content = "混元霹雳手" >
2019-07-01 11:52:45 +00:00
< meta property = "og:description" content = "接触这个词语已经有一年了, 但还没有学习过更没有上手实践过, 正好趁这个机会好好弄弄AFL。提起模糊测试, 我们总会联想起这样或那样的专业术语——测试用例、代码覆盖率、执行路径等等, 你可能和我一样一头雾水, 这次我们就来看个明白 0x01 模糊测试首先, 模糊测试( Fuzzing) 是一种测试手段, 它把系统看成一个摸不清内部结构的黑盒, 只是向其输入接口随机地发送合法测试用例, 这些用例并不是开发者所预期的输入" >
2019-07-01 09:28:12 +00:00
< meta property = "og:locale" content = "zh-Hans" >
2019-07-09 09:11:34 +00:00
< meta property = "og:image" content = "https://image.3001.net/images/20181207/1544168163_5c0a22e3eedce.jpg" >
< meta property = "og:image" content = "http://lcamtuf.coredump.cx/afl/afl_gzip.png" >
2019-07-09 09:27:51 +00:00
< meta property = "og:updated_time" content = "2019-07-09T09:27:22.887Z" >
2019-07-01 09:28:12 +00:00
< meta name = "twitter:card" content = "summary" >
2019-07-09 09:27:51 +00:00
< meta name = "twitter:title" content = "模糊测试与AFL" >
2019-07-01 11:52:45 +00:00
< meta name = "twitter:description" content = "接触这个词语已经有一年了, 但还没有学习过更没有上手实践过, 正好趁这个机会好好弄弄AFL。提起模糊测试, 我们总会联想起这样或那样的专业术语——测试用例、代码覆盖率、执行路径等等, 你可能和我一样一头雾水, 这次我们就来看个明白 0x01 模糊测试首先, 模糊测试( Fuzzing) 是一种测试手段, 它把系统看成一个摸不清内部结构的黑盒, 只是向其输入接口随机地发送合法测试用例, 这些用例并不是开发者所预期的输入" >
2019-07-09 09:11:34 +00:00
< meta name = "twitter:image" content = "https://image.3001.net/images/20181207/1544168163_5c0a22e3eedce.jpg" >
2019-07-01 09:28:12 +00:00
< script type = "text/javascript" id = "hexo.configurations" >
var NexT = window.NexT || {};
var CONFIG = {
root: '/',
2019-08-09 03:54:43 +00:00
scheme: 'Gemini',
2019-07-01 09:28:12 +00:00
version: '5.1.4',
sidebar: {"position":"left","display":"post","offset":12,"b2t":false,"scrollpercent":false,"onmobile":false},
fancybox: true,
tabs: true,
motion: {"enable":true,"async":false,"transition":{"post_block":"fadeIn","post_header":"slideDownIn","post_body":"slideDownIn","coll_header":"slideLeftIn","sidebar":"slideUpIn"}},
duoshuo: {
userId: '0',
author: '博主'
},
algolia: {
applicationID: '',
apiKey: '',
indexName: '',
hits: {"per_page":10},
labels: {"input_placeholder":"Search for Posts","hits_empty":"We didn't find any results for the search: ${query}","hits_stats":"${hits} results found in ${time} ms"}
}
};
< / script >
< link rel = "canonical" href = "https://cool-y.github.io/2019/07/01/AFL-first-learn/" >
2019-07-09 09:27:51 +00:00
< title > 模糊测试与AFL | 混元霹雳手< / title >
2019-07-01 09:28:12 +00:00
< / head >
< body itemscope itemtype = "http://schema.org/WebPage" lang = "zh-Hans" >
< div class = "container sidebar-position-left page-post-detail" >
< div class = "headband" > < / div >
< header id = "header" class = "header" itemscope itemtype = "http://schema.org/WPHeader" >
< div class = "header-inner" > < div class = "site-brand-wrapper" >
< div class = "site-meta " >
< div class = "custom-logo-site-title" >
< a href = "/" class = "brand" rel = "start" >
< span class = "logo-line-before" > < i > < / i > < / span >
< span class = "site-title" > 混元霹雳手< / span >
< span class = "logo-line-after" > < i > < / i > < / span >
< / a >
< / div >
2019-07-24 03:51:42 +00:00
< p class = "site-subtitle" > < / p >
2019-07-01 09:28:12 +00:00
< / div >
< div class = "site-nav-toggle" >
< button >
< span class = "btn-bar" > < / span >
< span class = "btn-bar" > < / span >
< span class = "btn-bar" > < / span >
< / button >
< / div >
< / div >
< nav class = "site-nav" >
< ul id = "menu" class = "menu" >
< li class = "menu-item menu-item-home" >
< a href = "/" rel = "section" >
< i class = "menu-item-icon fa fa-fw fa-home" > < / i > < br >
首页
< / a >
< / li >
< li class = "menu-item menu-item-about" >
< a href = "/about/" rel = "section" >
< i class = "menu-item-icon fa fa-fw fa-user" > < / i > < br >
关于
< / a >
< / li >
< li class = "menu-item menu-item-tags" >
< a href = "/tags/" rel = "section" >
< i class = "menu-item-icon fa fa-fw fa-tags" > < / i > < br >
标签
< / a >
< / li >
< li class = "menu-item menu-item-categories" >
< a href = "/categories/" rel = "section" >
< i class = "menu-item-icon fa fa-fw fa-th" > < / i > < br >
分类
< / a >
< / li >
< li class = "menu-item menu-item-archives" >
< a href = "/archives/" rel = "section" >
< i class = "menu-item-icon fa fa-fw fa-archive" > < / i > < br >
归档
< / a >
< / li >
< li class = "menu-item menu-item-bookmarks" >
< a href = "/bookmarks/" rel = "section" >
< i class = "menu-item-icon fa fa-fw fa-map" > < / i > < br >
书签
< / a >
< / li >
2019-08-08 12:42:56 +00:00
2019-08-08 12:47:43 +00:00
< li class = "menu-item menu-item-hack之外" >
2019-08-08 12:42:56 +00:00
< a href = "/hack之外/" rel = "section" >
2019-08-08 12:52:19 +00:00
< i class = "menu-item-icon fa fa-fw fa-heartbeat" > < / i > < br >
2019-08-08 12:42:56 +00:00
2019-08-08 12:52:19 +00:00
HACK之外
2019-08-08 12:42:56 +00:00
< / a >
< / li >
2019-07-01 09:28:12 +00:00
< / ul >
< / nav >
< / div >
< / header >
< main id = "main" class = "main" >
< div class = "main-inner" >
< div class = "content-wrap" >
< div id = "content" class = "content" >
< div id = "posts" class = "posts-expand" >
< article class = "post post-type-normal" itemscope itemtype = "http://schema.org/Article" >
< div class = "post-block" >
< link itemprop = "mainEntityOfPage" href = "https://cool-y.github.io/2019/07/01/AFL-first-learn/" >
< span hidden itemprop = "author" itemscope itemtype = "http://schema.org/Person" >
< meta itemprop = "name" content = "Cool-Y" >
< meta itemprop = "description" content >
< meta itemprop = "image" content = "/images/avatar.png" >
< / span >
< span hidden itemprop = "publisher" itemscope itemtype = "http://schema.org/Organization" >
< meta itemprop = "name" content = "混元霹雳手" >
< / span >
< header class = "post-header" >
2019-07-09 09:27:51 +00:00
< h1 class = "post-title" itemprop = "name headline" > 模糊测试与AFL< / h1 >
2019-07-01 09:28:12 +00:00
< div class = "post-meta" >
< span class = "post-time" >
< span class = "post-meta-item-icon" >
< i class = "fa fa-calendar-o" > < / i >
< / span >
< span class = "post-meta-item-text" > 发表于< / span >
< time title = "创建于" itemprop = "dateCreated datePublished" datetime = "2019-07-01T17:25:36+08:00" >
2019-07-01
< / time >
< / span >
< span class = "post-category" >
< span class = "post-meta-divider" > |< / span >
< span class = "post-meta-item-icon" >
< i class = "fa fa-folder-o" > < / i >
< / span >
< span class = "post-meta-item-text" > 分类于< / span >
< span itemprop = "about" itemscope itemtype = "http://schema.org/Thing" >
< a href = "/categories/二进制/" itemprop = "url" rel = "index" >
< span itemprop = "name" > 二进制< / span >
< / a >
< / span >
< / span >
2019-07-09 09:27:51 +00:00
< span id = "/2019/07/01/AFL-first-learn/" class = "leancloud_visitors" data-flag-title = "模糊测试与AFL" >
2019-07-01 09:28:12 +00:00
< span class = "post-meta-divider" > |< / span >
< span class = "post-meta-item-icon" >
< i class = "fa fa-eye" > < / i >
< / span >
< span class = "post-meta-item-text" > 阅读次数: < / span >
< span class = "leancloud-visitors-count" > < / span >
< / span >
< div class = "post-wordcount" >
< span class = "post-meta-item-icon" >
< i class = "fa fa-file-word-o" > < / i >
< / span >
< span title = "字数统计" >
2019-07-09 09:11:34 +00:00
11.4k 字
2019-07-01 09:28:12 +00:00
< / span >
< span class = "post-meta-divider" > |< / span >
< span class = "post-meta-item-icon" >
< i class = "fa fa-clock-o" > < / i >
< / span >
< span title = "阅读时长" >
2019-07-09 09:11:34 +00:00
42 分钟
2019-07-01 09:28:12 +00:00
< / span >
< / div >
< / div >
< / header >
< div class = "post-body" itemprop = "articleBody" >
< p > 接触这个词语已经有一年了, 但还没有学习过更没有上手实践过, 正好趁这个机会好好弄弄AFL。提起模糊测试, 我们总会联想起这样或那样的专业术语——测试用例、代码覆盖率、执行路径等等, 你可能和我一样一头雾水, 这次我们就来看个明白< / p >
2019-07-01 11:52:45 +00:00
< hr >
2019-07-01 09:28:12 +00:00
< h1 id = "0x01-模糊测试" > < a href = "#0x01-模糊测试" class = "headerlink" title = "0x01 模糊测试" > < / a > 0x01 模糊测试< / h1 > < p > 首先, 模糊测试( Fuzzing) 是一种测试手段, 它把系统看成一个摸不清内部结构的黑盒, 只是向其输入接口随机地发送合法测试用例, 这些用例并不是开发者所预期的输入, 所以极有可能会造成系统的崩溃, 通过分析崩溃信息, 测试人员( 黑客) 就可以评估系统是否存在可利用的漏洞。< br > 模糊测试的过程,就好像是一个不断探测系统可以承受的输入极限的过程,让我想起学电子的时候对一个滤波器进行带宽的评估,如果我们知道内部电路原理,那么这个器件对于我们就是白盒了,可以直接通过公式计算理论带宽,现在系统对于我们而言是一个黑盒,我们通过在足够大频率范围内对其不断输入信号,就能测试出其实际带宽。< / p >
< p > < strong > 模糊测试方法一览< / strong > < / p >
2019-07-01 12:01:56 +00:00
< table >
< tr >
< th rowspan = "2" > 基于变种的Fuzzer< / th >
< th rowspan = "2" > 基于模板的Fuzzer< / th >
< th colspan = "2" > 基于反馈演进的Fuzzer< / th >
< / tr >
< tr >
< td > 基于追踪路径覆盖率< / td >
< td > 基于分支覆盖率< / td >
< / tr >
< tr >
< td rowspan = "2" > 在已知合法的输入的基础上,对该输入进行随机变种或者依据某种经验性的变种,从而产生不可预期的测试输入。< / td >
< td rowspan = "2" > 此类Fuzzer工具的输入数据, 依赖于安全人员结合自己的知识, 给出输入数据的模板, 构造丰富的输入测试数据。< / td >
< td colspan = "2" > 此类Fuzzer会实时的记录当前对于目标程序测试的覆盖程度, 从而调整自己的fuzzing输入。< / td >
< / tr >
< tr >
< td > PAP:路径编码的算法;后面会产生路径爆炸的问题< / td >
< td > 漏洞的爆发往往由于触发了非预期的分支< / td >
< / tr >
< tr >
< td > Taof, GPF, ProxyFuzz, Peach Fuzzer< / td >
< td > SPIKE, Sulley, Mu‐ 4000, Codenomicon< / td >
< td > < / td >
< td > AFL< / td >
< / tr >
< / table >
2019-07-01 09:28:12 +00:00
2019-07-01 11:52:45 +00:00
< hr >
2019-07-16 09:15:34 +00:00
< h1 id = "0x02-AFL快速入门" > < a href = "#0x02-AFL快速入门" class = "headerlink" title = "0x02 AFL快速入门" > < / a > 0x02 < a href = "http://lcamtuf.coredump.cx/afl/QuickStartGuide.txt" target = "_blank" rel = "noopener" > AFL快速入门< / a > < / h1 > < p > 1) 用< code > make< / code > 编译AFL。如果构建失败, 请参阅docs / INSTALL以获取提示。< br > 2) 查找或编写一个相当快速和简单的程序, 该程序从< strong > < em > 文件或标准输入< / em > < / strong > 中获取数据, 以一种有价值的方式处理它, 然后干净地退出。如果测试网络服务, 请将其修改为在前台运行并从stdin读取。在对使用校验和的格式进行模糊测试时, 也要注释掉校验和验证码。< br > 遇到故障时, 程序必须正常崩溃。注意自定义SIGSEGV或SIGABRT处理程序和后台进程。有关检测非崩溃缺陷的提示, 请参阅< code > docs/README< / code > 中的第11节。< br > 3) 使用afl-gcc编译要模糊的程序/库。一种常见的方法是:< br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < span class = "line" > 2< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > $ CC = /path/to/afl-gcc CXX =/path/to/afl-g++ ./configure --disable-shared< / span > < br > < span class = "line" > $ make clean all< / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
2021-01-08 08:35:03 +00:00
< p > 如果程序构建失败,请联系 < a href = "mailto:afl-users@googlegroups.com" target = "_blank" rel = "noopener" > a f l - u s e r s @ g o o g l e g r o u p s . c o m < / a > 。< br > 4) 获取一个对程序有意义的小而有效的输入文件。在模糊详细语法( SQL, HTTP等) 时, 也要创建字典, 如< code > dictionaries/README.dictionaries< / code > 中所述。< br > 5) 如果程序从stdin读取, 则运行< code > afl-fuzz< / code > ,如下所示:< br > < code > ./afl-fuzz -i testcase_dir -o findings_dir -- /path/to/tested/program [... program' s cmdline ...]< / code > < br > 如果程序从文件中获取输入,则可以在程序的命令行中输入@@; AFL会为您放置一个自动生成的文件名。< / p >
2019-07-09 09:11:34 +00:00
< p > < strong > 一些参考文档< / strong > < / p >
< blockquote >
< p > < a href = "http://lcamtuf.coredump.cx/afl/README.txt" target = "_blank" rel = "noopener" > docs/README< / a > - AFL的一般介绍, < br > < a href = "https://github.com/mirrorer/afl/blob/master/docs/perf_tips.txt" target = "_blank" rel = "noopener" > docs/perf_tips.txt< / a > - 关于如何快速模糊的简单提示,< br > < a href = "http://lcamtuf.coredump.cx/afl/status_screen.txt" target = "_blank" rel = "noopener" > docs/status_screen.txt< / a > - UI中显示的花絮的解释, < br > < a href = "https://github.com/mirrorer/afl/blob/master/docs/parallel_fuzzing.txt" target = "_blank" rel = "noopener" > docs/parallel_fuzzing.txt< / a > - 关于在多个核上运行AFL的建议< br > < a href = "http://lcamtuf.coredump.cx/afl/demo/" target = "_blank" rel = "noopener" > Generated test cases for common image formats< / a > - 生成图像文件测试用例的demo< br > < a href = "http://lcamtuf.coredump.cx/afl/technical_details.txt" target = "_blank" rel = "noopener" > Technical “whitepaper” for afl-fuzz< / a > - 技术白皮书< / p >
< / blockquote >
< p > < strong > 适用环境< / strong > < br > 该工具已确认适用于32位和64位的x86 Linux, OpenBSD, FreeBSD和NetBSD。 它也适用于MacOS X和Solaris, 但有一些限制。 它支持用C, C ++或Objective C编写的程序, 使用gcc或clang编译。 在Linux上, 可选的QEMU模式也允许对黑盒二进制文件进行模糊测试。< / p >
< p > AFL的变体和衍生物允许您模糊Python, Go, Rust, OCaml, GCJ Java, 内核系统调用, 甚至整个虚拟机。 还有一个密切启发的进程模糊器, 它在LLVM中运行, 并且是一个在Windows上运行的分支。 最后, AFL是< a href = "https://github.com/google/oss-fuzz/" target = "_blank" rel = "noopener" > OSS-Fuzz< / a > 背后的模糊引擎之一。< / p >
< p > 哦 - 如果你安装了gnuplot, 你可以使用afl-plot来获得漂亮的进度图。< / p >
< hr >
< h1 id = "0x03-AFL特点" > < a href = "#0x03-AFL特点" class = "headerlink" title = "0x03 AFL特点" > < / a > 0x03 < a href = "http://lcamtuf.coredump.cx/afl/" target = "_blank" rel = "noopener" > AFL特点< / a > < / h1 > < ol >
< li > < strong > 非常复杂< / strong > 。它是一种插桩器( instrumentation) 引导的遗传模糊器, 能够在各种非平凡的目标中< a href = "http://lcamtuf.blogspot.com/2014/11/pulling-jpegs-out-of-thin-air.html" target = "_blank" rel = "noopener" > 合成复杂的文件语义< / a > ,减少了对专用的语法识别工具的需求。它还带有一个独特的< a href = "http://lcamtuf.blogspot.com/2014/11/afl-fuzz-crash-exploration-mode.html" target = "_blank" rel = "noopener" > 崩溃浏览器< / a > ,一个< a href = "https://groups.google.com/d/msg/afl-users/eWb2PgjLnUo/8AKqadYzSBoJ" target = "_blank" rel = "noopener" > 测试用例最小化器< / a > ,一个< a href = "https://groups.google.com/forum/#!topic/afl-users/RW4RF6x9aBc" target = "_blank" rel = "noopener" > 故障触发分配器< / a > 和一个< a href = "https://lcamtuf.blogspot.com/2016/02/say-hello-to-afl-analyze.html" target = "_blank" rel = "noopener" > 语法分析器< / a > - 使评估崩溃错误的影响变得简单。< / li >
< li > < strong > 智能< / strong > 。它围绕一系列经过< a href = "http://lcamtuf.blogspot.com/2014/08/binary-fuzzing-strategies-what-works.html" target = "_blank" rel = "noopener" > 精心研究< / a > ,高增益的测试用例预处理和模糊测试策略而构建,在其他模糊测试框架中很少采用与之相当的严格性。结果,它发现了真正的< a href = "http://lcamtuf.coredump.cx/afl/#bugs" target = "_blank" rel = "noopener" > 漏洞< / a > 。< / li >
< li > < strong > 它很快< / strong > 。由于其低级编译时间或仅二进制检测和< a href = "http://lcamtuf.blogspot.com/2014/10/fuzzing-binaries-without-execve.html" target = "_blank" rel = "noopener" > 其他优化< / a > ,该工具提供了针对常见现实世界目标的近原生或优于原生的模糊测试速度。新增的< a href = "http://lcamtuf.blogspot.com/2015/06/new-in-afl-persistent-mode.html" target = "_blank" rel = "noopener" > 持久模式< / a > 允许在最少的代码修改的帮助下,对许多程序进行异常快速的模糊测试。< / li >
< li > < strong > 可以链接到其他工具< / strong > 。模糊器可以生成优质,紧凑的测试语料库,可以作为更专业,更慢或劳动密集型流程和测试框架的种子。它还能够与任何其他软件进行即时语料库同步。< / li >
< / ol >
< hr >
< h1 id = "0x04-AFL-README" > < a href = "#0x04-AFL-README" class = "headerlink" title = "0x04 AFL README" > < / a > 0x04 < a href = "http://lcamtuf.coredump.cx/afl/README.txt" target = "_blank" rel = "noopener" > AFL README< / a > < / h1 > < blockquote >
2021-01-08 08:35:03 +00:00
< p > Written and maintained by Michal Zalewski < a href = "mailto:lcamtuf@google.com" target = "_blank" rel = "noopener" > l c a m t u f @ g o o g l e . c o m < / a > < / p >
2019-07-09 09:11:34 +00:00
< p > Copyright 2013, 2014, 2015, 2016 Google Inc. All rights reserved.< br > Released under terms and conditions of Apache License, Version 2.0.< / p >
< p > For new versions and additional information, check out:< br > < a href = "http://lcamtuf.coredump.cx/afl/" target = "_blank" rel = "noopener" > http://lcamtuf.coredump.cx/afl/< / a > < / p >
2021-01-08 08:35:03 +00:00
< p > To compare notes with other users or get notified about major new features,< br > send a mail to < a href = "mailto:afl-users+subscribe@googlegroups.com" target = "_blank" rel = "noopener" > a f l - u s e r s + s u b s c r i b e @ g o o g l e g r o u p s . c o m < / a > .< / p >
2019-07-09 09:11:34 +00:00
< p > < strong > See QuickStartGuide.txt if you don’ t have time to read this file.< / strong > < / p >
< / blockquote >
< h2 id = "1) 具有导向性的模糊测试的挑战" > < a href = "#1) 具有导向性的模糊测试的挑战" class = "headerlink" title = "1) 具有导向性的模糊测试的挑战" > < / a > 1) 具有导向性的模糊测试的挑战< / h2 > < p > Fuzzing是用于识别真实软件中的安全问题的最强大且经过验证的策略之一;它负责安全关键软件中迄今为止发现的绝大多数远程代码执行和权限提升漏洞。< br > 不幸的是,模糊测试也不够有力。盲目的、随机的变异使得它不太可能在测试代码中达到某些代码路径,从而使一些漏洞超出了这种技术的范围。< br > 已经有许多尝试来解决这个问题。早期方法之一 - 由Tavis Ormandy开创 - 是一种 < strong > 语义库蒸馏( corpus distillation) < / strong > 。网上找到的一些大型语料库中往往包含大量的文件,这时就需要对其精简,该方法依赖于覆盖信号从大量高质量的候选文件语料库中选择有趣种子的子集,然后通过传统方式对其进行模糊处理。该方法非常有效,但需要这样的语料库随时可用。正因为如此,< strong > 代码覆盖率< / strong > 也只是衡量程序执行状态的一个简单化的度量, 这种方式并不适合后续引导fuzzing测试的。< br > 其他更复杂的研究集中在诸如 < strong > 程序流分析( “concoic execution”) , 符号执行或静态分析< / strong > 等技术上。所有这些方法在实验环境中都非常有前景,但在实际应用中往往会遇到可靠性和性能问题 - 部分高价值的程序都有非常复杂的内部状态和执行路径, 在这一方面符号执行和concolic技术往往会显得不够健壮( 如路径爆炸问题) , 所以仍然稍逊于传统的fuzzing技术。< / p >
< h2 id = "2) afl-fuzz方法" > < a href = "#2) afl-fuzz方法" class = "headerlink" title = "2) afl-fuzz方法" > < / a > 2) afl-fuzz方法< / h2 > < p > American Fuzzy Lop是一种暴力模糊测试, 配有极其简单但坚如磐石的 < strong > 引导遗传算法< / strong > 。它使用修改后的边覆盖率,轻松地获取程序控制流程的细微局部变化。< br > 简化一下,整体算法可以概括为:< / p >
2019-07-01 09:28:12 +00:00
< ul >
2019-07-09 09:11:34 +00:00
< li > 1) 将用户提供的初始测试用例加载到队列中, < / li >
< li > 2) 从队列中获取下一个输入文件, < / li >
< li > 3) 尝试将测试用例修剪到不会改变程序测量行为的最小尺寸, < / li >
< li > 4) 使用平衡且经过充分研究的各种传统模糊测试策略反复改变文件, < / li >
< li > 5) 如果任何生成的编译导致由instrumentation记录的新状态转换, 则将变异输出添加为队列中的新条目。< / li >
2019-07-09 09:27:51 +00:00
< li > 6) 转到2。< / li >
2019-07-01 09:28:12 +00:00
< / ul >
2019-07-09 09:27:51 +00:00
< p > < img src = "https://image.3001.net/images/20181207/1544168163_5c0a22e3eedce.jpg" width = "60%" div align = "center/" > < / p >
< p > 发现的测试用例也会定期被淘汰, 以消除那些被更新, 更高覆盖率的发现所淘汰的测试用例。并经历其他几个插桩驱动( instrumentation-driven) 的努力最小化步骤。< br > 作为模糊测试过程的一个副作用,该工具创建了一个小型,独立的有趣测试用例集。这些对于播种其他劳动力或资源密集型测试方案非常有用 - 例如,用于压力测试浏览器,办公应用程序,图形套件或闭源工具。< br > 该模糊器经过全面测试,可提供远远优于盲目模糊或仅覆盖工具的开箱即用性能。< / p >
2019-07-09 09:11:34 +00:00
< h2 id = "3) 用于AFL的插桩( instrumentation) 程序" > < a href = "#3) 用于AFL的插桩( instrumentation) 程序" class = "headerlink" title = "3) 用于AFL的插桩( instrumentation) 程序" > < / a > 3) 用于AFL的插桩( instrumentation) 程序< / h2 > < p > 当源代码可用时,可以通过配套工具 < strong > 注入instrumentation< / strong > , 该工具可作为第三方代码的任何标准构建过程中gcc或clang的替代品。< br > instrumentation具有相当适度的性能影响;与afl-fuzz实现的其他优化相结合, 大多数程序可以像传统工具一样快速或甚至更快地进行模糊测试。< / p >
2019-07-16 09:15:34 +00:00
< p > < strong > 重新编译目标程序< / strong > 的正确方法可能会有所不同,具体取决于构建过程的具体情况,但几乎通用的方法是:< br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < span class = "line" > 2< / span > < br > < span class = "line" > 3< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > $ CC = /path/to/afl/afl-gcc ./configure< / span > < br > < span class = "line" > $ make clean all< / span > < br > < span class = "line" > 对于C ++程序, 您还需要将CXX = / path /设置为/ afl / afl g ++。< / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
2019-07-09 09:11:34 +00:00
< p > clang组件( afl-clang和afl-clang ++)可以以相同的方式使用; clang用户也可以选择利用更高性能的检测模式, 如llvm_mode / README.llvm中所述。< / p >
2019-07-16 09:15:34 +00:00
< p > 在测试库时, 您需要查找或编写一个简单的程序, 该程序从stdin或文件中读取数据并将其传递给测试的库。在这种情况下, 必须 < strong > 将此可执行文件与已检测库的静态版本相链接< / strong > ,或者确保在运行时加载正确的.so文件( 通常通过设置LD_LIBRARY_PATH) 。最简单的选项是 < strong > 静态构建< / strong > ,通常可以通过以下方式实现:< br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > $ CC = /path/to/afl/afl-gcc ./configure --disable-shared< / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
2019-07-09 09:11:34 +00:00
< p > 调用< code > make< / code > 时设置AFL_HARDEN = 1将导致CC组件自动启用代码强化选项, 以便更容易检测到简单的内存错误。 Libdislocator, AFL附带的帮助程序库( 请参阅libdislocator / README.dislocator) 也可以帮助发现堆损坏问题。< br > PS。建议ASAN用户查看notes_for_asan.txt文件以获取重要警告。< / p >
2019-07-16 09:15:34 +00:00
< h2 id = "4) 检测仅二进制应用程序" > < a href = "#4) 检测仅二进制应用程序" class = "headerlink" title = "4) 检测仅二进制应用程序" > < / a > 4) 检测仅二进制应用程序< / h2 > < p > 当源代码为不可得时, afl为黑盒二进制文件的快速、即时检测提供实验支持。 这是通过在较不为人知的“用户空间仿真”模式下运行的QEMU版本来实现的。< br > QEMU是一个独立于AFL的项目, 但您可以通过以下方式方便地构建该功能: < br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < span class = "line" > 2< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > $ cd qemu_mode< / span > < br > < span class = "line" > $ ./build_qemu_support.sh< / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
2019-07-09 09:11:34 +00:00
< p > 有关其他说明和注意事项, 请参阅qemu_mode / README.qemu。< br > 该模式比编译时插桩( instrumentation) 慢约2-5倍, 对并行化的兼容较差, 并且可能有一些其他的不同。< / p >
< h2 id = "5) 选择初始测试用例" > < a href = "#5) 选择初始测试用例" class = "headerlink" title = "5) 选择初始测试用例" > < / a > 5) 选择初始测试用例< / h2 > < p > 为了正确操作,模糊器需要一个或多个起始文件,其中包含目标应用程序通常所需的输入数据的良好示例。 有两个基本规则:< / p >
< blockquote >
< p > 测试用例足够小。 1 kB以下是理想的, 尽管不是绝对必要的。 有关大小重要性的讨论, 请参阅perf_tips.txt。< / p >
< p > 只有在功能上彼此不同时才使用多个测试用例。 使用五十张不同的度假照片来模糊图像库是没有意义的。< br > 您可以在此工具附带的< code > testcases/子目录< / code > 中找到许多启动文件的好例子。< br > PS。 如果有大量数据可用于筛选,您可能希望使用< code > afl-cmin< / code > 实用程序来识别在目标二进制文件中使用不同代码路径的功能不同的文件的子集。< / p >
< / blockquote >
2019-07-16 09:15:34 +00:00
< h2 id = "6) 模糊测试二进制文件" > < a href = "#6) 模糊测试二进制文件" class = "headerlink" title = "6) 模糊测试二进制文件" > < / a > 6) 模糊测试二进制文件< / h2 > < p > 测试过程本身由afl-fuzz实用程序执行。该程序需要一个带有初始测试用例的只读目录, 一个存储其输出结果的独立位置, 以及要测试的二进制文件的路径。< br > 对于直接从 < strong > stdin< / strong > 接受输入的目标二进制文件,通常的语法是:< br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > $ ./afl-fuzz -i testcase_dir -o findings_dir /path/to/program [... params ...]< / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
< p > 对于从 < strong > 文件< / strong > 中获取输入的程序,使用“@@”标记目标命令行中应放置输入文件名的位置。模糊器将替换为您:< br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > $ ./afl-fuzz -i testcase_dir -o findings_dir /path/to/program @@< / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
2019-07-09 09:11:34 +00:00
< p > 您还可以使用-f选项将变异数据写入特定文件。如果程序需要特定的文件扩展名, 那么这很有用。< br > 非插桩二进制文件可以在QEMU模式下( 在命令行中添加-Q) 或在传统的盲目模糊模式( 指定-n) 中进行模糊测试。< br > 您可以使用-t和-m覆盖已执行进程的默认超时和内存限制;< br > perf_tips.txt中讨论了优化模糊测试性能的技巧。< / p >
< p > 请注意, afl-fuzz首先执行一系列确定性模糊测试步骤, 这可能需要几天时间, 但往往会产生整齐的测试用例。如果你想要快速结果 - 类似于zzuf和其他传统的模糊器 - 在命令行中添加-d选项。< / p >
< h2 id = "7) 解释输出" > < a href = "#7) 解释输出" class = "headerlink" title = "7) 解释输出" > < / a > 7) 解释输出< / h2 > < p > 有关如何解释显示的统计信息以及监视进程运行状况的信息,请参阅< code > status_screen.txt< / code > 文件。请务必查阅此文件, 尤其是如果任何UI元素以红色突出显示。< br > 模糊过程将持续到按< code > Ctrl-C< / code > 为止。至少,您希望允许模糊器完成一个队列周期,这可能需要几个小时到一周左右的时间。< br > 在输出目录中创建了三个子目录并实时更新:< / p >
< ul >
< li > 队列queue/ - 测试每个独特执行路径的案例, 以及用户提供的所有起始文件。这是第2节中提到的合成语料库。在将此语料库用于任何其他目的之前, 您可以使用afl-cmin工具将其缩小到较小的大小。该工具将找到一个较小的文件子集, 提供相同的边缘覆盖。< / li >
< li > 崩溃crash/ - 导致被测程序接收致命信号的独特测试用例( 例如, SIGSEGV, SIGILL, SIGABRT) 。条目按接收信号分组。< / li >
< li > 挂起hang/ - 导致测试程序超时的独特测试用例。将某些内容归类为挂起之前的默认时间限制是1秒内的较大值和-t参数的值。可以通过设置AFL_HANG_TMOUT来微调该值, 但这很少是必需的。崩溃和挂起被视为“唯一” “如果相关的执行路径涉及在先前记录的故障中未见的任何状态转换。如果可以通过多种方式达到单个错误,那么在此过程中会有一些计数通货膨胀,但这应该会迅速逐渐减少。< / li >
< / ul >
2019-07-16 09:15:34 +00:00
< p > 崩溃和挂起的文件名与父、非错误的队列条目相关联。这应该有助于调试。< br > 如果无法重现 < strong > afl-fuzz< / strong > 发现的崩溃,最可能的原因是您没有设置与工具使用的内存限制相同的内存限制。尝试:< br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < span class = "line" > 2< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > $ LIMIT_MB = 50< / span > < br > < span class = "line" > $( ulimit -Sv $ [LIMIT_MB < < 10]; /path/to/tested_binary ...) < / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
2019-07-09 09:11:34 +00:00
< p > 更改LIMIT_MB以匹配传递给afl-fuzz的-m参数。在OpenBSD上, 也将-Sv更改为-Sd。任何现有的输出目录也可用于恢复中止的作业;< br > 尝试:< code > $ ./afl-fuzz -i-o_ existing_output_dir [...etc...]< / code > < br > 如果安装了gnuplot, 您还可以使用afl-plot为任何活动的模糊测试任务生成一些漂亮的图形。有关如何显示的示例, 请参阅 < a href = "http://lcamt uf.coredump.cx/afl/plot/" target = "_blank" rel = "noopener" > http://lcamt uf.coredump.cx/afl/plot/< / a > 。< / p >
< h2 id = "8) 并行模糊测试" > < a href = "#8) 并行模糊测试" class = "headerlink" title = "8) 并行模糊测试" > < / a > 8) 并行模糊测试< / h2 > < p > 每个afl-fuzz的实例大约占用一个核。 这意味着在多核系统上,并行化是充分利用硬件所必需的。< br > 有关如何在多个核心或多个联网计算机上模糊常见目标的提示,请参阅< code > parallel_fuzzing.txt< / code > 。< br > < strong > < em > 并行模糊测试模式< / em > < / strong > 还提供了一种简单的方法, 用于将AFL连接到其他模糊器, 动态符号执行( concrete and symbolic, concolic execution) 引擎等等; 再次,请参阅 < code > parallel_fuzzing.txt< / code > 的最后一节以获取提示。< / p >
< h2 id = "9) Fuzzer词典" > < a href = "#9) Fuzzer词典" class = "headerlink" title = "9) Fuzzer词典" > < / a > 9) Fuzzer词典< / h2 > < p > 默认情况下, afl-fuzz变异引擎针对紧凑数据格式进行了优化 - 例如, 图像, 多媒体, 压缩数据, 正则表达式语法或shell脚本。它有点不太适合具有特别冗长和冗余的语言的语言 - 特别是包括HTML, SQL或JavaScript。< br > 为了避免构建语法感知工具的麻烦, afl-fuzz提供了一种方法, 使用与目标数据类型相关联的其他特殊标记的语言关键字, 魔术头或可选字典为模糊测试过程设定种子, 并使用它来重建底层随时随地的语法: < a href = "http://lcamt uf.blogspot.com/2015/01/afl-fuzz-making-up-grammar-with.html" target = "_blank" rel = "noopener" > http://lcamt uf.blogspot.com/2015/01/afl-fuzz-making-up-grammar-with.html< / a > < br > 要使用此功能,首先需要使用< code > dictionaries/README.dictionaries< / code > 中讨论的两种格式之一创建字典;然后通过命令行中的-x选项将模糊器指向它。( 该子目录中也已提供了几个常用字典。) < br > 没有办法提供基础语法的更多结构化描述, 但模糊器可能会根据instrumentation反馈单独找出一些。这实际上在实践中有效, 比如说: < br > < a href = "http://lcamt uf.blogspot.com/2015/04/finding-bugs-in-sqlite-easy-way.html" target = "_blank" rel = "noopener" > http://lcamt uf.blogspot.com/2015/04/finding-bugs-in-sqlite-easy-way.html< / a > < br > PS。即使没有给出明确的字典, afl-fuzz也会尝试通过在确定性字节翻转期间非常接近地观察instrumentation来提取输入语料库中的现有语法标记。这适用于某些类型的解析器和语法, 但不如-x模式好。< br > 如果字典真的很难找到, 另一个选择是让AFL运行一段时间, 然后使用作为AFL伴随实用程序的令牌捕获库。为此, 请参阅< code > libtokencap/README.tokencap< / code > 。< / p >
< h2 id = "10) 崩溃分类" > < a href = "#10) 崩溃分类" class = "headerlink" title = "10) 崩溃分类" > < / a > 10) 崩溃分类< / h2 > < p > 基于coverage的崩溃分组通常会生成一个小型数据集, 可以手动或使用非常简单的GDB或Valgrind脚本快速进行分类。每次崩溃都可以追溯到队列中的父级非崩溃测试用例, 从而更容易诊断故障。< br > 话虽如此, 重要的是要承认, 如果没有大量的调试和代码分析工作, 一些模糊的崩溃很难快速评估可利用性。为了帮助完成这项任务, afl-fuzz支持使用-C标志启用的非常独特的“崩溃探索”模式。< br > 在此模式下,模糊器将一个或多个崩溃测试用例作为输入,并使用其反馈驱动的模糊测试策略,非常快速地枚举程序中可以达到的所有代码路径,同时使其保持在崩溃状态。< br > < strong > < em > 不会导致崩溃的变异会被拒绝;任何不影响执行路径的更改也是如此。< / em > < / strong > < br > 输出是一个小文件集,可以非常快速地检查以查看攻击者对错误地址的控制程度,或者是否有可能超过初始越界读取,并查看下面的内容。< / p >
< p > 哦,还有一件事:对于测试用例最小化,请尝试< code > afl-tmin< / code > 。该工具可以以非常简单的方式操作:< br > < code > $ ./afl-tmin -i test_case -o minimize_result - /path/to/program [...]< / code > < / p >
< p > 该工具适用于崩溃和非崩溃的测试用例。在崩溃模式下,它将很乐意接受 instrumented 和 non-instrumented 的二进制文件。在非崩溃模式下, 最小化器依赖于标准AFL检测来使文件更简单而不改变执行路径。minimizer与afl-fuzz兼容的方式接受-m, -t, -f和@@语法。如果指定了参数-x, 即crash mode, 会把导致程序非正常退出的文件直接剔除。< / p >
< p > AFL的另一个新成员是afl-analyze工具。需要输入文件, 尝试按顺序翻转字节, 并观察测试程序的行为。然后根据哪些部分看起来是关键的, 哪些部分不是关键的, 对输入进行颜色编码;虽然不是万能,但它通常可以提供对复杂文件格式的快速见解。有关其操作的更多信息可以在< code > technical_details.txt< / code > 的末尾找到。< / p >
< h2 id = "11) 超越崩溃" > < a href = "#11) 超越崩溃" class = "headerlink" title = "11) 超越崩溃" > < / a > 11) 超越崩溃< / h2 > < p > 模糊测试是一种很好的, 未充分利用的技术, 用于发现非崩溃的设计和实现错误。通过修改目标程序调用abort()时发现了一些有趣的错误,比如:< / p >
< ul >
< li > 当给出相同的模糊输入时, 两个bignum库产生不同的输出, < / li >
< li > 当要求连续多次解码相同的输入图像时,图像库会产生不同的输出,< / li >
< li > 在对模糊提供的数据进行迭代序列化和反序列化时,序列化/反序列化库无法生成稳定的输出,< / li >
< li > 当要求压缩然后解压缩特定blob时, 压缩库会生成与输入文件不一致的输出。实施这些或类似的健全性检查通常只需要很少的时间;如果你是特定包的维护者,你可以使用#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION( 一个也与libfuzzer共享的标志) 或#ifdef __AFL_COMPILER( 这个只适用于AFL) 来使这个代码成为条件。< / li >
< / ul >
< h2 id = "12) 常识性风险" > < a href = "#12) 常识性风险" class = "headerlink" title = "12) 常识性风险" > < / a > 12) 常识性风险< / h2 > < p > 请记住,与许多其他计算密集型任务类似,模糊测试可能会给您的硬件和操作系统带来压力。特别是:< / p >
< ul >
< li > 你的CPU会很热, 需要充分冷却。在大多数情况下, 如果冷却不足或停止正常工作, CPU速度将自动受到限制。也就是说, 尤其是在不太合适的硬件( 笔记本电脑, 智能手机等) 上进行模糊测试时, 某些事情并非完全不可能爆发。< / li >
< li > 有针对性的程序可能最终不正常地抓取千兆字节的内存或用垃圾文件填满磁盘空间。 AFL试图强制执行基本的内存限制, 但不能阻止每一个可能的事故。最重要的是, 您不应该对数据丢失前景不可接受的系统进行模糊测试。< / li >
< li > 模糊测试涉及数十亿次对文件系统的读写操作。在现代系统中, 这通常会被高度缓存, 导致相当适度的“物理”I/O - 但是有许多因素可能会改变这个等式。您有责任监控潜在的问题; I / O非常繁重, 许多HDD和SSD的使用寿命可能会缩短。监视Linux上磁盘I/O的一种好方法是’ iostat’ 命令: < code > $ iostat -d 3 -x -k [...可选磁盘ID ...]< / code > < / li >
< / ul >
< h2 id = "13) 已知的限制和需要改进的领域" > < a href = "#13) 已知的限制和需要改进的领域" class = "headerlink" title = "13) 已知的限制和需要改进的领域" > < / a > < strong > 13) 已知的限制和需要改进的领域< / strong > < / h2 > < p > 以下是AFL的一些最重要的警告: < / p >
< ul >
< li > AFL通过检查由于信号( SIGSEGV, SIGABRT等) 而导致的第一个衍生过程死亡来检测故障。为这些信号安装自定义处理程序的程序可能需要注释掉相关代码。同样, 由模糊目标产生的子处理中的故障可能会逃避检测, 除非您手动添加一些代码来捕获它。< / li >
< li > 与任何其他强力工具一样, 如果使用加密, 校验和, 加密签名或压缩来完全包装要测试的实际数据格式, 则模糊器提供有限的覆盖范围。要解决这个问题, 你可以注释掉相关的检查( 参见experimental / libpng_no_checksum /获取灵感);如果这是不可能的, 你也可以编写一个后处理器, 如experimental / post_library /中所述。< / li >
< li > ASAN和64位二进制文 件存在一些不幸的权衡。这不是因为任何特定的模糊错误;请参阅notes_for_asan.txt以获取提示。< / li >
< li > 没有直接支持模糊网络服务, 后台守护程序或需要UI交互才能工作的交互式应用程序。您可能需要进行简单的代码更改, 以使它们以更传统的方式运行。 Preeny也可以提供一个相对简单的选项 - 请参阅:< a href = "https://github.com/zardus/preeny" target = "_blank" rel = "noopener" > https://github.com/zardus/preeny< / a > < br > 有关修改基于网络的服务的一些有用提示也可以在以下位置找到:< br > < a href = "https://www.fastly.com/blog/how-to-fuzz-server-american-fuzzy-lop" target = "_blank" rel = "noopener" > https://www.fastly.com/blog/how-to-fuzz-server-american-fuzzy-lop< / a > < / li >
< li > AFL不输出人类可读的覆盖数据。如果你想监控覆盖, 请使用Michael Rash的afl-cov: https: //github.com/mrash/afl-cov< / li >
< li > 偶尔,敏感的机器会对抗他们的创造者。如果您遇到这种情况,请访问< a href = "http://lcamt uf.coredump.cx/prep/。除此之外,请参阅安装以获取特定于平台的提示。" target = "_blank" rel = "noopener" > http://lcamt uf.coredump.cx/prep/。除此之外,请参阅安装以获取特定于平台的提示。< / a > < / li >
< / ul >
< hr >
< h1 id = "0x05-afl-fuzz白皮书" > < a href = "#0x05-afl-fuzz白皮书" class = "headerlink" title = "0x05 afl-fuzz白皮书" > < / a > 0x05 < a href = "http://lcamtuf.coredump.cx/afl/technical_details.txt" target = "_blank" rel = "noopener" > afl-fuzz白皮书< / a > < / h1 > < p > 本文档提供了American Fuzzy Lop的简单的概述。想了解一般的使用说明, 请参见 < code > README< / code > 。想了解AFL背后的动机和设计目标, 请参见 < a href = "http://lcamtuf.coredump.cx/afl/historical_notes.txt" target = "_blank" rel = "noopener" > historical_notes.txt< / a > 。< / p >
< h2 id = "0) 设计说明-Design-statement" > < a href = "#0) 设计说明-Design-statement" class = "headerlink" title = "0) 设计说明(Design statement)" > < / a > 0) 设计说明(Design statement)< / h2 > < p > American Fuzzy Lop 不关注任何单一的操作规则(singular principle of operation),也不是一个针对任何特定理论的概念验证(proof of concept)。这个工具可以被认为是一系列在实践中测试过的hacks行为, 我们发现这个工具惊人的有效。我们用目前最simple且最robust的方法实现了这个工具。< br > 唯一的设计宗旨在于速度、可靠性和易用性。< / p >
< h2 id = "1) 覆盖率计算-Coverage-measurements" > < a href = "#1) 覆盖率计算-Coverage-measurements" class = "headerlink" title = "1) 覆盖率计算(Coverage measurements)" > < / a > 1) 覆盖率计算(Coverage measurements)< / h2 > < p > 在编译过的程序中插桩能够捕获分支(边缘)的覆盖率,并且还能检测到粗略的分支执行命中次数(branch-taken hit counts)。在分支点注入的代码大致如下:< / p >
2019-07-16 09:15:34 +00:00
< figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < span class = "line" > 2< / span > < br > < span class = "line" > 3< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > cur_location = < COMPILE_TIME_RANDOM> ; //用一个随机数标记当前基本块< / span > < br > < span class = "line" > shared_mem[cur_location ^ prev_location]++; //将当前块和前一块异或保存到shared_mem[]< / span > < br > < span class = "line" > prev_location = cur_location > > 1; //cur_location右移1位区分从当前块到当前块的转跳< / span > < br > < / pre > < / td > < / tr > < / table > < / figure >
2019-07-09 09:11:34 +00:00
< p > cur_location 的值是随机产生的, 为的是简化连接复杂对象的过程和保持XOR输出分布是均匀的。< br > shared_mem[] 数组是一个调用者 (caller) 传给被插桩的二进制程序的64kB的共享空间。其中的每一字节可以理解成对于插桩代码中特别的元组(branch_src, branch_dst)的一次命中( hit) 。< br > 选择这个数组大小的原因是让冲突(collisions)尽可能减少。这样通常能处理2k到10k的分支点。同时, 它的大小也足以使输出图能在接受端达到毫秒级的分析。< / p >
< table >
< thead >
< tr >
< th > Branch cnt< / th >
< th > Colliding tuples< / th >
< th > Example targets< / th >
< / tr >
< / thead >
< tbody >
< tr >
< td > 1,000< / td >
< td > 0.75%< / td >
< td > giflib, lzo< / td >
< / tr >
< tr >
< td > 2,000< / td >
< td > 1.5%< / td >
< td > zlib, tar, xz< / td >
< / tr >
< tr >
< td > 5,000< / td >
< td > 3.5%< / td >
< td > libpng, libwebp< / td >
< / tr >
< tr >
< td > 10,000< / td >
< td > 7%< / td >
< td > libxml< / td >
< / tr >
< tr >
< td > 20,000< / td >
< td > 14%< / td >
< td > sqlite< / td >
< / tr >
< tr >
< td > 50,000< / td >
< td > 30%< / td >
< td > -< / td >
< / tr >
< / tbody >
< / table >
< p > 这种形式的覆盖率,相对于简单的基本块覆盖率来说,对程序运行路径提供了一个更好的描述(insight)。特别地,它能很好地区分以下两个执行路径:< / p >
< blockquote >
< p > A -> B -> C -> D -> E (tuples: AB, BC, CD, DE)< br > A -> B -> D -> C -> E (tuples: AB, BD, DC, CE)< / p >
< / blockquote >
< p > 这有助于发现底层代码的微小错误条件。因为 < strong > 安全漏洞通常是一些非预期(或不正确)的语句转移(一个tuple就是一个语句转移)< / strong > ,而不是没覆盖到某块代码。< br > 上边伪代码的最后一行移位操作是为了让tuple具有定向性(没有这一行的话, A^B和B^A就没区别了, 同样, A^A和B^B也没区别了)。采用右移的原因跟Intel CPU的一些特性有关。< / p >
2019-07-16 09:15:34 +00:00
< h2 id = "2) 发现新路径-Detecting-new-behaviors" > < a href = "#2) 发现新路径-Detecting-new-behaviors" class = "headerlink" title = "2) 发现新路径(Detecting new behaviors)" > < / a > 2) 发现新路径(Detecting new behaviors)< / h2 > < p > AFL的fuzzers使用一个< strong > 全局Map< / strong > 来存储之前执行时看到的tuple。这些数据可以被用来对不同的trace进行快速对比, 从而可以计算出是否新执行了一个dword指令/一个qword-wide指令/一个简单的循环。< br > 当一个变异的输入产生了一个包含新tuple的执行路径时, 对应的输入文件就被保存, 然后被发送到下一过程(见第3部分)。对于那些没有产生新路径的输入, 就算他们的instrumentation输出模式是不同的, 也会被抛弃掉。< br > 这种算法考虑了一个非常细粒度的、长期的对程序状态的探索,同时它还不必执行复杂的计算,不必对整个复杂的执行流进行对比,也避免了路径爆炸的影响。< br > 为了说明这个算法是怎么工作的, 考虑下面的两个路径, 第二个路径出现了新的tuples(CA, AE):< br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < span class = "line" > 2< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > #1: A -> B -> C -> D -> E< / span > < br > < span class = "line" > #2: A -> B -> C -> A -> E< / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
2019-07-09 09:11:34 +00:00
< p > 因为#2的原因, 以下的路径就不认为是不同的路径了, 尽管看起来非常不同: < br > < code > #3: A -> B -> C -> A -> B -> C -> A -> B -> C -> D -> E< / code > < / p >
< p > 除了检测新的tuple之外, AFL的fuzzer也会粗略地记录tuple的< strong > 命中数(hit counts)< / strong > 。这些被分割成几个buckets: 1, 2, 3, 4-7, 8-15, 16-31, 32-127, 128+< / p >
< p > 从某种意义来说, buckets里边的数目是有实际意义的: 它是一个8-bit counter和一个8-position bitmap的映射。8-bit counter是由桩生成的, 8-position bitmap则依赖于每个fuzzer记录的已执行的tuple的命中数。< br > 单个bucket的改变会被忽略掉: 在程序控制流中, bucket的转换会被标记成一个interesting change, 传入evolutionary(见第三部分)进行处理。< br > 通过命中次数(hit count),我们能够分辨控制流是否发生变化。例如一个代码块被执行了两次,但只命中了一次。并且这种方法对循环的次数不敏感(循环47次和48次没区别)。< br > 这种算法通过限制内存和运行时间来保证效率。< / p >
< p > 另外, 算法通过设置执行超时, 来避免效率过低的fuzz。从而进一步发现效率比较高的fuzz方式。< / p >
2019-07-09 09:27:51 +00:00
< h2 id = "3) 输入队列的进化-Evolving-the-input-queue" > < a href = "#3) 输入队列的进化-Evolving-the-input-queue" class = "headerlink" title = "3) 输入队列的进化(Evolving the input queue)" > < / a > 3) 输入队列的进化(Evolving the input queue)< / h2 > < p > 经变异的测试用例,会使程序产生 < strong > < em > 新的状态转移< / em > < / strong > 。这些测试用例稍后被添加到 input 队列中,用作下一个 fuzz 循环。它们补充但不替换现有的发现。< br > 这种算法允许工具可以持续探索不同的代码路径,即使底层的数据格式可能是完全不同的。如下图:< br > < img src = "http://lcamtuf.coredump.cx/afl/afl_gzip.png" width = "60%" div align = "center/" > < / p >
2019-07-09 09:11:34 +00:00
< p > 这里有一些这种算法在实际情况下例子:< / p >
< p > < a href = "https://lcamtuf.blogspot.com/2014/11/pulling-jpegs-out-of-thin-air.html" target = "_blank" rel = "noopener" > pulling-jpegs-out-of-thin-air< / a > < / p >
< p > < a href = "http://lcamtuf.blogspot.com/2014/11/afl-fuzz-nobody-expects-cdata-sections.html" target = "_blank" rel = "noopener" > afl-fuzz-nobody-expects-cdata-sections< / a > < / p >
< p > 这种过程下产生的语料库基本上是这些输入文件的集合:它们都能触发一些新的执行路径。产生的语料库,可以被用来作为其他测试的种子。< br > 使用这种方法, 大多数目标程序的队列会增加到大概1k到10k个entry。大约有10-30%归功于对新tupe的发现, 剩下的和hit counts改变有关。< br > 下表比较了不同 fuzzing 方法在发现文件句法(file syntax)和探索程序执行路径的能力。插桩的目标程序是 < code > GNU patch 2.7.3 compiled with -O3 and seeded with a dummy text file:< / code > < / p >
< table >
< thead >
< tr >
< th > Fuzzer guidance strategy used< / th >
< th > Blocks reached< / th >
< th > Edges reached< / th >
< th > Edge hit cnt var< / th >
< th > Highest-coverage test case generated< / th >
< / tr >
< / thead >
< tbody >
< tr >
< td > (Initial file)< / td >
< td > 156< / td >
< td > 163< / td >
< td > 1.00< / td >
< td > (none)< / td >
< / tr >
< tr >
< td > Blind fuzzing S< / td >
< td > 182< / td >
< td > 205< / td >
< td > 2.23< / td >
< td > First 2 B of RCS diff< / td >
< / tr >
< tr >
< td > Blind fuzzing L< / td >
< td > 228< / td >
< td > 265< / td >
< td > 2.23< / td >
< td > First 4 B of -c mode diff< / td >
< / tr >
< tr >
< td > Block coverage< / td >
< td > 855< / td >
< td > 1,130< / td >
< td > 1.57< / td >
< td > Almost-valid RCS diff< / td >
< / tr >
< tr >
< td > Edge coverage< / td >
< td > 1,452< / td >
< td > 2,070< / td >
< td > 2.18< / td >
< td > One-chunk -c mode diff< / td >
< / tr >
< tr >
< td > AFL model< / td >
< td > 1,765< / td >
< td > 2,597< / td >
< td > 4.99< / td >
< td > Four-chunk -c mode diff< / td >
< / tr >
< / tbody >
< / table >
< p > 第一行的blind fuzzing (“S”)代表仅仅执行了一个回合的测试。< br > 第二行的Blind fuzzing L表示在一个循环中执行了几个回合的测试, 但是没有进行改进。和插桩运行相比, 需要更多时间全面处理增长队列。< / p >
< p > 在另一个独立的实验中也取得了大致相似的结果。在新实验中, fuzzer被修改成所有随机fuzzing 策略,只留下一系列基本、连续的操作,例如位反转(bit flips)。因为这种模式( mode) 将不能改变输入文件的的大小, 会话使用一个合法的合并格式( unified diff) 作为种子。< / p >
< table >
< thead >
< tr >
< th > Queue extension strategy used< / th >
< th > Blocks reached< / th >
< th > Edges reached< / th >
< th > Edge hit cnt var< / th >
< th > Number of unique crashes found< / th >
< / tr >
< / thead >
< tbody >
< tr >
< td > (Initial file)< / td >
< td > 624< / td >
< td > 717< / td >
< td > 1.00< / td >
< td > -< / td >
< / tr >
< tr >
< td > Blind fuzzing< / td >
< td > 1,101< / td >
< td > 1,409< / td >
< td > 1.60< / td >
< td > 0< / td >
< / tr >
< tr >
< td > Block coverage< / td >
< td > 1,255< / td >
< td > 1,649< / td >
< td > 1.48< / td >
< td > 0< / td >
< / tr >
< tr >
< td > Edge coverage< / td >
< td > 1,259< / td >
< td > 1,734< / td >
< td > 1.72< / td >
< td > 0< / td >
< / tr >
< tr >
< td > AFL model< / td >
< td > 1,452< / td >
< td > 2,040< / td >
< td > 3.16< / td >
< td > 1< / td >
< / tr >
< / tbody >
< / table >
< p > 在之前提到的基于遗传算法的fuzzing, 是通过一个test case的进化(这里指的是用遗传算法进行变异)来实现最大覆盖。在上述实验看来,这种“贪婪”的方法似乎没有为盲目的模糊策略带来实质性的好处。< / p >
< h2 id = "4) 语料筛选( Culling-the-corpus) " > < a href = "#4) 语料筛选( Culling-the-corpus) " class = "headerlink" title = "4) 语料筛选( Culling the corpus) " > < / a > 4) 语料筛选( Culling the corpus) < / h2 > < p > 上文提到的渐进式语句探索路径的方法意味着: 假设A和B是测试用例(test cases), 且B是由A变异产生的。那么测试用例B达到的边缘覆盖率(edge coverage)是测试用例A达到的边缘覆盖率的严格超集(superset)。< br > 为了优化fuzzing, AFL会用一个快速算法< strong > 周期性的重新评估< / strong > (re-evaluates)队列, 这种算法会选择队列的一个更小的子集, 并且这个子集仍能覆盖所有的tuple。算法的这个特性对这个工具特别有利(favorable)。< br > 算法通过指定每一个队列入口(queue entry), 根据执行时延( execution latency) 和文件大小分配一个分值比例( score proportional) 。然后为每一个tuple选择< strong > 最低分值的entry< / strong > 。< br > 这些tuples按下述流程进行处理: < / p >
2019-07-16 09:15:34 +00:00
< figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < span class = "line" > 2< / span > < br > < span class = "line" > 3< / span > < br > < span class = "line" > 4< / span > < br > < span class = "line" > 5< / span > < br > < span class = "line" > 6< / span > < br > < span class = "line" > 7< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > 1) Find next tuple not yet in the temporary working set,< / span > < br > < span class = "line" > < / span > < br > < span class = "line" > 2) Locate the winning queue entry for this tuple,< / span > < br > < span class = "line" > < / span > < br > < span class = "line" > 3) Register *all* tuples present in that entry' s trace in the working set,< / span > < br > < span class = "line" > < / span > < br > < span class = "line" > 4) Go to #1 if there are any missing tuples in the set.< / span > < br > < / pre > < / td > < / tr > < / table > < / figure >
< p > “favored” entries 产生的语料, 会比初始的数据集小5到10倍。没有被选择的也没有被扔掉, 而是在遇到下列对队列时, 以一定概率略过: < br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < span class = "line" > 2< / span > < br > < span class = "line" > 3< / span > < br > < span class = "line" > 4< / span > < br > < span class = "line" > 5< / span > < br > < span class = "line" > 6< / span > < br > < span class = "line" > 7< / span > < br > < span class = "line" > 8< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > - If there are new, yet-to-be-fuzzed favorites present in the queue,< / span > < br > < span class = "line" > 99% of non-favored entries will be skipped to get to the favored ones.< / span > < br > < span class = "line" > < / span > < br > < span class = "line" > - If there are no new favorites:< / span > < br > < span class = "line" > < / span > < br > < span class = "line" > - If the current non-favored entry was fuzzed before, it will be skipped 95% of the time.< / span > < br > < span class = "line" > < / span > < br > < span class = "line" > - If it hasn' t gone through any fuzzing rounds yet, the odds of skipping drop down to 75%.< / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
2019-07-09 09:11:34 +00:00
< p > 基于以往的实验经验,这种方法能够在队列周期速度(queue cycling speed)和测试用例多样性(test case diversity)之间达到一个合理的平衡。< br > 使用< strong > afl-cmin工具< / strong > 能够对输入或输出的语料库进行稍微复杂但慢得多的的处理。这一工具将永久丢弃冗余entries, 产生适用于afl-fuzz或者外部工具的更小的语料库。< / p >
< h2 id = "5) 输入文件修剪( Trimming-input-files) " > < a href = "#5) 输入文件修剪( Trimming-input-files) " class = "headerlink" title = "5) 输入文件修剪( Trimming input files) " > < / a > 5) 输入文件修剪( Trimming input files) < / h2 > < p > 文件的大小对fuzzing的性能有着重大影响(dramatic impact)。因为大文件会让目标二进制文件运行变慢;大文件还会减少变异触及重要格式控制结构(format control structures)的可能性(< strong > 我们希望的是变异要触及冗余代码块(redundant data blocks)< / strong > )。这个问题将在< a href = "https://github.com/mirrorer/afl/blob/master/docs/perf_tips.txt" target = "_blank" rel = "noopener" > perf_tips.txt< / a > 细说。< br > 用户可能提供低质量初始语料(starting corpus),某些类型的变异会迭代地增加生成文件的大小。所以要抑制这种趋势(counter this trend)。< br > 幸运的是,< strong > 插桩反馈(instrumentation feedback)< / strong > 提供了一种简单的方式自动削减( trim down) 输入文件, 并确保这些改变能使得文件对执行路径没有影响。< br > afl-fuzz内置的修剪器(trimmer)使用变化的长度和步距(variable length and stepover)来连续地(sequentially)删除数据块; 任何不影响trace map的校验和(checksum)的删除块将被提交到disk。< br > 这个修剪器的设计并不算特别地周密(thorough),相反地,它试着在精确度(precision)和进程调用execve()的次数之间选取一个平衡, 找到一个合适的block size和stepover。平均每个文件将增大约5-20%。< br > 独立的< strong > afl-tmin工具< / strong > 使用更完整(exhaustive)、迭代次数更多(iteractive)的算法,并尝试对被修剪的文件采用字母标准化的方式处理。< / p >
2019-07-16 09:15:34 +00:00
< h2 id = "6-模糊测试策略-Fuzzing-strategies" > < a href = "#6-模糊测试策略-Fuzzing-strategies" class = "headerlink" title = "6) 模糊测试策略(Fuzzing strategies)" > < / a > 6) 模糊测试策略(Fuzzing strategies)< / h2 > < p > 插桩提供的反馈(feedback)使得我们更容易理解各种不同fuzzing策略的价值, 从而优化(optimize)他们的参数。使得他们对不同的文件类型都能同等地进行工作。afl-fuzz用的策略通常是与格式无关( format-agnostic) , 详细说明在下边的连接中: < br > < a href = "http://lcamtuf.blogspot.com/2014/08/binary-fuzzing-strategies-what-works.html" target = "_blank" rel = "noopener" > binary-fuzzing-strategies-what-works< / a > < br > 值得注意的一点是, afl-fuzz大部分的(尤其是前期的)工作都是高度确定的(highly deterministic),随机性修改和测试用例拼接(random stacked modifications和test case splicing)只在后期的部分进行。 < strong > 确定性的策略< / strong > 包括:< br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < span class = "line" > 2< / span > < br > < span class = "line" > 3< / span > < br > < span class = "line" > 4< / span > < br > < span class = "line" > 5< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > - Sequential bit flips with varying lengths and stepovers,使用变化的长度和步距来连续进行位反转< / span > < br > < span class = "line" > < / span > < br > < span class = "line" > - Sequential addition and subtraction of small integers,对小的整型数来连续进行加法和减法< / span > < br > < span class = "line" > < / span > < br > < span class = "line" > - Sequential insertion of known interesting integers (0, 1, INT_MAX, etc),对已知的感兴趣的整型数连续地插入< / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
2019-07-09 09:11:34 +00:00
< p > 使用这些确定步骤的目的在于,生成紧凑的(compact)测试用例, 以及在产生non-crashing的输入和产生crashing的输入之间, 有很小的差异(small diffs)。< br > < strong > 非确定性(non-deterministic)策略< / strong > 的步骤包括: stacked bit flips、插入(insertions)、删除(deletions)、算数(arithmetics)和不同测试用例之间的拼接(splicing)。< / p >
< p > 由于在< a href = "http://lcamtuf.coredump.cx/afl/historical_notes.txt" target = "_blank" rel = "noopener" > historical_notes.txt< / a > 中提到的原因(性能、简易性、可靠性), AFL通常不试图去推断某个特定的变异(specific mutations)和程序状态(program states)的关系。< / p >
< p > fuzzing的步骤名义上来说是盲目的(nominally blind),只被输入队列的进化方式的设计所影响(< strong > 见第三部分< / strong > )。< / p >
< p > 这意味着,这条规则有一个例外:< br > 当一个新的队列条目, 经过初始的确定性fuzzing步骤集合时, 并且文件的部分区域被观测到对执行路径的校验和没有影响, 这些队列条目在接下来的确定性fuzzing阶段可能会被排除。< br > 尤其是对那些冗长的数据格式, 这可以在保持覆盖率不变的情况下, 减少10-40%的执行次数。在一些极端情况下, 比如一些block-aligned的tar文件, 这个数字可以达到90%。< / p >
< h2 id = "7-字典-Dictionaries" > < a href = "#7-字典-Dictionaries" class = "headerlink" title = "7) 字典(Dictionaries)" > < / a > 7) 字典(Dictionaries)< / h2 > < p > 插桩提供的反馈能够让它自动地识别出一些输入文件中的语法(syntax)符号(tokens),并且能够为测试器(tested parser)检测到一些组合,这些组合是由预定义(predefined)的或自动检测到的(auto-detected)字典项(dictionary terms)构成的合法语法(valid grammar)。< br > 关于这些特点在afl-fuzz是如何实现的, 可以看一下这个链接: < br > < a href = "http://lcamtuf.blogspot.com/2015/01/afl-fuzz-making-up-grammar-with.html" target = "_blank" rel = "noopener" > afl-fuzz-making-up-grammar-with< / a > < br > 大体上,当基本的(basic, typically easily-obtained)句法(syntax)符号(tokens)以纯粹随机的方式组合在一起时,< strong > 插桩< / strong > 和< strong > 队列进化< / strong > 这两种方法共同提供了一种反馈机制,这种反馈机制能够区分无意义的变异和在插桩代码中触发新行为的变异。这样能增量地构建更复杂的句法(syntax)。< br > 这样构建的字典能够让fuzzer快速地重构非常详细(highly verbose)且复杂的(complex)语法, 比如JavaScript, SQL,XML。一些生成SQL语句的例子已经在之前提到的博客中给出了。< br > 有趣的是, AFL的插桩也允许fuzzer自动地隔离(isolate)已经在输入文件中出现过的句法(syntax)符号(tokens)。< / p >
< h2 id = "8-崩溃去重( De-duping-crashes) " > < a href = "#8-崩溃去重( De-duping-crashes) " class = "headerlink" title = "8) 崩溃去重( De-duping crashes) " > < / a > 8) 崩溃去重( De-duping crashes) < / h2 > < p > 崩溃去重是fuzzing工具里很重要的问题之一。很多naive的解决方式都会有这样的问题: 如果这个错误发生在一个普通的库函数中(如say, strcmp, strcpy),只关注出错地址(faulting address)的话,那么可能导致一些完全不相关的问题被分在一类(clustered together)。如果错误发生在一些不同的、可能递归的代码路径中,那么校验和(checksumming)调用栈回溯(call stack backtraces)时可能导致crash count inflation(通胀)。< / p >
2019-07-16 09:15:34 +00:00
< p > afl-fuzz的解决方案认为满足一下两个条件, 那么这个crash就是唯一的(unique): < br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < span class = "line" > 2< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > - The crash trace includes a tuple not seen in any of the previous crashes,这个crash的路径包括一个之前crash从未见到过的tuple。< / span > < br > < span class = "line" > - The crash trace is missing a tuple that was always present in earlier faults.这个crash的路径不包含一个总在之前crash中出现的tuple。< / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
2019-07-09 09:11:34 +00:00
< p > 这种方式一开始容易受到count inflation的影响, 但实验表明其有很强的自我限制效果。和执行路径分析一样, 这种 < strong > 崩溃去重< / strong > 的方式是afl-fuzz的基石(cornerstone)。< / p >
< h2 id = "9-崩溃调查-Investigating-crashes" > < a href = "#9-崩溃调查-Investigating-crashes" class = "headerlink" title = "9) 崩溃调查(Investigating crashes)" > < / a > 9) 崩溃调查(Investigating crashes)< / h2 > < p > 不同的crash的可用性(exploitability)是不同的。afl-fuzz提供一个crash的探索模式(exploration mode)来解决这个问题。< br > 对一个已知的出错测试用例, 它被fuzz的方式和正常fuzz的操作没什么不同, 但是有一个限制能让任何non-crashing 的变异(mutations)会被丢弃(thrown away)。< br > 这种方法的意义在以下链接中会进一步讨论:< br > < a href = "http://lcamtuf.blogspot.com/2014/11/afl-fuzz-crash-exploration-mode.html" target = "_blank" rel = "noopener" > afl-fuzz-crash-exploration-mode< / a > < br > 这种方法利用< strong > instrumentation的反馈< / strong > , 探索crash程序的状态, 从而进一步通过歧义性的失败条件, 找到了最新发现的input。< br > 对于crashes来说, 值得注意的是和正常的队列条目对比, 导致crash的input没有被去掉, 为了和它们的父条目( 队列中没有导致crash的条目) 对比, 它们被保存下来, < br > 这就是说afl-tmin可以被用来随意缩减它们。< / p >
< h2 id = "10-The-fork-server" > < a href = "#10-The-fork-server" class = "headerlink" title = "10) The fork server" > < / a > 10) The fork server< / h2 > < p > 为了提升性能, afl-fuzz使用了一个”fork server”, fuzz的进程只进行一次execve(), 连接(linking), 库初始化(libc initialization)。fuzz进程通过copy-on-write(写时拷贝技术)从已停止的fuzz进程中clone下来。实现细节在以下链接中: < br > < a href = "http://lcamtuf.blogspot.com/2014/10/fuzzing-binaries-without-execve.html" target = "_blank" rel = "noopener" > fuzzing-binaries-without-execve< / a > < br > fork server被集成在了instrumentation的程序下, 在第一个instrument函数执行时, fork server就停止并等待afl-fuzz的命令。< br > 对于需要快速发包的测试, fork server可以提升1.5到2倍的性能。< / p >
< h2 id = "11-并行机制" > < a href = "#11-并行机制" class = "headerlink" title = "11) 并行机制" > < / a > 11) 并行机制< / h2 > < p > 实现并行的机制是, 定期检查不同cpu core或不同机器产生的队列, 然后有选择性的把队列中的条目放到test cases中。< br > 详见: parallel_fuzzing.txt.< / p >
2019-07-16 09:15:34 +00:00
< h2 id = "12) 二进制instrumentation" > < a href = "#12) 二进制instrumentation" class = "headerlink" title = "12) 二进制instrumentation" > < / a > 12) 二进制instrumentation< / h2 > < p > AFL-Fuzz对二进制黑盒目标程序的instrumentation是通过< strong > QEMU< / strong > 的“user emulation”模式实现的。< br > 这样我们就可以允许跨架构的运行, 比如ARM binaries运行在X86的架构上。< br > QEMU使用basic blocks作为翻译单元, 利用QEMU做instrumentation, 再使用一个和编译期instrumentation类似的< strong > guided fuzz< / strong > 的模型。< br > < figure class = "highlight plain" > < table > < tr > < td class = "gutter" > < pre > < span class = "line" > 1< / span > < br > < span class = "line" > 2< / span > < br > < span class = "line" > 3< / span > < br > < span class = "line" > 4< / span > < br > < span class = "line" > 5< / span > < br > < span class = "line" > 6< / span > < br > < span class = "line" > 7< / span > < br > < / pre > < / td > < td class = "code" > < pre > < span class = "line" > if (block_address > elf_text_start & & block_address < elf_text_end) { < / span > < br > < span class = "line" > < / span > < br > < span class = "line" > cur_location = (block_address > > 4) ^ (block_address < < 8);< / span > < br > < span class = "line" > shared_mem[cur_location ^ prev_location]++;< / span > < br > < span class = "line" > prev_location = cur_location > > 1;< / span > < br > < span class = "line" > < / span > < br > < span class = "line" > } < / span > < br > < / pre > < / td > < / tr > < / table > < / figure > < / p >
2019-07-09 09:11:34 +00:00
< p > 像QEMU, DynamoRIO, and PIN这样的二进制翻译器, 启动是很慢的。QEMU mode同样使用了一个fork server, 和编译期一样, 通过把一个已经初始化好的进程镜像, 直接拷贝到新的进程中。< br > 当然第一次翻译一个新的basic block还是有必要的延迟, 为了解决这个问题AFL fork server在emulator和父进程之间提供了一个频道。这个频道用来通知父进程新添加的blocks的地址, 之后吧这些blocks放到一个缓存中, 以便直接复制到将来的子进程中。这样优化之后, QEMU模式对目标程序造成2-5倍的减速, 相比之下, PIN造成100倍以上的减速。< / p >
2019-07-01 09:28:12 +00:00
< h2 id = "13) afl-analyze工具" > < a href = "#13) afl-analyze工具" class = "headerlink" title = "13) afl-analyze工具" > < / a > 13) afl-analyze工具< / h2 > < p > 文件格式分析器是最小化算法的简单扩展< br > 前面讨论过; 该工具执行一系列步行字节翻转,然后在输入文件中注释字节运行,而不是尝试删除无操作块。< / p >
< / div >
< div >
< div style = "padding: 10px 0; margin: 20px auto; width: 90%; text-align: center;" >
< div > 您的支持将鼓励我继续创作!< / div >
< button id = "rewardButton" disable = "enable" onclick = "var qr = document.getElementById('QR'); if (qr.style.display === 'none') {qr.style.display='block';} else {qr.style.display='none'}" >
< span > 打赏< / span >
< / button >
< div id = "QR" style = "display: none;" >
< div id = "wechat" style = "display: inline-block" >
< img id = "wechat_qr" src = "/images/Wechatpay.png" alt = "Cool-Y 微信支付" >
< p > 微信支付< / p >
< / div >
< div id = "alipay" style = "display: inline-block" >
< img id = "alipay_qr" src = "/images/Alipay.png" alt = "Cool-Y 支付宝" >
< p > 支付宝< / p >
< / div >
< / div >
< / div >
< / div >
< footer class = "post-footer" >
2019-07-01 11:52:45 +00:00
< div class = "post-tags" >
< a href = "/tags/AFL/" rel = "tag" > # AFL< / a >
< a href = "/tags/模糊测试/" rel = "tag" > # 模糊测试< / a >
< / div >
2019-07-01 09:28:12 +00:00
< div class = "post-nav" >
< div class = "post-nav-next post-nav-item" >
2019-07-09 06:49:56 +00:00
< a href = "/2019/05/14/pack-and-unpack/" rel = "next" title = "加壳与脱壳" >
< i class = "fa fa-chevron-left" > < / i > 加壳与脱壳
2019-07-01 09:28:12 +00:00
< / a >
< / div >
< span class = "post-nav-divider" > < / span >
< div class = "post-nav-prev post-nav-item" >
2019-07-09 08:59:11 +00:00
< a href = "/2019/07/09/afl-first-try/" rel = "prev" title = "AFL-爱之初体验" >
AFL-爱之初体验 < i class = "fa fa-chevron-right" > < / i >
2019-07-09 06:49:56 +00:00
< / a >
2019-07-01 09:28:12 +00:00
< / div >
< / div >
< / footer >
< / div >
< / article >
< div class = "post-spread" >
< / div >
< / div >
< / div >
< div class = "comments" id = "comments" >
< div id = "gitment-container" > < / div >
< / div >
< / div >
< div class = "sidebar-toggle" >
< div class = "sidebar-toggle-line-wrap" >
< span class = "sidebar-toggle-line sidebar-toggle-line-first" > < / span >
< span class = "sidebar-toggle-line sidebar-toggle-line-middle" > < / span >
< span class = "sidebar-toggle-line sidebar-toggle-line-last" > < / span >
< / div >
< / div >
< aside id = "sidebar" class = "sidebar" >
< div class = "sidebar-inner" >
< ul class = "sidebar-nav motion-element" >
< li class = "sidebar-nav-toc sidebar-nav-active" data-target = "post-toc-wrap" >
文章目录
< / li >
< li class = "sidebar-nav-overview" data-target = "site-overview-wrap" >
站点概览
< / li >
< / ul >
< section class = "site-overview-wrap sidebar-panel" >
< div class = "site-overview" >
< div class = "site-author motion-element" itemprop = "author" itemscope itemtype = "http://schema.org/Person" >
< img class = "site-author-image" itemprop = "image" src = "/images/avatar.png" alt = "Cool-Y" >
< p class = "site-author-name" itemprop = "name" > Cool-Y< / p >
2019-07-24 03:51:42 +00:00
< p class = "site-description motion-element" itemprop = "description" > 没人比我更懂中医#MAGA< / p >
2019-07-01 09:28:12 +00:00
< / div >
< nav class = "site-state motion-element" >
< div class = "site-state-item site-state-posts" >
< a href = "/archives/" >
2021-01-08 08:35:03 +00:00
< span class = "site-state-item-count" > 28< / span >
2019-07-01 09:28:12 +00:00
< span class = "site-state-item-name" > 日志< / span >
< / a >
< / div >
< div class = "site-state-item site-state-categories" >
< a href = "/categories/index.html" >
2019-10-15 11:24:26 +00:00
< span class = "site-state-item-count" > 7< / span >
2019-07-01 09:28:12 +00:00
< span class = "site-state-item-name" > 分类< / span >
< / a >
< / div >
< div class = "site-state-item site-state-tags" >
< a href = "/tags/index.html" >
2021-01-08 08:35:03 +00:00
< span class = "site-state-item-count" > 52< / span >
2019-07-01 09:28:12 +00:00
< span class = "site-state-item-name" > 标签< / span >
< / a >
< / div >
< / nav >
< div class = "links-of-author motion-element" >
< span class = "links-of-author-item" >
< a href = "https://github.com/Cool-Y" target = "_blank" title = "GitHub" >
< i class = "fa fa-fw fa-github" > < / i > GitHub< / a >
< / span >
< span class = "links-of-author-item" >
< a href = "mailto:cool.yim@whu.edu.cn" target = "_blank" title = "E-Mail" >
< i class = "fa fa-fw fa-envelope" > < / i > E-Mail< / a >
< / span >
< span class = "links-of-author-item" >
< a href = "https://www.instagram.com/yan__han/" target = "_blank" title = "Instagram" >
< i class = "fa fa-fw fa-instagram" > < / i > Instagram< / a >
< / span >
< / div >
2019-10-01 12:45:37 +00:00
< div id = "music163player" >
< iframe frameborder = "no" border = "0" marginwidth = "0" marginheight = "0" width = "330" height = "450" src = "//music.163.com/outchain/player?type=4&id=334277093&auto=1&height=430" > < / iframe >
< / div >
2019-07-01 09:28:12 +00:00
< / div >
< / section >
<!-- noindex -->
< section class = "post-toc-wrap motion-element sidebar-panel sidebar-panel-active" >
< div class = "post-toc" >
2019-07-09 09:11:34 +00:00
< div class = "post-toc-content" > < ol class = "nav" > < li class = "nav-item nav-level-1" > < a class = "nav-link" href = "#0x01-模糊测试" > < span class = "nav-text" > 0x01 模糊测试< / span > < / a > < / li > < li class = "nav-item nav-level-1" > < a class = "nav-link" href = "#0x02-AFL快速入门" > < span class = "nav-text" > 0x02 AFL快速入门< / span > < / a > < / li > < li class = "nav-item nav-level-1" > < a class = "nav-link" href = "#0x03-AFL特点" > < span class = "nav-text" > 0x03 AFL特点< / span > < / a > < / li > < li class = "nav-item nav-level-1" > < a class = "nav-link" href = "#0x04-AFL-README" > < span class = "nav-text" > 0x04 AFL README< / span > < / a > < ol class = "nav-child" > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#1) 具有导向性的模糊测试的挑战" > < span class = "nav-text" > 1) 具有导向性的模糊测试的挑战< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#2) afl-fuzz方法" > < span class = "nav-text" > 2) afl-fuzz方法< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#3) 用于AFL的插桩( instrumentation) 程序" > < span class = "nav-text" > 3) 用于AFL的插桩( instrumentation) 程序< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#4) 检测仅二进制应用程序" > < span class = "nav-text" > 4) 检测仅二进制应用程序< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#5) 选择初始测试用例" > < span class = "nav-text" > 5) 选择初始测试用例< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#6) 模糊测试二进制文件" > < span class = "nav-text" > 6) 模糊测试二进制文件< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#7) 解释输出" > < span class = "nav-text" > 7) 解释输出< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#8) 并行模糊测试" > < span class = "nav-text" > 8) 并行模糊测试< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#9) Fuzzer词典" > < span class = "nav-text" > 9) Fuzzer词典< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#10) 崩溃分类" > < span class = "nav-text" > 10) 崩溃分类< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#11) 超越崩溃" > < span class = "nav-text" > 11) 超越崩溃< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#12) 常识性风险" > < span class = "nav-text" > 12) 常识性风险< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#13) 已知的限制和需要改进的领域" > < span class = "nav-text" > 13) 已知的限制和需要改进的领域< / span > < / a > < / li > < / ol > < / li > < li class = "nav-item nav-level-1" > < a class = "nav-link" href = "#0x05-afl-fuzz白皮书" > < span class = "nav-text" > 0x05 afl-fuzz白皮书< / span > < / a > < ol class = "nav-child" > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#0) 设计说明-Design-statement" > < span class = "nav-text" > 0) 设计说明(Design statement)< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#1) 覆盖率计算-Coverage-measurements" > < span class = "nav-text" > 1) 覆盖率计算(Coverage measurements)< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#2) 发现新路径-Detecting-new-behaviors" > < span class = "nav-text" > 2) 发现新路径(Detecting new behaviors)< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#3) 输入队列的进化-Evolving-the-input-queue" > < span class = "nav-text" > 3) 输入队列的进化(Evolving the input queue)< / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#4) 语料筛选( Culling-the-corpus) " > < span class = "nav-text" > 4) 语料筛选( Culling the corpus) < / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#5) 输入文件修剪( Trimming-input-files) " > < span class = "nav-text" > 5) 输入文件修剪( Trimming input files) < / span > < / a > < / li > < li class = "nav-item nav-level-2" > < a class = "nav-link" href = "#6-模糊测试策略-Fuzzing-strategies" > < span class = "nav-text" > 6) 模糊测试策略(Fuzzing strategies)< /
2019-07-01 09:28:12 +00:00
< / div >
< / section >
<!-- /noindex -->
< / div >
< / aside >
< / div >
< / main >
< footer id = "footer" class = "footer" >
< div class = "footer-inner" >
2021-01-08 04:26:24 +00:00
< div class = "copyright" > © 2019 — < span itemprop = "copyrightYear" > 2021< / span >
2019-07-01 09:28:12 +00:00
< span class = "with-love" >
< i class = "fa fa-user" > < / i >
< / span >
< span class = "author" itemprop = "copyrightHolder" > Cool-Y< / span >
< span class = "post-meta-divider" > |< / span >
< span class = "post-meta-item-icon" >
< i class = "fa fa-area-chart" > < / i >
< / span >
2021-01-08 08:35:03 +00:00
< span title = "Site words total count" > 100.2k< / span >
2019-07-01 09:28:12 +00:00
< / div >
< div class = "powered-by" > 由 < a class = "theme-link" target = "_blank" href = "https://hexo.io" > Hexo< / a > 强力驱动< / div >
< div class = "busuanzi-count" >
< script async src = "//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js" > < / script >
< span class = "site-uv" >
< i class = "fa fa-user" > < / i >
< span class = "busuanzi-value" id = "busuanzi_value_site_uv" > < / span >
< / span >
< span class = "site-pv" >
< i class = "fa fa-eye" > < / i >
< span class = "busuanzi-value" id = "busuanzi_value_site_pv" > < / span >
< / span >
< / div >
< / div >
< / footer >
< div class = "back-to-top" >
< i class = "fa fa-arrow-up" > < / i >
< / div >
< / div >
< script type = "text/javascript" >
if (Object.prototype.toString.call(window.Promise) !== '[object Function]') {
window.Promise = null;
}
< / script >
< script type = "text/javascript" src = "/lib/jquery/index.js?v=2.1.3" > < / script >
< script type = "text/javascript" src = "/lib/fastclick/lib/fastclick.min.js?v=1.0.6" > < / script >
< script type = "text/javascript" src = "/lib/jquery_lazyload/jquery.lazyload.js?v=1.9.7" > < / script >
< script type = "text/javascript" src = "/lib/velocity/velocity.min.js?v=1.2.1" > < / script >
< script type = "text/javascript" src = "/lib/velocity/velocity.ui.min.js?v=1.2.1" > < / script >
< script type = "text/javascript" src = "/lib/fancybox/source/jquery.fancybox.pack.js?v=2.1.5" > < / script >
< script type = "text/javascript" src = "/js/src/utils.js?v=5.1.4" > < / script >
< script type = "text/javascript" src = "/js/src/motion.js?v=5.1.4" > < / script >
2019-08-09 03:54:43 +00:00
< script type = "text/javascript" src = "/js/src/affix.js?v=5.1.4" > < / script >
< script type = "text/javascript" src = "/js/src/schemes/pisces.js?v=5.1.4" > < / script >
2019-07-01 09:28:12 +00:00
< script type = "text/javascript" src = "/js/src/scrollspy.js?v=5.1.4" > < / script >
< script type = "text/javascript" src = "/js/src/post-details.js?v=5.1.4" > < / script >
< script type = "text/javascript" src = "/js/src/bootstrap.js?v=5.1.4" > < / script >
<!-- LOCAL: You can save these files to your site and update links -->
2019-07-10 04:27:33 +00:00
< link rel = "stylesheet" href = "https://jjeejj.github.io/css/gitment.css" >
< script src = "https://jjeejj.github.io/js/gitment.js" > < / script >
2019-07-01 09:28:12 +00:00
<!-- END LOCAL -->
< script type = "text/javascript" >
function renderGitment(){
2019-07-10 04:27:33 +00:00
var gitment = new Gitment({
2019-07-09 06:49:56 +00:00
id: window.location.pathname,
2019-07-01 09:28:12 +00:00
owner: 'Cool-Y',
repo: 'gitment-comments',
oauth: {
client_secret: '1c5db4da72df5e6fc318d12afe5f4406f7c54343',
client_id: '180955a2c3ae3d966d9a'
}});
gitment.render('gitment-container');
}
renderGitment();
< / script >
< script src = "https://cdn1.lncld.net/static/js/av-core-mini-0.6.4.js" > < / script >
< script > AV . initialize ( "EWwoJgHNdlj6iBjiFlMcabUO-gzGzoHsz" , "x8FxDrYG79C8YFrTww9ljo8K" ) ; < / script >
< script >
function showTime(Counter) {
var query = new AV.Query(Counter);
var entries = [];
var $visitors = $(".leancloud_visitors");
$visitors.each(function () {
entries.push( $(this).attr("id").trim() );
});
query.containedIn('url', entries);
query.find()
.done(function (results) {
var COUNT_CONTAINER_REF = '.leancloud-visitors-count';
if (results.length === 0) {
$visitors.find(COUNT_CONTAINER_REF).text(0);
return;
}
for (var i = 0; i < results.length ; i + + ) {
var item = results[i];
var url = item.get('url');
var time = item.get('time');
var element = document.getElementById(url);
$(element).find(COUNT_CONTAINER_REF).text(time);
}
for(var i = 0; i < entries.length ; i + + ) {
var url = entries[i];
var element = document.getElementById(url);
var countSpan = $(element).find(COUNT_CONTAINER_REF);
if( countSpan.text() == '') {
countSpan.text(0);
}
}
})
.fail(function (object, error) {
console.log("Error: " + error.code + " " + error.message);
});
}
function addCount(Counter) {
var $visitors = $(".leancloud_visitors");
var url = $visitors.attr('id').trim();
var title = $visitors.attr('data-flag-title').trim();
var query = new AV.Query(Counter);
query.equalTo("url", url);
query.find({
success: function(results) {
if (results.length > 0) {
var counter = results[0];
counter.fetchWhenSave(true);
counter.increment("time");
counter.save(null, {
success: function(counter) {
var $element = $(document.getElementById(url));
$element.find('.leancloud-visitors-count').text(counter.get('time'));
},
error: function(counter, error) {
console.log('Failed to save Visitor num, with error message: ' + error.message);
}
});
} else {
var newcounter = new Counter();
/* Set ACL */
var acl = new AV.ACL();
acl.setPublicReadAccess(true);
acl.setPublicWriteAccess(true);
newcounter.setACL(acl);
/* End Set ACL */
newcounter.set("title", title);
newcounter.set("url", url);
newcounter.set("time", 1);
newcounter.save(null, {
success: function(newcounter) {
var $element = $(document.getElementById(url));
$element.find('.leancloud-visitors-count').text(newcounter.get('time'));
},
error: function(newcounter, error) {
console.log('Failed to create');
}
});
}
},
error: function(error) {
console.log('Error:' + error.code + " " + error.message);
}
});
}
$(function() {
var Counter = AV.Object.extend("Counter");
if ($('.leancloud_visitors').length == 1) {
addCount(Counter);
} else if ($('.post-title-link').length > 1) {
showTime(Counter);
}
});
< / script >
< script >
(function(){
var bp = document.createElement('script');
var curProtocol = window.location.protocol.split(':')[0];
if (curProtocol === 'https') {
bp.src = 'https://zz.bdstatic.com/linksubmit/push.js';
}
else {
bp.src = 'http://push.zhanzhang.baidu.com/push.js';
}
var s = document.getElementsByTagName("script")[0];
s.parentNode.insertBefore(bp, s);
})();
< / script >
< / body >
< / html >