Formulating Cyber-Security as Convex Optimization Problems
Formulating Cyber-Security as Convex Optimization Problems
复制标题
将网络安全表述为凸优化问题
DOI：
10.1007/978-3-319-01159-2_5
复制
发表时间：
2013
影响因子：
5.6
通讯作者：
Giovanni Vigna
中科院分区：
文献类型：
--
作者：
K. Vamvoudakis;J. Hespanha;R. Kemmerer;Giovanni Vigna
以任务为中心的网络安全分析师需要全面概述和了解任务的状态以及完成任务的任何潜在威胁。为了实现这一目标，我们提出了基于优化的算法，该算法可用于实时预测攻击者如何尝试利用有限的资源来破坏网络任务，该模型考虑了对任务的潜在损害和概率不确定性的模型。考虑两种不同的优化方案：一种是攻击者先验地知道所有任务数据，另一种是使用系统识别和移动水平优化来根据历史数据生成估计。我们的方案与 2011 年国际夺旗 (iCTF) 黑客竞赛中人类玩家进行的真实攻击进行了比较。
Mission-centric cyber-security analysts require a complete overview and understanding of the state of a mission and any potential threats to their completion. To facilitate this, we propose optimization based algorithms that can be used to predict in real-time how an attacker may try to compromise a cyber-mission with a limited amount of resources, based on a model that takes into account potential damage to the mission and probabilistic uncertainty. Two different optimization schemes are considered: one where all the mission data is known a priori to the attacker and another where system identification and a moving horizon optimization is used to produce the estimates based on historical data. Our schemes are compared with real attacks carried our by human players in the 2011 international Capture The Flag (iCTF) hacking competition.