Journal of South China University of Technology (Natural Science Edition) ›› 2009, Vol. 37 ›› Issue (5): 106-110.

• Computer Science & Technology • Previous Articles     Next Articles

Formalized Analysis of Trusted Computing Based on Conditional Predicate Logic

Chen Shu-yi  Wen Ying-you  Zhao Hong   

  1. National Engineering Research Center for Computer Software, Northeastern University, Shenyang 110004, Liaoning, China
  • Received:2008-06-17 Revised:2008-08-31 Online:2009-05-25 Published:2009-05-25
  • Contact: 陈书义(1972-),男,博士生,主要从事网络与信息安全研究. E-mail:csy656@163.com
  • About author:陈书义(1972-),男,博士生,主要从事网络与信息安全研究.
  • Supported by:

    国家自然科学基金资助项目(60602061);国家“863”计划项目(2006AA012413)

Abstract:

A formalized analysis method of trusted computing is proposed based on conditional predicate logic which fomally verifies trusted computing models. In this method, different predicates and reasoning rules are defined, and the factors to influence the credibility are added in the predicate logic as constraint conditions. Thus, the trusted computing models are successfully verified. Moreover, the secure bootstrap process of the trusted computing plat- form is analyzed via an example, and a secure bootstrap process of the trusted computing platform with constrained delegation length is proposed. The results show that the proposed method can be clearly and effectively used for the formalized analysis of trusted computing models.

Key words: information security, trusted computing, trust chain, conditional predicate logic