Adaptive mutation based on multi-population evolution strategy for greybox fuzzing

IF 6.8 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2025-07-01 Epub Date: 2025-02-07 DOI:10.1016/j.ins.2025.121959
Weihua Jiao , Xilong Li , Qingbao Li , Fei Cao , Xiaonan Li , Shudan Yue
{"title":"Adaptive mutation based on multi-population evolution strategy for greybox fuzzing","authors":"Weihua Jiao ,&nbsp;Xilong Li ,&nbsp;Qingbao Li ,&nbsp;Fei Cao ,&nbsp;Xiaonan Li ,&nbsp;Shudan Yue","doi":"10.1016/j.ins.2025.121959","DOIUrl":null,"url":null,"abstract":"<div><div>The development of adaptive mutation techniques to enhance gray-box fuzzing performance has become trendy. However, existing adaptive methods have limitations in that they either ignore the impacts of different characteristics of seed inputs or require assumptions about the probability distribution model. Motivated by the observation, we present a novel adaptive mutation approach that combines seed clustering and Evolution Strategy to automatically find the optimal mutation scheduling method for seeds with different characteristics. Our approach captures seed inputs' structural and functional similarities and partitions them into proper populations. The Evolution Strategy is then used to iteratively optimize the probability distribution of operator selection for each population. We implement the prototype tool MesFuzz based on the aforementioned ideas. Evaluation on LAVA-M shows that <span>MesFuzz</span> is the only fuzzer to find bugs in all target programs. In addition, <span>MesFuzz</span> improves the path coverage by 132%, 14%, and 12% over DARWIN, <span>SeamFuzz</span>, and AFL++, respectively. That will facilitate fuzzing to discover vulnerabilities in real-world software and firmware further.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"705 ","pages":"Article 121959"},"PeriodicalIF":6.8000,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S002002552500091X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/7 0:00:00","PubModel":"Epub","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The development of adaptive mutation techniques to enhance gray-box fuzzing performance has become trendy. However, existing adaptive methods have limitations in that they either ignore the impacts of different characteristics of seed inputs or require assumptions about the probability distribution model. Motivated by the observation, we present a novel adaptive mutation approach that combines seed clustering and Evolution Strategy to automatically find the optimal mutation scheduling method for seeds with different characteristics. Our approach captures seed inputs' structural and functional similarities and partitions them into proper populations. The Evolution Strategy is then used to iteratively optimize the probability distribution of operator selection for each population. We implement the prototype tool MesFuzz based on the aforementioned ideas. Evaluation on LAVA-M shows that MesFuzz is the only fuzzer to find bugs in all target programs. In addition, MesFuzz improves the path coverage by 132%, 14%, and 12% over DARWIN, SeamFuzz, and AFL++, respectively. That will facilitate fuzzing to discover vulnerabilities in real-world software and firmware further.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于灰盒模糊多种群进化策略的自适应突变
发展自适应突变技术来提高灰盒模糊性能已成为一种趋势。然而,现有的自适应方法存在一定的局限性,要么忽略了种子输入不同特性的影响,要么需要对概率分布模型进行假设。在此基础上,提出了一种将种子聚类与进化策略相结合的自适应突变方法,对具有不同特征的种子自动寻找最优突变调度方法。我们的方法捕获了种子输入的结构和功能相似性,并将它们划分为适当的种群。然后使用进化策略迭代优化每个种群的算子选择概率分布。基于上述思想,我们实现了原型工具MesFuzz。对LAVA-M的评估表明,MesFuzz是唯一能够在所有目标程序中发现bug的模糊器。此外,与DARWIN、SeamFuzz和afl++相比,MesFuzz的路径覆盖率分别提高了132%、14%和12%。这将有助于进一步发现现实世界软件和固件中的漏洞。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Verification and enforcement of k-step mutual opacity of networked systems A structure-aware multi-subspace granular-ball clustering framework ReForm-Net: Label reconstruction for high-precision detection of irregular steel surface defects AiGAS-dEVL: An adaptive incremental neural gas model for drifting data streams under extreme verification latency A post-quantum hierarchical and adaptive LWE-based secret image sharing scheme with verifiable reconstruction
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1