网络安全培训的难度指标

Zequn Huang, Chien-Chung Shen, S. Doshi, Nimmi Thomas, Ha Duong
{"title":"网络安全培训的难度指标","authors":"Zequn Huang, Chien-Chung Shen, S. Doshi, Nimmi Thomas, Ha Duong","doi":"10.1109/COGSIMA.2015.7108194","DOIUrl":null,"url":null,"abstract":"Cyber security training systems work as a suitable learning environment for educating cyber analysts on how to detect and defense before real cyber attacks happen. As training is an iterative process, the assessment component not only assesses the knowledge gained by the cyber analysts, but also adjusts the difficulty of training lessons accordingly based on the analysts' performance. In this paper, we present an attack graph-based probabilistic metric to measure lesson scenarios' difficulty levels. Based on causal relationships between vulnerabilities in an attack graph, we apply Bayesian Reasoning to aggregate individual vulnerabilities into an probabilistic value representing the attackers success likelihood to achieve the attack goal. However, one major complication of using Bayesian Reasoning is that it does not allow for cycles, which exists in attack graphs. We identify different types of cycles in the attack graphs and propose an efficient algorithm to remove cycles while preserving cyclic influence in the probability calculation.","PeriodicalId":373467,"journal":{"name":"2015 IEEE International Multi-Disciplinary Conference on Cognitive Methods in Situation Awareness and Decision","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Difficulty-level metric for cyber security training\",\"authors\":\"Zequn Huang, Chien-Chung Shen, S. Doshi, Nimmi Thomas, Ha Duong\",\"doi\":\"10.1109/COGSIMA.2015.7108194\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cyber security training systems work as a suitable learning environment for educating cyber analysts on how to detect and defense before real cyber attacks happen. As training is an iterative process, the assessment component not only assesses the knowledge gained by the cyber analysts, but also adjusts the difficulty of training lessons accordingly based on the analysts' performance. In this paper, we present an attack graph-based probabilistic metric to measure lesson scenarios' difficulty levels. Based on causal relationships between vulnerabilities in an attack graph, we apply Bayesian Reasoning to aggregate individual vulnerabilities into an probabilistic value representing the attackers success likelihood to achieve the attack goal. However, one major complication of using Bayesian Reasoning is that it does not allow for cycles, which exists in attack graphs. We identify different types of cycles in the attack graphs and propose an efficient algorithm to remove cycles while preserving cyclic influence in the probability calculation.\",\"PeriodicalId\":373467,\"journal\":{\"name\":\"2015 IEEE International Multi-Disciplinary Conference on Cognitive Methods in Situation Awareness and Decision\",\"volume\":\"103 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Multi-Disciplinary Conference on Cognitive Methods in Situation Awareness and Decision\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COGSIMA.2015.7108194\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Multi-Disciplinary Conference on Cognitive Methods in Situation Awareness and Decision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COGSIMA.2015.7108194","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

网络安全培训系统为教育网络分析师如何在真正的网络攻击发生之前发现和防御提供了合适的学习环境。由于培训是一个迭代过程,评估组件不仅评估网络分析师所获得的知识,还根据分析师的表现相应地调整培训课程的难度。在本文中,我们提出了一个基于攻击图的概率度量来衡量课程场景的难度水平。基于攻击图中漏洞之间的因果关系,应用贝叶斯推理将单个漏洞聚合成一个概率值,表示攻击者成功实现攻击目标的可能性。然而,使用贝叶斯推理的一个主要复杂性是它不允许循环,而循环存在于攻击图中。我们在攻击图中识别了不同类型的循环,并提出了一种有效的算法来去除循环,同时在概率计算中保留循环影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Difficulty-level metric for cyber security training
Cyber security training systems work as a suitable learning environment for educating cyber analysts on how to detect and defense before real cyber attacks happen. As training is an iterative process, the assessment component not only assesses the knowledge gained by the cyber analysts, but also adjusts the difficulty of training lessons accordingly based on the analysts' performance. In this paper, we present an attack graph-based probabilistic metric to measure lesson scenarios' difficulty levels. Based on causal relationships between vulnerabilities in an attack graph, we apply Bayesian Reasoning to aggregate individual vulnerabilities into an probabilistic value representing the attackers success likelihood to achieve the attack goal. However, one major complication of using Bayesian Reasoning is that it does not allow for cycles, which exists in attack graphs. We identify different types of cycles in the attack graphs and propose an efficient algorithm to remove cycles while preserving cyclic influence in the probability calculation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信