论文部分内容阅读
目前针对存储系统的攻击行为层出不穷,以hash树为代表的数据完整性保护机制可以防范此类攻击,但hash树方法的计算开销很大.针对此问题,提出一种hash树的优化方法,它利用程序访问的局部性特征,根据存储块的访问频率将内存块划分为两部分,再对其分别构建hash树,在访问频率较高的区域设较低的hash树,在访问频率较低的区域设较高的hash树.文中对提出方法的操作代价进行了详细分析,并进行了模拟实验,分析和实验结果表明,提出的方法相对CHTree树和M-Tree方法有明显的性能提升,是一种可行的存储器完整性保护方案.
At present, attacks against storage systems emerge in an endless stream, and data integrity protection mechanism represented by hash tree can prevent such attacks, but hash tree method is computationally expensive.Aiming at this problem, a method of hash tree optimization By using the local characteristics of program access, the memory block is divided into two parts according to the access frequency of the memory block, and then the hash tree is constructed separately, the lower hash tree is set in the high-frequency access area, The higher hash tree in the region.The paper analyzes the operation cost of the proposed method in detail and carries out simulation experiments.The results show that the proposed method has obvious performance improvement over CHTree tree and M-Tree method and is A viable memory integrity protection scheme.