Evolving OWA operators for cyber security decision making problems

Simon Miller, J. Garibaldi, Susan Appleby
{"title":"Evolving OWA operators for cyber security decision making problems","authors":"Simon Miller, J. Garibaldi, Susan Appleby","doi":"10.1109/CICYBS.2013.6597200","DOIUrl":null,"url":null,"abstract":"Designing secure software systems is a non-trivial task as data on uncommon attacks is limited, costs are difficult to estimate, and technology and tools are continually changing. Consequently, a great deal of expertise is required to assess the security risks posed to a proposed system in its design stage. In this research we demonstrate how Evolutionary Algorithms (EAs) and Simulated Annealing (SA) can be used with Ordered Weighted Average (OWA) operators to provide a suitable aggregation tool for combining experts' opinions of individual components of an specific technical attack to produce an overall rating that can be used to rank attacks in order of salience. A set of thirty nine cyber security experts took part in an exercise in which they independently assessed a realistic system scenario. We show that using EAs and SA, OWA operators can be tuned to produce aggregations that are more stable when applied to a group of experts' ratings than those produced by the arithmetic mean, and that the difference between the solutions found by each of the algorithms is minimal. However, EAs do prove to be a quicker method of search when an equivalent number of evaluations is performed by each method.","PeriodicalId":178381,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence in Cyber Security (CICS)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Symposium on Computational Intelligence in Cyber Security (CICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICYBS.2013.6597200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Designing secure software systems is a non-trivial task as data on uncommon attacks is limited, costs are difficult to estimate, and technology and tools are continually changing. Consequently, a great deal of expertise is required to assess the security risks posed to a proposed system in its design stage. In this research we demonstrate how Evolutionary Algorithms (EAs) and Simulated Annealing (SA) can be used with Ordered Weighted Average (OWA) operators to provide a suitable aggregation tool for combining experts' opinions of individual components of an specific technical attack to produce an overall rating that can be used to rank attacks in order of salience. A set of thirty nine cyber security experts took part in an exercise in which they independently assessed a realistic system scenario. We show that using EAs and SA, OWA operators can be tuned to produce aggregations that are more stable when applied to a group of experts' ratings than those produced by the arithmetic mean, and that the difference between the solutions found by each of the algorithms is minimal. However, EAs do prove to be a quicker method of search when an equivalent number of evaluations is performed by each method.
针对网络安全决策问题不断发展的OWA运营商
设计安全的软件系统是一项非常重要的任务,因为关于罕见攻击的数据是有限的,成本很难估计,而且技术和工具也在不断变化。因此,需要大量的专业知识来评估在设计阶段提出的系统所面临的安全风险。在这项研究中,我们展示了进化算法(EAs)和模拟退火(SA)如何与有序加权平均(OWA)算子一起使用,以提供一个合适的聚合工具,将专家对特定技术攻击的各个组成部分的意见结合起来,产生一个总体评级,该评级可用于按显著性顺序对攻击进行排名。一组39名网络安全专家参加了一次演习,他们独立评估了一个现实的系统场景。我们表明,使用ea和SA,可以对OWA操作符进行调整,使其在应用于一组专家的评级时产生的聚合比使用算术平均值产生的聚合更稳定,并且每种算法找到的解决方案之间的差异很小。然而,当每个方法执行相同数量的计算时,ea确实被证明是一种更快的搜索方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信