Guaranteeing memory integrity in secure processors with Dynamic Trees

Due to the widespread software copyright violations (piracy, reverse engineering and tampering), significant efforts have been made to protect applications from host attacks. With the advent of open operating systems like Linux, it is has become even easier for adversaries to hack the OS and inflict such attacks. As a result, it is becoming increasingly difficult to trust OS for protecting software copyrights. Recently, an eXecution Only Memory (XOM) architecture has been proposed to support copy and tamper resistant software, where the program and data are stored in encrypted format outside the CPU boundary and decrypted just before being executed by the CPU. XOM uses a memory integrity verification scheme that can protect it against spoofing and splicing attacks but cannot protect it against replay attacks. In this report, we present an efficient memory-integrity verification scheme called Dynamic-Trees (or D-Trees), which eliminates these kinds of attacks and provides an efficient implementation. Dtrees create a recursive tree structure with multiple root nodes and eliminates many short-comings (higher latency for updates and limited arity) in Merkle trees. This report also presents a brief survey of existing schemes proposed to improve Merkle trees and their relative advantages and disadvantages