CSpace
SpecWands: An Efficient Priority-Based Scheduler Against Speculation Contention Attacks
Tang, Bowen1,2; Wu, Chenggang1,2,3; Yew, Pen-Chung4; Zhang, Yinqian5; Xie, Mengyao1,2; Lai, Yuanming1,2; Kang, Yan1,2; Wang, Wei1,2; Wei, Qiang6; Wang, Zhe1,2
2023-12-01
发表期刊IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
ISSN0278-0070
卷号42期号:12页码:4477-4490
摘要Transient execution attacks (TEAs) have gradually become a major security threat to modern high-performance processors. They exploit the vulnerability of speculative execution to illegally access private data, and transmit them through timing-based covert channels. While new vulnerabilities are discovered continuously, the covert channels can be categorized to two types: 1) Persistent Type, in which covert channels are based on the layout changes of buffering, e.g., through caches or TLBs and 2) Volatile Type, in which covert channels are based on the contention of sharing resources, e.g., through execution units or issuing ports. The defenses against the persistent-type covert channels have been well addressed, while those for the volatile-type are still rather inadequate. Existing mitigation schemes for the volatile type such as Speculative Compression and Time-Division-Multiplexing will introduce significant overhead due to the need to stall the pipeline or to disallow resource sharing. In this article, we look into such attacks and defenses with a new perspective, and propose a scheduling-based mitigation scheme, called SpecWands. It consists of three priority-based scheduling policies to prevent an attacker from transmitting the secret in different contention situations. SpecWands not only can defend against both interthread and intrathread-based attacks but also can keep most of the performance benefit from speculative execution and resource-sharing. We evaluate its runtime overhead on SPEC 2017 benchmarks and realistic programs. The experimental results show that SpecWands has a significant performance advantage over the other two representative schemes.
关键词Resource contention scheduling strategy simultaneous multithreading (SMT) transient execution attack (TEA)
DOI10.1109/TCAD.2023.3284290
收录类别SCI
语种英语
资助项目National Natural Science Foundation of China (NSFC)
WOS研究方向Computer Science ; Engineering
WOS类目Computer Science, Hardware & Architecture ; Computer Science, Interdisciplinary Applications ; Engineering, Electrical & Electronic
WOS记录号WOS:001123254100012
出版者IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
引用统计
文献类型期刊论文
条目标识符http://119.78.100.204/handle/2XEOYT63/38859
专题中国科学院计算技术研究所
通讯作者Wang, Zhe
作者单位1.Chinese Acad Sci, Inst Comp Technol, SKLP, Beijing 100190, Peoples R China
2.Univ Chinese Acad Sci, Beijing 100049, Peoples R China
3.Zhongguancun Lab, Beijing, Peoples R China
4.Univ Minnesota, Comp Sci & Engn Dept, Minneapolis, MN 55455 USA
5.Southern Univ Sci & Technol, Dept Comp Sci & Engn, Shenzhen 518055, Peoples R China
6.State Key Lab Math Engn & Adv Comp, Zhengzhou 450000, Peoples R China
推荐引用方式
GB/T 7714
Tang, Bowen,Wu, Chenggang,Yew, Pen-Chung,et al. SpecWands: An Efficient Priority-Based Scheduler Against Speculation Contention Attacks[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS,2023,42(12):4477-4490.
APA Tang, Bowen.,Wu, Chenggang.,Yew, Pen-Chung.,Zhang, Yinqian.,Xie, Mengyao.,...&Wang, Zhe.(2023).SpecWands: An Efficient Priority-Based Scheduler Against Speculation Contention Attacks.IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS,42(12),4477-4490.
MLA Tang, Bowen,et al."SpecWands: An Efficient Priority-Based Scheduler Against Speculation Contention Attacks".IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 42.12(2023):4477-4490.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Tang, Bowen]的文章
[Wu, Chenggang]的文章
[Yew, Pen-Chung]的文章
百度学术
百度学术中相似的文章
[Tang, Bowen]的文章
[Wu, Chenggang]的文章
[Yew, Pen-Chung]的文章
必应学术
必应学术中相似的文章
[Tang, Bowen]的文章
[Wu, Chenggang]的文章
[Yew, Pen-Chung]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。