Paper 2014/120

Automated Proof for Authorization Protocols of TPM 2.0 in Computational Model (full version)

Weijin Wang, Yu Qin, Dengguo Feng, and Xiaobo Chu


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.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. MINOR revision.ISPEC2014
TPMTrusted Computingformal methodscomputational modelauthorization
Contact author(s)
wangweijin @ tca iscas ac cn
2014-03-03: last of 2 revisions
2014-02-24: received
See all versions
Short URL
Creative Commons Attribution


      author = {Weijin Wang and Yu Qin and Dengguo Feng and Xiaobo Chu},
      title = {Automated Proof for Authorization Protocols of TPM 2.0 in Computational Model (full version)},
      howpublished = {Cryptology ePrint Archive, Paper 2014/120},
      year = {2014},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.