2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)最新文献

筛选
英文 中文
Optimal Cyber-Defense Strategies for Advanced Persistent Threats: A Game Theoretical Analysis 高级持续性威胁的最优网络防御策略:博弈论分析
2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-03-21 DOI: 10.1109/SRDS.2017.29
Jeffrey Acquaviva, Mark Mahon, Bruce Einfalt, T. LaPorta
{"title":"Optimal Cyber-Defense Strategies for Advanced Persistent Threats: A Game Theoretical Analysis","authors":"Jeffrey Acquaviva, Mark Mahon, Bruce Einfalt, T. LaPorta","doi":"10.1109/SRDS.2017.29","DOIUrl":"https://doi.org/10.1109/SRDS.2017.29","url":null,"abstract":"We introduce a novel mathematical model that treats network security as a game between cyber attackers and network administrators. The model takes the form of a zero-sum repeated game where each sub-game corresponds to a possible state of the attacker. Our formulation views state as the set of compromised edges in a graph opposed to the more traditional node-based view. This provides a more expressive model since it allows the defender to anticipate the direction of attack. Both players move independently and in continuous time allowing for the possibility of one player moving several times before the other does. This model shows that defense-in-depth is not always a rational strategy for budget constrained network administrators. Furthermore, a defender can dissuade a rational attacker from attempting to attack a network if the defense budget is sufficiently high. This means that a network administrator does not need to make their system completely free of vulnerabilities, they only to ensure the penalties for being caught outweigh the potential rewards gained.","PeriodicalId":6475,"journal":{"name":"2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)","volume":"28 1","pages":"204-213"},"PeriodicalIF":0.0,"publicationDate":"2017-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78931176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Optimal Network Reconfiguration for Software Defined Networks Using Shuffle-Based Online MTD 基于Shuffle-Based在线MTD的软件定义网络最优网络重构
2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-01-01 DOI: 10.1109/SRDS.2017.32
Jin B. Hong, Seunghyun Yoon, Hyuk Lim, Dong Seong Kim
{"title":"Optimal Network Reconfiguration for Software Defined Networks Using Shuffle-Based Online MTD","authors":"Jin B. Hong, Seunghyun Yoon, Hyuk Lim, Dong Seong Kim","doi":"10.1109/SRDS.2017.32","DOIUrl":"https://doi.org/10.1109/SRDS.2017.32","url":null,"abstract":"A Software Defined Network (SDN) provides functionalities for modifying network configurations. To enhance security, Moving Target Defense (MTD) techniques are deployed in the networks to continuously change the attack surface. In this paper, we realize an MTD system by exploiting the SDN functionality to optimally reconfigure the network topology. We introduce a novel problem Shuffle Assignment Problem (SAP), the reconfiguration of a network topology for enhanced security, and we show how to compute the optimal solution for small-sized networks and the near-optimal solution for large-sized networks using a heuristic method. In addition, we propose a shuffle-based online MTD mechanism, which periodically reconfigures the network topology to continuously change the attack surface. This mechanism also selects an optimal countermeasure using our proposed topological distance metric in real-time when an attack is detected. We demonstrate the feasibility and the effectiveness of our proposed solutions through experimental analysis on an SDN testbed and simulations.","PeriodicalId":6475,"journal":{"name":"2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)","volume":"55 1","pages":"234-243"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80444428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 23
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信