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.