变长存储块Hash树完整性校验方法  

A variable block size integrity verification method based on Hash tree

作　　者：马海峰[1,2] 姚念民[1] 范洪博 蔡绍滨[1] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001 [2]黑龙江科技学院计算机与信息工程学院,哈尔滨150027

出　　处：《高技术通讯》2011年第11期1149-1156,共8页Chinese High Technology Letters

基　　金：匡l家自然科学基金（61073047）,高效能服务器和存储技术国家重点实验室开放基金（2009HSSA08）和中央高校基本科研业务费专项资金（HEUCFT1007,HEUCF100607）资助项目.

摘　　要：针对Hash树方法校验存储器完整性代价大的问题，提出了一种新的基于Hash树的检验方法——变长存储块Hash树（VB-HTree）方法。它基于程序访问的局部性特征，按存储块的访问频率将存储器划分为热访问区和冷访问区。在热访问区设置较小尺寸的存储块，在冷访问区设置较大尺寸的存储块，分别建立不同的Hash树。在可信的片内存储区保存Hash树的根结点，以此校验不可信外部内存的数据完整性。对操作代价进行了较为详细的分析，并开展了模拟实验。分析和模拟结果表明，VB-HTree方法优于传统的Hash树方法．是一种可行的内存完整性校验方案。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树 重放攻击 模拟器 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]