ISCAS OpenIR
Automated proof for authorization protocols of TPM 2.0 in computational model
Wang, Weijin (1); Qin, Yu (1); Feng, Dengguo (1)
2014
会议名称10th International Conference on Information Security Practice and Experience, ISPEC 2014
页码144-158
会议日期May 5, 2014 - May 8, 2014
会议地点Fuzhou, China
收录类别EI
出版地Springer Verlag
ISSN3029743
ISBN9783319063195
部门归属(1) Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing, China
摘要We present the first automated proof of the authorization protocols in TPM 2.0 in the computational model. The Trusted Platform Module(TPM) is a chip that enables trust in computing platforms and achieves more security than software alone. The TPM interacts with a caller via a predefined set of commands. Many commands reference TPM-resident structures, and use of them may require authorization. The TPM will provide an acknowledgement once receiving an authorization. This interact ensure the authentication of TPM and the caller. In this paper, we present a computationally sound mechanized proof for authorization protocols in the TPM 2.0. We model the authorization protocols using a probabilistic polynomial-time calculus and prove authentication between the TPM and the caller with the aid of the tool CryptoVerif, which works in the computational model. In addition, the prover gives the upper bounds to break the authentication between them. © 2014 Springer International Publishing.; We present the first automated proof of the authorization protocols in TPM 2.0 in the computational model. The Trusted Platform Module(TPM) is a chip that enables trust in computing platforms and achieves more security than software alone. The TPM interacts with a caller via a predefined set of commands. Many commands reference TPM-resident structures, and use of them may require authorization. The TPM will provide an acknowledgement once receiving an authorization. This interact ensure the authentication of TPM and the caller. In this paper, we present a computationally sound mechanized proof for authorization protocols in the TPM 2.0. We model the authorization protocols using a probabilistic polynomial-time calculus and prove authentication between the TPM and the caller with the aid of the tool CryptoVerif, which works in the computational model. In addition, the prover gives the upper bounds to break the authentication between them. © 2014 Springer International Publishing.
语种英语
内容类型会议论文
URI标识http://ir.iscas.ac.cn/handle/311060/16620
专题中国科学院软件研究所
推荐引用方式
GB/T 7714
Wang, Weijin ,Qin, Yu ,Feng, Dengguo . Automated proof for authorization protocols of TPM 2.0 in computational model[C]. Springer Verlag,2014:144-158.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Wang, Weijin (1)]的文章
[Qin, Yu (1)]的文章
[Feng, Dengguo (1)]的文章
百度学术
百度学术中相似的文章
[Wang, Weijin (1)]的文章
[Qin, Yu (1)]的文章
[Feng, Dengguo (1)]的文章
必应学术
必应学术中相似的文章
[Wang, Weijin (1)]的文章
[Qin, Yu (1)]的文章
[Feng, Dengguo (1)]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。