SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Algorithms for Multi-exponentiation
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Proceedings of the 11th ACM conference on Computer and communications security
The Complexity of Certain Multi-Exponentiation Techniques in Cryptography
Journal of Cryptology
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 Software-Based Trusted Platform Module Emulator
Trust '08 Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications
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
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
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A DAA scheme requiring less TPM resources
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
Pairing-Friendly elliptic curves of prime order
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
IEEE Transactions on Information Theory
A DAA scheme using batch proof and verification
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
A pairing-based DAA scheme further reducing TPM resources
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
Anonymous authentication for RFID systems
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Lightweight anonymous authentication with TLS and DAA for embedded mobile devices
ISC'10 Proceedings of the 13th international conference on Information security
Key exchange with anonymous authentication using DAA-SIGMA protocol
INTRUST'10 Proceedings of the Second international conference on Trusted Systems
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.00 |
Direct Anonymous Attestation (DAA) is an anonymous digital signature scheme that aims to provide both signer authentication and privacy. One of the properties that makes DAA an attractive choice in practice is the split signer role. In short, a principal signer (a Trusted Platform Module (TPM)) signs messages in collaboration with an assistant signer (the Host, a standard computing platform into which the TPM is embedded). This split aims to harness the high level of security offered by the TPM, and augment it using the high level of computational and storage ability offered by the Host. Our contribution in this paper is a modification to an existing pairing-based DAA scheme that significantly improves efficiency, and a comparison with the original RSA-based DAA scheme via a concrete implementation.