Tree-formed Verification Data for Trusted Platforms

TL;DR

This paper introduces a tree-formed verification data structure for trusted platforms, enabling more efficient and secure validation of platform components during remote attestation by using hash trees.

Contribution

It proposes a novel method to organize verification data as a hash tree, improving fault diagnosis efficiency and maintaining security with minimal hardware resources.

Findings

Logarithmic speed-up in fault search

Secure creation with limited hardware registers

Enhanced component diagnosis capabilities

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.