【24h】

A New Direct Anonymous Attestation Scheme from Bilinear Maps

机译:双线性映射的一种新的直接匿名证明方案

获取原文

摘要

The Direct Anonymous Attestation scheme was proposed by Brickell, Jan Camenisch,Liqun Chen and was adopted by the Trusted Computing Group in its specifications for trusted computing platforms. In this paper, We propose a new direct anonymous scheme from the bilinear maps based on the decisional Diffie- Hellman assumption and q-SDH assumption. The length of private keys and signatures in our scheme are much shorter than the lengths in the original DAA scheme, and has better computational performance. We analyze the security of the proposed scheme, it shows that the scheme meets the security requirements of unforgeability,variable anonymity and unlinkability. Our scheme gives a practical solution for ECC-based TPM on protecting the privacy of the TPM.
机译:直接匿名证明计划由Brickell,Jan Camenisch,Liqun Chen提出,并由Trusted Computing Group在其针对可信计算平台的规范中采用。在本文中,我们基于决策Diffie-Hellman假设和q-SDH假设,从双线性映射中提出了一种新的直接匿名方案。我们方案中的私钥和签名的长度比原始DAA方案中的长度短得多,并且具有更好的计算性能。通过对所提方案的安全性分析,表明该方案满足了不可伪造,可变匿名和不可链接的安全要求。我们的方案为基于ECC的TPM提供了一种保护TPM隐私的实用解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号