基于条件谓词逻辑的可信计算形式化分析  

Formalized Analysis of Trusted Computing Based on Conditional Predicate Logic

作　　者：陈书义[1] 闻英友[1] 赵宏 

机构地区：[1]东北大学计算机软件国家工程研究中心,辽宁沈阳110004

出　　处：《华南理工大学学报（自然科学版）》2009年第5期106-110,共5页Journal of South China University of Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60602061);国家"863"计划项目(2006AA01Z413)

摘　　要：针对可信计算信任模型的形式化验证问题,提出了基于条件谓词逻辑的可信计算形式化分析方法.该方法定义了不同的谓词和推演规则,并在谓词逻辑中添加可信性的影响因素作为约束条件,实现对可信计算信任模型的形式化验证.文中还通过实例对可信计算平台的安全引导过程进行了分析,并根据分析结果提出了委托链长度受限的可信计算平台安全引导过程.结果表明,文中的方法能清晰、有效地用于可信计算信任模型的形式化分析.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.

关 键 词：信息安全 可信计算 信任链 条件谓词逻辑 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]