Memory Integrity Protection Method based on Asymmetric Hash Tree

摘要：

　　Focus on this question of high verification overhead of hash tree memory protection scheme,this paper proposed a hash tree optimize method called AH-Tree.Utilizing the locality character of memory accessing,the memory is divided into two parts and an asymmetric hash tree (AH-Tree) is constructed.The advantage of AH-Tree is low average operation overhead.The analysis and experiment results proved that the proposed scheme has shorter average verification path and better verify efficiency than hash tree scheme.AH-Tree is a feasible memory integrity protection scheme.

关键词： memory integrity replay attacks hash tree

作者: Ma Haifeng Chengjie Gao Zhenguo

作者单位: Computer and Information Engineering Institute Heilongjiang University of Science and Technology Har Computer and Information Engineering Institute Heilongjiang University of Science and Technology Har Institute of automation Harbin Engineering University Harbin,China

会议类型: 国际会议

会议名称: The 13th International Symposium on Distributed Computing and Applications to Business,Engineering and Science(DCABES 2014)(第十三届分布式计算及其应用国际学术研讨会)

会议地点: 湖北咸宁

会议语种:英文

页码: 263-267

在线出版日期: 2014-11-24（万方平台首次上网日期，不代表论文的发表时间）