发现、量化和显示攻击
Discovering, quantifying, and displaying attacks
摘要：
在软件和网络物理系统的设计中，安全性通常被视为一种定性需求，但只能定量实现。特别是当涉及分布式组件时，很难预测和应对所有可能的攻击。因此，复杂系统开发中的一个主要挑战是发现攻击，量化它们以了解它们的可能性，并将它们传达给非专家以促进决策过程。为了解决这个三方面的挑战，我们提出了一个保护分析的质量演算，（i）计算所需的所有数据集的攻击者到达系统中的给定位置，（ii）确定最便宜的一组这样的攻击给定的成本概念，（iii）推导出一个攻击树，以图形方式显示的攻击。保护分析首先是在定性环境中进行的，然后按照适用于许多情况的方法扩展到定量环境。定量制定实施编码成可满足性模理论的优化问题，使我们能够处理复杂的成本结构。该框架的实用性证明了一个国家级的认证系统，通过Java实现的框架进行了研究。
英文摘要：
In the design of software and cyber-physical systems, security is often perceived as a qualitative need, but can only be attained quantitatively. Especially when distributed components are involved, it is hard to predict and confront all possible attacks. A main challenge in the development of complex systems is therefore to discover attacks, quantify them to comprehend their likelihood, and communicate them to non-experts for facilitating the decision process. To address this three-sided challenge we propose a protection analysis over the Quality Calculus that (i) computes all the sets of data required by an attacker to reach a given location in a system, (ii) determines the cheapest set of such attacks for a given notion of cost, and (iii) derives an attack tree that displays the attacks graphically. The protection analysis is first developed in a qualitative setting, and then extended to quantitative settings following an approach applicable to a great many contexts. The quantitative formulation is implemented as an optimisation problem encoded into Satisfiability Modulo Theories, allowing us to deal with complex cost structures. The usefulness of the framework is demonstrated on a national-scale authentication system, studied through a Java implementation of the framework.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
