Paper 2010/008
A DAA Scheme Requiring Less TPM Resources
Liqun Chen
Abstract
Direct anonymous attestation (DAA) is a special digital signature
primitive, which provides a balance between signer authentication
and privacy. One of the most interesting properties that makes this
primitive attractive in practice is its construction of signers. The
signer role of DAA is split between two entities, a principal signer
(a trusted platform module (TPM)) with limited computational
capability and an assistant signer (a computer platform into which
the TPM is embedded) with more computational power but less security
tolerance. Our first contribution in this paper is a new DAA scheme
that requires very few TPM resources. In fact the TPM has only
to perform two exponentiations for the DAA Join algorithm and three
exponentiations for the DAA Signing algorithm. We show that
this new scheme has better performance than the
existing DAA schemes and is provable secure based on the
Metadata
- Available format(s)
-
PDF
PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- direct anonymous attestationtrusted platform modulebilinear map
- Contact author(s)
- liqun chen @ hp com
- History
- 2010-01-12: received
- Short URL
- https://ia.cr/2010/008
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/008,
author = {Liqun Chen},
title = {A {DAA} Scheme Requiring Less {TPM} Resources},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/008},
year = {2010},
url = {https://eprint.iacr.org/2010/008}
}
