SCALE: Secure and Scalable Cache Partitioning

被引:0
作者
Holtryd, Nadja Ramhoj [1 ]
Manivannan, Madhavan [1 ]
Stenstrom, Per [1 ]
机构
[1] Chalmers Univ Technol, Gothenburg, Sweden
来源
2023 IEEE INTERNATIONAL SYMPOSIUM ON HARDWARE ORIENTED SECURITY AND TRUST, HOST | 2023年
基金
瑞典研究理事会;
关键词
D O I
10.1109/HOST55118.2023.10133713
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Dynamically partitioned last-level caches enhance performance while also introducing security vulnerabilities. We show how cache allocation policies can act as a side-channel and be exploited to launch attacks and obtain sensitive information. Our analysis reveals that information leaks due to predictable changes in cache allocation for the victim, that is caused and/or observed by the adversary, leads to exploits. We propose SCALE, a secure cache allocation policy and enforcement mechanism, to protect the cache against timing-based side-channel attacks. SCALE uses randomness, in a novel way, to enable dynamic and scalable partitioning while protecting against cache allocation policy side-channel attacks. Non-determinism is introduced into the allocation policy decisions by adding noise, which prevents the adversary from observing predictable changes in allocation and thereby infer secrets. We leverage differential privacy (DP), and show that SCALE can provide quantifiable and information theoretic security guarantees. SCALE outperforms state-of-the-art secure cache solutions, on a 16-core tiled chip multi-processor (CMP) with multi-programmed workloads, and improves performance up to 39% and by 14%, on average.
引用
收藏
页码:68 / 79
页数:12
相关论文
共 68 条
[1]   Amplifying Side Channels Through Performance Degradation [J].
Allan, Thomas ;
Brumley, Billy Bob ;
Falkner, Katrina ;
van de Pol, Joop ;
Yarom, Yuval .
32ND ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE (ACSAC 2016), 2016, :422-435
[2]  
[Anonymous], 2010, P 19 USENIX C SEC US
[3]  
Beckmann N, 2013, INT CONFER PARA, P213, DOI 10.1109/PACT.2013.6618818
[4]   Brutus: Refuting the Security Claims of the Cache Timing Randomization Countermeasure Proposed in CEASER [J].
Bodduna, Rahul ;
Ganesan, Vinod ;
Patanjali, S. L. P. S. K. ;
Veezhinathan, Kamakoti ;
Rebeiro, Chester .
IEEE COMPUTER ARCHITECTURE LETTERS, 2020, 19 (01) :9-12
[5]   CaSA: End-to-end Quantitative Security Analysis of Randomly Mapped Caches [J].
Bourgeat, Thomas ;
Drean, Jules ;
Yang, Yuheng ;
Tsai, Lillian ;
Emer, Joel ;
Yan, Mengjia .
2020 53RD ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE (MICRO 2020), 2020, :1110-1123
[6]   MI6: Secure Enclaves in a Speculative Out-of-Order Processor [J].
Bourgeat, Thomas ;
Lebedev, Ilia ;
Wright, Andrew ;
Zhang, Sizhuo ;
Arvind ;
Devadas, Srinivas .
MICRO'52: THE 52ND ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE, 2019, :42-56
[7]   An Evaluation of High-Level Mechanistic Core Models [J].
Carlson, Trevor E. ;
Heirman, Wim ;
Eyerman, Stijn ;
Hur, Ibrahim ;
Eeckhout, Lieven .
ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2014, 11 (03) :127-151
[8]  
Dessouky G, 2019, Arxiv, DOI arXiv:1909.09599
[9]  
Dessouky G, 2021, Arxiv, DOI [arXiv:2110.08139, 10.48550/arxiv.2110.08139]
[10]  
Ding BL, 2017, ADV NEUR IN, V30