Abstract
Direct anonymous attestation (DAA) is an attractive cryptographic primitive, that is not only because it provides a balance between user authentication and privacy in an elegant way, but also because it is a part of the trusted computing technology from the Trusted Computing Group (TCG). However, in the TCG related community, DAA has a bad reputation of its cost for the Trusted Platform Module (TPM) resources. Researchers have recently worked out a number of DAA schemes, which require much less TPM resources than the one used by TCG. Our contribution in this paper is a new DAA scheme that makes use of an efficient batch proof and verification scheme to reduce the TPM computational workload. In our scheme, for the DAA Signing operation, the TPM needs only to perform one exponentiation (when linkability is not required) and two exponentiations (when linkability is required). This operation requires at least three exponentiations in the existing DAA schemes that provide the same functionality.