| Title: | Automated proof for authorization protocols of TPM 2.0 in computational model |
| Author: | Wang, Weijin (1)
; Qin, Yu (1)
; Feng, Dengguo (1)
|
| Conference Name: | 10th International Conference on Information Security Practice and Experience, ISPEC 2014
|
| Conference Date: | May 5, 2014 - May 8, 2014
|
| Issued Date: | 2014
|
| Conference Place: | Fuzhou, China
|
| Publish Place: | Springer Verlag
|
| Indexed Type: | EI
|
| ISSN: | 3029743
|
| ISBN: | 9783319063195
|
| Department: | (1) Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing, China
|
| Abstract: | 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. |
| English Abstract: | 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. |
| Language: | 英语
|
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/16620
|
| Appears in Collections: | 软件所图书馆_会议论文
|
|
There are no files associated with this item.
|
| Recommended Citation: | |
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.
|
|
|
