【摘要】 为了解决可信计算平台直接匿名认证(DAA)方案复杂、计算开销大、应用受限等问题,进一步应对可信平台模块(TPM)计算能力的局限性,使TPM能广泛应用在嵌入式等资源受限环境,以双线性对为工具,以q强Diffie-Hellman、判定性Diffie-Hellman安全假设为基础,提出一种基于双线性对的DAA方案.经分析结果表明该方案是安全的,同时其计算效率有较大改进,有效缓解了可信平台的计算瓶颈.更多还原

【Abstract】 For solving the questions of complexities,high computation-consumings and applications limited for the direct anonymous attestation(DAA),a new DAA scheme is proposed based on bilinear maps under the assumption of q strong Diffie-Hellman and decisional Diffie-Hellman so as to match the limited computational resource of trusted platform module(TPM).It is shown that the secured scheme can efficiently relieve the computation bottleneck of trusted platform and enable TPM to be used in embedded and other resource-constrained environments.更多还原