SIP振荡器:软件完整性保护组合
SIP Shaker: Software Integrity Protection Composition
摘要:
MATE攻击者是全能的对手,不存在任何银弹对策。为了提高标准,文献中提出了各种保护措施,每种措施都增加了对程序的某些数字资产的某些攻击的弹性。直观地说,组成一组保护(而不是只应用其中一个)可以减轻更广泛的攻击,从而提供更高的安全级别。尽管有潜在的好处,但对保护措施的构成进行的研究非常有限。幼稚的组合可能导致冲突,这反过来又会限制保护的应用,引发错误警报,更糟糕的是,产生损坏的二进制文件。更重要的是,这种保护的不充分组成不是针对手头的程序而定制的,因此所提供的安全性和性能是次优的。在本文中,我们首先列出了一组通用的约束,一个无冲突的保护组合。然后,我们开发了一个基于防御图的组合框架,其中节点和边缘捕获保护,它们的关系和约束。然后将冲突问题与优化要求一起转化为一组整数约束。然后,我们使用非线性规划(ILP)来处理冲突,同时优化更高的安全性和更低的开销。为了测量开销,我们使用了一组真实世界的程序(MiBench数据集和开源游戏)。我们的评估结果表明,我们的组合框架减少了$\approx$ 39%的开销,同时最大限度地提高覆盖率。此外,我们的方法产生了5倍的开销减少相比,国家的最先进的物流。
英文摘要:
Man-At-The-End (MATE) attackers are almighty adversaries against whom there exists no silver-bullet countermeasure. To raise the bar, a wide range of protection measures were proposed in the literature each of which adds resilience against certain attacks on certain digital assets of a program. Intuitively, composing a set of protections (rather than applying just one of them) can mitigate a wider range of attacks and hence offer a higher level of security. Despite the potential benefits, very limited research has been done on the composition of protections. Naive compositions could lead to conflicts which, in turn, limit the application of protections, raise false alarms, and worse yet, yield corrupted binaries. More importantly, inadequate compositions of such protections are not tailored for the program at hand and thus the offered security and performance are sub-optimal. In this paper, we first lay out a set of generic constraints for a conflict-free composition of protections. Then, we develop a composition framework based on a defense graph in which nodes and edges capture protections, their relations, and constraints. The conflicts problem together with optimization requirements are then translated into a set of integer constraints. We then use Integer Linear Programming (ILP) to handle conflicts while optimizing for a higher security and lower overhead. To measure the overhead, we use a set of real-world programs (MiBench dataset and open source games). Our evaluation results indicate that our composition framework reduces the overhead by $\approx$ 39% while maximizing the coverage. Moreover, our approach yields a 5-fold decrease in overhead compared to state-of-the-art heuristics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。