Generation of IDS Signatures through Exhaustive Execution Path Exploration in PoC Codes for Vulnerabilities

Q4 Computer Science Journal of Information Processing Pub Date : 2023-01-01 DOI:10.2197/ipsjjip.31.591
Masaki Kobayashi, Yo Kanemoto, Daisuke Kotani, Yasuo Okabe
{"title":"Generation of IDS Signatures through Exhaustive Execution Path Exploration in PoC Codes for Vulnerabilities","authors":"Masaki Kobayashi, Yo Kanemoto, Daisuke Kotani, Yasuo Okabe","doi":"10.2197/ipsjjip.31.591","DOIUrl":null,"url":null,"abstract":"There have been many vulnerabilities, and we need prompt countermeasures. One factor that makes more rapid measures necessary is Proof of Concept (PoC) codes. Although they are released to promote vulnerability countermeasures, attackers can also abuse them. In this paper, we analyze PoC codes that send HTTP requests, then generate IDS signatures. To analyze codes, there are two policies: dynamic analysis and static analysis. However, the former cannot cover the execution paths, and the latter cannot analyze dynamically determined values. In addition, symbolic execution compensates for their shortcomings, but its implementation cost is high. We propose a signature generation method for PoC codes that send HTTP requests based on an analysis combining dynamic and static analysis. We first statically explore execution paths of the code by searching for the conditional branch syntax using the abstract syntax tree. Then, we rewrite the branch conditions to enforce the specific execution path and generate a new code corresponding to each path. Finally, we execute each code, generate the attack requests dynamically, and extract signatures. The average detection rate for the requests was 86.9%. Moreover, we tested the signatures for 30 codes by actually executing them, and for nine codes, we detected the attack.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2197/ipsjjip.31.591","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

Abstract

There have been many vulnerabilities, and we need prompt countermeasures. One factor that makes more rapid measures necessary is Proof of Concept (PoC) codes. Although they are released to promote vulnerability countermeasures, attackers can also abuse them. In this paper, we analyze PoC codes that send HTTP requests, then generate IDS signatures. To analyze codes, there are two policies: dynamic analysis and static analysis. However, the former cannot cover the execution paths, and the latter cannot analyze dynamically determined values. In addition, symbolic execution compensates for their shortcomings, but its implementation cost is high. We propose a signature generation method for PoC codes that send HTTP requests based on an analysis combining dynamic and static analysis. We first statically explore execution paths of the code by searching for the conditional branch syntax using the abstract syntax tree. Then, we rewrite the branch conditions to enforce the specific execution path and generate a new code corresponding to each path. Finally, we execute each code, generate the attack requests dynamically, and extract signatures. The average detection rate for the requests was 86.9%. Moreover, we tested the signatures for 30 codes by actually executing them, and for nine codes, we detected the attack.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过穷举执行路径探索PoC代码漏洞生成IDS签名
有许多漏洞,我们需要迅速采取对策。使更快速的措施成为必要的一个因素是概念验证(PoC)代码。尽管发布它们是为了促进漏洞对策,但攻击者也可以滥用它们。在本文中,我们分析发送HTTP请求的PoC代码,然后生成IDS签名。要分析代码,有两种策略:动态分析和静态分析。但是,前者不能覆盖执行路径,后者不能分析动态确定的值。此外,符号执行弥补了它们的不足,但其实现成本较高。提出了一种基于动态分析和静态分析相结合的HTTP请求对讲码签名生成方法。我们首先通过使用抽象语法树搜索条件分支语法来静态地探索代码的执行路径。然后,我们重写分支条件以强制执行特定的执行路径,并生成与每个路径对应的新代码。最后,我们执行每个代码,动态生成攻击请求,并提取签名。请求的平均检出率为86.9%。此外,我们对30个代码的签名进行了测试,其中9个代码检测到了攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Information Processing
Journal of Information Processing Computer Science-Computer Science (all)
CiteScore
1.20
自引率
0.00%
发文量
0
期刊最新文献
Container-native Managed Data Sharing Editor's Message to Special Issue of Computer Security Technologies for Secure Cyberspace Understanding the Inconsistencies in the Permissions Mechanism of Web Browsers An Analysis of Susceptibility to Phishing via Business Chat through Online Survey Analysis and Consideration of Detection Methods to Prevent Fraudulent Access by Utilizing Attribute Information and the Access Log History
×
引用
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