arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1007.0642cs.CR
收藏

可信平台的树型验证数据

Tree-formed Verification Data for Trusted Platforms

Andreas U. Schmidt, Andreas Leicher, Yogendra Shah, Inhyok Cha

摘要:

与计算平台的信任关系的建立依赖于验证过程。验证允许外部实体基于所提供的平台配置证据来建立对平台预期行为的信任。在类似远程认证的过程中,“可信”平台提交在启动过程中创建的验证数据。这些数据由平台配置寄存器的硬件保护值组成,包含嵌套的测量值,例如,已加载或已启动组件的哈希值。通常,寄存器值通过硬件安全操作以线性顺序创建。基于验证数据和相关测量日志的线性顺序的细粒度组件诊断不是最佳的。我们提出了一种方法来使用树形式的验证数据来验证一个平台。组件测量值表示哈希树的叶子,而受保护的寄存器表示哈希树的根。我们描述了使用树形测量日志和根寄存器验证平台的基本机制,并显示了对数加速搜索故障。使用有限数量的硬件保护寄存器和单个受保护操作可以安全地创建树。以这种方式,保持了树形验证数据的安全性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑