摘要： 对平台配置远程证明机制的验证效率进行研究，指出现有平台配置证明机制没有考虑应用软件完整性度量值的查询频率，致使所有待查询应用软件完整性度量值的查询路径长度相同，这大大加长了平均查询路径的长度。为此，提出一种平台配置远程证明机制。依据不同应用软件完整性度量值的查询概率分布，构建一棵应用软件完整性度量值的哈夫曼树，使得查询频繁的应用软件完整性度量值节点获得较短的查询路径。结果表明，该机制可缩短应用软件完整性度量值的平均查询路径长度，提高验证效率。

关键词: 可信计算, 远程证明, 验证效率, 隐私保护, Merkle哈希树, Huffman树

Abstract: The performance of verification in remote attestation is discussed. Existing methods do not take query frequency of application software integrity metrics into consideration. So the query path length of every application software integrity metrics is equal. It directly makes the average query path length of application software integrity metrics become so long. A mechanism presented builds a Huffman tree according to application software integrity metrics probability distribution of inquires, which makes a node inquired frequently get a shorter query path. Results show the average query path gets shorter. And the efficiency of the verification is improved highly.

Key words: trusted computing, remote attestation, verification efficiency, privacy protection, Merkle hash tree, Huffman tree

中图分类号: 

• TP309