计算机系统中攻击图分析的代价技术

Narimene Bair, L. Hamza, Lillia Ouali
{"title":"计算机系统中攻击图分析的代价技术","authors":"Narimene Bair, L. Hamza, Lillia Ouali","doi":"10.1109/ICCIT54785.2021.9689915","DOIUrl":null,"url":null,"abstract":"In this paper, we define a new technique for analysing attack graphs in order to protect networks and computer systems from the risks and threats that can affect them. Our approach is based on logic expression of attacks scenarios, generated by any tool, in order to obtain a minimal set of vulnerabilities to remove. After identifying the dependencies between these vulnerabilities we propose the best cost paths to remove. As a result, we obtain the deleted paths with a minimal cost.","PeriodicalId":166450,"journal":{"name":"2021 24th International Conference on Computer and Information Technology (ICCIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Costs Technique for Analysis Attacks Graphs in Computer Systems\",\"authors\":\"Narimene Bair, L. Hamza, Lillia Ouali\",\"doi\":\"10.1109/ICCIT54785.2021.9689915\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we define a new technique for analysing attack graphs in order to protect networks and computer systems from the risks and threats that can affect them. Our approach is based on logic expression of attacks scenarios, generated by any tool, in order to obtain a minimal set of vulnerabilities to remove. After identifying the dependencies between these vulnerabilities we propose the best cost paths to remove. As a result, we obtain the deleted paths with a minimal cost.\",\"PeriodicalId\":166450,\"journal\":{\"name\":\"2021 24th International Conference on Computer and Information Technology (ICCIT)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 24th International Conference on Computer and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIT54785.2021.9689915\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 24th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIT54785.2021.9689915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们定义了一种分析攻击图的新技术,以保护网络和计算机系统免受可能影响它们的风险和威胁。我们的方法是基于任何工具生成的攻击场景的逻辑表达,以获得要删除的最小漏洞集。在确定了这些漏洞之间的依赖关系之后,我们提出了要消除的最佳成本路径。因此,我们以最小的代价获得了被删除的路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Costs Technique for Analysis Attacks Graphs in Computer Systems
In this paper, we define a new technique for analysing attack graphs in order to protect networks and computer systems from the risks and threats that can affect them. Our approach is based on logic expression of attacks scenarios, generated by any tool, in order to obtain a minimal set of vulnerabilities to remove. After identifying the dependencies between these vulnerabilities we propose the best cost paths to remove. As a result, we obtain the deleted paths with a minimal cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信