Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Attacking and Repairing Batch Verification Schemes
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Lenient/Strict Batch Verification in Several Groups
ISC '01 Proceedings of the 4th International Conference on Information Security
Proceedings of the 11th ACM conference on Computer and communications security
Batch zero-knowledge proof and verification and its applications
ACM Transactions on Information and System Security (TISSEC)
Identity-based key agreement protocols from pairings
International Journal of Information Security
Enhanced privacy id: a direct anonymous attestation scheme with enhanced revocation capabilities
Proceedings of the 2007 ACM workshop on Privacy in electronic society
A New Direct Anonymous Attestation Scheme from Bilinear Maps
Trust '08 Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications
On a Possible Privacy Flaw in Direct Anonymous Attestation (DAA)
Trust '08 Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Discrete Applied Mathematics
On Proofs of Security for DAA Schemes
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Simplified security notions of direct anonymous attestation and a concrete scheme from pairings
International Journal of Information Security
A direct anonymous attestation scheme for embedded devices
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Direct anonymous attestation (DAA): ensuring privacy with corrupt administrators
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
A pairing-based DAA scheme further reducing TPM resources
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
A DAA scheme requiring less TPM resources
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
On the design and implementation of an efficient DAA scheme
CARDIS'10 Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Application
Direct anonymous attestation: enhancing cloud service user privacy
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part II
Revocation of direct anonymous attestation
INTRUST'10 Proceedings of the Second international conference on Trusted Systems
Mutual remote attestation: enabling system cloning for TPM based platforms
STM'11 Proceedings of the 7th international conference on Security and Trust Management
A (corrected) DAA scheme using batch proof and verification
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Flexible and scalable digital signatures in TPM 2.0
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.01 |
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.