An Optimized Anonymous Attestation Protocol from Bilinear Pairing

With the development of Internet-based computing, we can no longer trust them to sustain the applications we depend on because IT infrastructure technologies fail to keep pace with emerging threats. Direct Anonymous Attestation (DAA) enables remote authentication of a user while preserving privacy under the user´s control. The existing protocols for direct anonymous attestation of Trusted Platform Module (TPM) with limited storage space and communication capability could not satisfy the higher requirements of performance and security. From bilinear pairings, this paper proposes an optimized DAA protocol. The analysis result of the proposed protocol shows that cost of TPM remains lower than the BCL-DAA scheme and the computational cost of host and verifier are highly reduced. Furthermore, the proposed scheme is secure in the random oracle model under the l-MOMSDH assumption.