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.