高技术通讯2011，Vol.21Issue(11)：1149-1156,8.DOI:10.3772/j.issn.1002-0470.2011.11.007
变长存储块Hash树完整性校验方法
A variable block size integrity verification method based on Hash tree
摘要
Abstract
Focusing on the high verification overhead of the conventional Hash tree approach for verification of memory integrity , the paper proposes a new Hash tree based scheme, the variable Block size Hash tree (VB-Htree) method. Based on the locality character of program accessing, the method divides the main memory into the hot access area and the cold access area according to the access frequency of memory blocks. In the hot access area, smaller memory blocks are set, and bigger memory blocks are set in the cold access area, and then two different Hash trees are setup respectively. The root nodes of the two Hash trees are saved in the trusted on-chip storage to verify the integrity of the untrusted external memory. The operation overhead of this method was analyzed in detail and the simulation experiments on it were carried out. The analysis and the simulation results indicate that the scheme proposed is superior to the traditional Hash tree scheme and it is a feasible scheme for memory integrity verification.关键词
完整性校验/存储器/Hash树/重放攻击/模拟器Key words
integrity verification/memory/Hash tree/replay attack/simulator引用本文复制引用
马海峰,姚念民,范洪博,蔡绍滨..变长存储块Hash树完整性校验方法[J].高技术通讯,2011,21(11):1149-1156,8.基金项目
国家自然科学基金(61073047),高效能服务器和存储技术国家重点实验室开放基金(2009HSSA08)和中央高校基本科研业务费专项资金(HEUCFT1007,HEUCF100607)资助项目. （61073047）
