基于Merkle树的完整性检查性能优化

Salaheddine Ouaarab, Guillaume Duc, R. Pacalet
{"title":"基于Merkle树的完整性检查性能优化","authors":"Salaheddine Ouaarab, Guillaume Duc, R. Pacalet","doi":"10.1145/2768566.2768576","DOIUrl":null,"url":null,"abstract":"Merkle hash trees are used to protect the integrity of data sets, against all kinds of attacks, including replay. They usually imply a significant storage and performance overhead. This paper introduces several proposals (hollow trees, dedicated caches) to mitigate these overheads. They have been implemented in SecBus, a software / hardware architecture protecting the external memories of a System-on-Chip.","PeriodicalId":332892,"journal":{"name":"Proceedings of the Fourth Workshop on Hardware and Architectural Support for Security and Privacy","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Performance optimizations of integrity checking based on Merkle trees\",\"authors\":\"Salaheddine Ouaarab, Guillaume Duc, R. Pacalet\",\"doi\":\"10.1145/2768566.2768576\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Merkle hash trees are used to protect the integrity of data sets, against all kinds of attacks, including replay. They usually imply a significant storage and performance overhead. This paper introduces several proposals (hollow trees, dedicated caches) to mitigate these overheads. They have been implemented in SecBus, a software / hardware architecture protecting the external memories of a System-on-Chip.\",\"PeriodicalId\":332892,\"journal\":{\"name\":\"Proceedings of the Fourth Workshop on Hardware and Architectural Support for Security and Privacy\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth Workshop on Hardware and Architectural Support for Security and Privacy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2768566.2768576\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fourth Workshop on Hardware and Architectural Support for Security and Privacy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2768566.2768576","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

默克尔哈希树用于保护数据集的完整性,防止各种攻击,包括重放。它们通常意味着巨大的存储和性能开销。本文介绍了几个建议(空心树,专用缓存)来减少这些开销。它们已经在SecBus中实现,SecBus是一种保护片上系统外部存储器的软件/硬件体系结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Performance optimizations of integrity checking based on Merkle trees
Merkle hash trees are used to protect the integrity of data sets, against all kinds of attacks, including replay. They usually imply a significant storage and performance overhead. This paper introduces several proposals (hollow trees, dedicated caches) to mitigate these overheads. They have been implemented in SecBus, a software / hardware architecture protecting the external memories of a System-on-Chip.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信