非对称hash树存储器完整性保护方法  

Memory Integrity Protection Method Based on Asymmetric Hash Tree

作　　者：马海峰[1] 姚念民[2] 宋井峰[1] 

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

出　　处：《小型微型计算机系统》2014年第10期2341-2346,共6页Journal of Chinese Computer Systems

基　　金：黑龙江省教育厅科研项目(12533052)资助

摘　　要：目前针对存储系统的攻击行为层出不穷,以hash树为代表的数据完整性保护机制可以防范此类攻击,但hash树方法的计算开销很大.针对此问题,提出一种hash树的优化方法,它利用程序访问的局部性特征,根据存储块的访问频率将内存块划分为两部分,再对其分别构建hash树,在访问频率较高的区域设较低的hash树,在访问频率较低的区域设较高的hash树.文中对提出方法的操作代价进行了详细分析,并进行了模拟实验,分析和实验结果表明,提出的方法相对CHTree树和M-Tree方法有明显的性能提升,是一种可行的存储器完整性保护方案.At present, attack behaviors on the storage system are emerging in endlessly. Represented by hash tree of data integrity pro- tection mechanism can prevent this type of attack, but the computational overhead of hash tree method is too high. Focusing on this question, utilizing the locality character of program accessing, a hash tree optimize method is proposed. According to access frequency of memory blocks, main memory is divided into two parts which used to build hash tree respectively. Lower hash tree is set in high ac- cess frequency area and higher hash tree is set in low access frequency area. The operation overhead of proposed method is analyzed in detail and the simulation experiments are carded out. The analysis and the simulation results indicated that this method has obviously improvement over hash tree scheme and is a feasible scheme for memory integrity protection.

关 键 词：存储器 完整性 机密性 哈希树 重放攻击 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]