Wuhan University Journal of Natural Sciences

, Volume 15, Issue 3, pp 195–200

Static analysis-based behavior model building for trusted computing dynamic verification

Article

Abstract

Current trusted computing platform only verifies application’s static Hash value, it could not prevent application from being dynamic attacked. This paper gives one static analysis-based behavior model building method for trusted computing dynamic verification, including control flow graph (CFG) building, finite state automata (FSA) constructing, ɛ run cycle removing, ɛ transition removing, deterministic finite state (DFA) constructing, trivial FSA removing, and global push down automata (PDA) constructing. According to experiment, this model built is a reduced model for dynamic verification and covers all possible paths, because it is based on binary file static analysis.

Key words

trusted computing dynamic verification behavior model finite-state automata (FSA) push down automata (PDA) 

CLC number

TP 391 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Wuhan University and Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.School of ComputerWuhan UniversityWuhanHubei, China
  2. 2.Key Laboratory of Aerospace Information Security and Trusted Computing of Ministry of EducationWuhan UniversityWuhanHubei, China

Personalised recommendations