片上网络的有效时序通道保护

Yu Wang, Danfeng Zhang, Yao Wang, Ed Suh, A. Myers, Andrew Ferraiuolo, G. Suh, Nithin Michael, A. Tang, Jiang Xu, Huazhong Yang
{"title":"片上网络的有效时序通道保护","authors":"Yu Wang, Danfeng Zhang, Yao Wang, Ed Suh, A. Myers, Andrew Ferraiuolo, G. Suh, Nithin Michael, A. Tang, Jiang Xu, Huazhong Yang","doi":"10.1109/NOCS.2012.24","DOIUrl":null,"url":null,"abstract":"On-chip network is often dynamically shared among applications that are concurrently running on a chip-multiprocessor (CMP). In general, such shared resources imply that applications can affect each other's timing characteristics through interference in shared resources. For example, in on-chip networks, multiple flows can compete for links and buffers. We show that this interference is an attack vector through which a malicious application may be able to infer data-dependent information about other applications (side channel attacks), or two applications can exchange information covertly when direct communications are prohibited (covert channel attacks). To prevent these timing channel attacks, we propose an efficient scheme which uses priority-based arbitration and a static limit mechanism to provide one-way information-leak protection. The proposed technique requires minimal changes to the router hardware. The simulation results show that the protection scheme effectively eliminates a timing channel from high-security to low-security domains with minimal performance overheads for realistic traffic patterns.","PeriodicalId":6333,"journal":{"name":"2012 IEEE/ACM Sixth International Symposium on Networks-on-Chip","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"117","resultStr":"{\"title\":\"Efficient Timing Channel Protection for On-Chip Networks\",\"authors\":\"Yu Wang, Danfeng Zhang, Yao Wang, Ed Suh, A. Myers, Andrew Ferraiuolo, G. Suh, Nithin Michael, A. Tang, Jiang Xu, Huazhong Yang\",\"doi\":\"10.1109/NOCS.2012.24\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"On-chip network is often dynamically shared among applications that are concurrently running on a chip-multiprocessor (CMP). In general, such shared resources imply that applications can affect each other's timing characteristics through interference in shared resources. For example, in on-chip networks, multiple flows can compete for links and buffers. We show that this interference is an attack vector through which a malicious application may be able to infer data-dependent information about other applications (side channel attacks), or two applications can exchange information covertly when direct communications are prohibited (covert channel attacks). To prevent these timing channel attacks, we propose an efficient scheme which uses priority-based arbitration and a static limit mechanism to provide one-way information-leak protection. The proposed technique requires minimal changes to the router hardware. The simulation results show that the protection scheme effectively eliminates a timing channel from high-security to low-security domains with minimal performance overheads for realistic traffic patterns.\",\"PeriodicalId\":6333,\"journal\":{\"name\":\"2012 IEEE/ACM Sixth International Symposium on Networks-on-Chip\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"117\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE/ACM Sixth International Symposium on Networks-on-Chip\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NOCS.2012.24\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE/ACM Sixth International Symposium on Networks-on-Chip","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOCS.2012.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 117

摘要

片上网络通常在并发运行在芯片多处理器(CMP)上的应用程序之间动态共享。通常,这种共享资源意味着应用程序可以通过对共享资源的干扰来影响彼此的时序特征。例如,在片上网络中,多个流可以竞争链路和缓冲区。我们表明,这种干扰是一种攻击向量,恶意应用程序可以通过它推断有关其他应用程序的数据依赖信息(侧信道攻击),或者两个应用程序可以在禁止直接通信时秘密交换信息(隐蔽信道攻击)。为了防止这些定时信道攻击,我们提出了一种有效的方案,该方案使用基于优先级的仲裁和静态限制机制来提供单向信息泄漏保护。所提出的技术需要对路由器硬件进行最小的更改。仿真结果表明,该保护方案以最小的性能开销有效地消除了从高安全域到低安全域的时序信道。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient Timing Channel Protection for On-Chip Networks
On-chip network is often dynamically shared among applications that are concurrently running on a chip-multiprocessor (CMP). In general, such shared resources imply that applications can affect each other's timing characteristics through interference in shared resources. For example, in on-chip networks, multiple flows can compete for links and buffers. We show that this interference is an attack vector through which a malicious application may be able to infer data-dependent information about other applications (side channel attacks), or two applications can exchange information covertly when direct communications are prohibited (covert channel attacks). To prevent these timing channel attacks, we propose an efficient scheme which uses priority-based arbitration and a static limit mechanism to provide one-way information-leak protection. The proposed technique requires minimal changes to the router hardware. The simulation results show that the protection scheme effectively eliminates a timing channel from high-security to low-security domains with minimal performance overheads for realistic traffic patterns.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信