论文标题

通过动态程序分区有效地硬化SGX飞地与内存访问模式攻击

Efficiently Hardening SGX Enclaves against Memory Access Pattern Attacks via Dynamic Program Partitioning

论文作者

Tang, Yuzhe, Li, Kai, Wang, Yibo, Chen, Jiaqi, Xu, Cheng

论文摘要

众所周知,英特尔SGX容易受到一类实用攻击,利用内存访问模式的侧通道,尤其是页面折线攻击和缓存正时攻击。一个有希望的硬化方案是将应用程序包装在由英特尔TSX启用的硬件交易中,该应用程序在意外的高速缓存失误和中断时返回到软件,以便可以检测和减轻利用这些微构造事件的现有侧通道攻击。但是,现有的硬化方案仅扩展到小型数据计算,其典型的工作集小于一个或几次(例如$ 8 $ times)的CPU数据缓存。 这项工作可应对英特尔SGX飞地的安全性硬化方案的数据可扩展性和性能效率,以与内存访问模式侧通道相对。关键的见解是,目标计算中TSX交易的大小在性能和安全性方面都是至关重要的。与现有的设计不同,这项工作动态地将计算目标分区以扩大交易,同时避免流产,从而降低性能开销和改善的侧渠道安全性。我们实现动态分区方案,并构建一个C ++库,以在运行时监视和建模缓存利用率。我们进一步使用库构建数据分析系统,并实施各种外部遗忘算法。绩效评估表明,与最先进的解决方案相比,我们的工作可以有效地增加交易规模,并最多将执行时间减少两个数量级。

Intel SGX is known to be vulnerable to a class of practical attacks exploiting memory access pattern side-channels, notably page-fault attacks and cache timing attacks. A promising hardening scheme is to wrap applications in hardware transactions, enabled by Intel TSX, that return control to the software upon unexpected cache misses and interruptions so that the existing side-channel attacks exploiting these micro-architectural events can be detected and mitigated. However, existing hardening schemes scale only to small-data computation, with a typical working set smaller than one or few times (e.g., $8$ times) of a CPU data cache. This work tackles the data scalability and performance efficiency of security hardening schemes of Intel SGX enclaves against memory-access pattern side channels. The key insight is that the size of TSX transactions in the target computation is critical, both performance- and security-wise. Unlike the existing designs, this work dynamically partitions target computations to enlarge transactions while avoiding aborts, leading to lower performance overhead and improved side-channel security. We materialize the dynamic partitioning scheme and build a C++ library to monitor and model cache utilization at runtime. We further build a data analytical system using the library and implement various external oblivious algorithms. Performance evaluation shows that our work can effectively increase transaction size and reduce the execution time by up to two orders of magnitude compared with the state-of-the-art solutions.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源