Abstract

Program's behavior verification is the core of trusted computing dynamic attestation. The first step of program's behavior verification is building program's trusted behavior model. Static analysis based behavior model building can cover all running paths, but there may be many ε run circuits, which can lead to the failure of dynamic attestation execution. This paper gives out an improved Floyd algorithm to find out and remove one ε run circuit with shortest length. The action is repeated until there is no ε run circuit, which can optimize the trusted behavior model. This paper also carries out one theoretical analysis of the time complexity and space complexity, the optimization method is better than the method based on the traditional algorithm of finding out all elementary circuits in directed graph. Finally, this paper does some optimization experiments about real Windows binary program's behavior model. The result shows there is a large reduction in the number of directed graph's nodes and edges in the behavior model after deleting all ε run circuits.

Paper Details