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 |
| 会议日期 | May 5, 2014 - May 8, 2014 |
| 会议地点 | Fuzhou, China |
| 页码 | 144-158 |
| 中文摘要 | 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. |
| 收录类别 | EI |
| 会议录出版地 | Springer Verlag |
| 语种 | 英语 |
| ISSN号 | 3029743 |
| ISBN号 | 9783319063195 |
| 源URL | [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]. 见:10th International Conference on Information Security Practice and Experience, ISPEC 2014. Fuzhou, China. May 5, 2014 - May 8, 2014. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。