可信链的随机进程代数模型  

Modeling trust chain with stochastic process algebra

作　　者：刘昌平[1] 范明钰[1] 王光卫[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,成都611731

出　　处：《计算机应用研究》2010年第12期4650-4653,共4页Application Research of Computers

基　　金：国家"863"计划资助项目(2009AA01Z403;2009AA01Z435)

摘　　要：计算终端引导过程的可信链表现为顺序性,在运行过程中可信链表现出随机性。相关研究工作以计算终端引导过程的可信链建模为主。以随机进程代数为形式化描述语言,建立了一种可信链模型来描述计算终端运行过程的信任传递。该模型在随机进程代数的语法中扩展了完整性属性和完整性度量概率,建立了信任传递的语义规则,并提出了基于随机进程代数的可信链语义模型。该模型对于进一步研究可信链和计算终端的完整性具有一定的参考价值。Trust chain is one key research in trusted computing （ TC）. Trust chain exhibits ordinal property in the course of computing terminal＇s boot and stochastic property during running. This paper proposed a trust chain model based on stochastic process algebra （ SPA） to reason trust transfer. This model firstly extended syntax of SPA to meet trust chain specification. Secondly,addressed trust transfer rules in this model. These rules specified the prerequisites of trust transfer. At last,suggested a semantic model of trust chain with SPA. This model is quoteworthy to the research of maintaining trust chain and integrity of computing terminal.

关 键 词：可信链 可信计算 随机进程代数 软件行为 形式化方法 

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