English

Tree-formed Verification Data for Trusted Platforms

Cryptography and Security 2013-01-24 v4

Abstract

The establishment of trust relationships to a computing platform relies on validation processes. Validation allows an external entity to build trust in the expected behaviour of the platform based on provided evidence of the platform's configuration. In a process like remote attestation, the 'trusted' platform submits verification data created during a start up process. These data consist of hardware-protected values of platform configuration registers, containing nested measurement values, e.g., hash values, of loaded or started components. Commonly, the register values are created in linear order by a hardware-secured operation. Fine-grained diagnosis of components, based on the linear order of verification data and associated measurement logs, is not optimal. We propose a method to use tree-formed verification data to validate a platform. Component measurement values represent leaves, and protected registers represent roots of a hash tree. We describe the basic mechanism of validating a platform using tree-formed measurement logs and root registers and show an logarithmic speed-up for the search of faults. Secure creation of a tree is possible using a limited number of hardware-protected registers and a single protected operation. In this way, the security of tree-formed verification data is maintained.

Keywords

Cite

@article{arxiv.1007.0642,
  title  = {Tree-formed Verification Data for Trusted Platforms},
  author = {Andreas U. Schmidt and Andreas Leicher and Yogendra Shah and Inhyok Cha},
  journal= {arXiv preprint arXiv:1007.0642},
  year   = {2013}
}

Comments

15 pages, 11 figures, v3: Reference added, v4: Revised, accepted for publication in Computers and Security

R2 v1 2026-06-21T15:44:25.571Z