Institutional Repository
| Formal analysis of TPM2.0 key management APIs | |
| Zhang, Qianying; Zhao, Shijun; Qin, Yu; Feng, Dengguo | |
| 2014 | |
| Source | CHINESE SCIENCE BULLETIN
 |
| ISSN | 1001-6538 |
| Volume | 59Issue:32Pages:4210-4224 |
| English Abstract | The trusted platform module (TPM), a system component implemented on physical resources, is designed to enable computers to achieve a higher level of security than the security level that it is possible to achieve by software alone. For this reason, the TPM provides a way to store cryptographic keys and other sensitive data in its memory, which is shielded from access by any entity other than the TPM. Users who want to use those keys and data to achieve some security goals are restricted to interact with the TPM through its APIs defined in the TPM specification. Therefore, whether the TPM can provide Protected Capabilities it claimed depends to a large extent on the security of its APIs. In this paper, we devise a formal model, which is accessible to a fully mechanized analysis, for the key management APIs in the TPM2.0 specification. We identify and formalize security properties of these APIs in our model and then successfully use the automated prover Tamarin to obtain the first mechanized analysis of them. The analysis shows that the key management subset of TPM APIs preserves the secrecy of non-duplicable keys for unbounded numbers of fresh keys and handles. The analysis also reports that the key duplication mechanism, used to duplicate a key between two hierarchies, is vulnerable to impersonation attacks, which enable an adversary to recover the duplicated key of the originating hierarchy or import his own key into the destination hierarchy. Aiming at avoiding these vulnerabilities, we propose an approach, which restricts the originating and destination TPMs to authenticate each other's identity during duplication. Then we formally demonstrate that our approach maintains the secrecy of duplicable keys when they are duplicated.; The trusted platform module (TPM), a system component implemented on physical resources, is designed to enable computers to achieve a higher level of security than the security level that it is possible to achieve by software alone. For this reason, the TPM provides a way to store cryptographic keys and other sensitive data in its memory, which is shielded from access by any entity other than the TPM. Users who want to use those keys and data to achieve some security goals are restricted to interact with the TPM through its APIs defined in the TPM specification. Therefore, whether the TPM can provide Protected Capabilities it claimed depends to a large extent on the security of its APIs. In this paper, we devise a formal model, which is accessible to a fully mechanized analysis, for the key management APIs in the TPM2.0 specification. We identify and formalize security properties of these APIs in our model and then successfully use the automated prover Tamarin to obtain the first mechanized analysis of them. The analysis shows that the key management subset of TPM APIs preserves the secrecy of non-duplicable keys for unbounded numbers of fresh keys and handles. The analysis also reports that the key duplication mechanism, used to duplicate a key between two hierarchies, is vulnerable to impersonation attacks, which enable an adversary to recover the duplicated key of the originating hierarchy or import his own key into the destination hierarchy. Aiming at avoiding these vulnerabilities, we propose an approach, which restricts the originating and destination TPMs to authenticate each other's identity during duplication. Then we formally demonstrate that our approach maintains the secrecy of duplicable keys when they are duplicated. |
| Indexed Type | SCI |
| Keyword | Trusted Computing Tpm2.0 Security Apis Key Management Secrecy Formal Analysis |
| Department | [Zhang, Qianying; Zhao, Shijun; Qin, Yu; Feng, Dengguo] Chinese Acad Sci, Inst Software, Trusted Comp & Informat Assurance Lab, Beijing 100190, Peoples R China. |
| Language | 英语 |
| WOS ID | WOS:000342451800006 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16803 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Zhang, Qianying,Zhao, Shijun,Qin, Yu,et al. Formal analysis of TPM2.0 key management APIs[J]. CHINESE SCIENCE BULLETIN,2014,59(32):4210-4224. |
| APA | Zhang, Qianying,Zhao, Shijun,Qin, Yu,&Feng, Dengguo.(2014).Formal analysis of TPM2.0 key management APIs.CHINESE SCIENCE BULLETIN,59(32),4210-4224. |
| MLA | Zhang, Qianying,et al."Formal analysis of TPM2.0 key management APIs".CHINESE SCIENCE BULLETIN 59.32(2014):4210-4224. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment