How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
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
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: 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
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
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
Discrete Applied Mathematics - Special issue: Coding and cryptography
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
Ninja: non identity based, privacy preserving authentication for ubiquitous environments
UbiComp '07 Proceedings of the 9th international conference on Ubiquitous computing
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 DAA scheme using batch proof and verification
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
Group signatures: better efficiency and new theoretical aspects
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Foundations of group signatures: the case of dynamic groups
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
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
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 a cryptographic primitive for providing anonymous signatures, and is a part of trusted computing technology from the Trusted Computing Group (TCG). DAA offers a nice balance between user authentication and privacy. One active research topic in trusted computing community is to develop DAA schemes that require minimum TPM resources. In 2010, Chen introduced a new DAA scheme using batch proof and verification. In this scheme, the TPM only needs to perform one or two exponentiations to create a DAA signature, depending on whether linkability is required. In this paper, we demonstrate an attack to this DAA scheme. The attack allows any malicious host to forge linkable DAA signatures without knowing the private key. We also present a patch to this DAA scheme to mitigate the attack. Our new DAA scheme has the same computational requirement for a TPM. We formally prove the new DAA scheme is secure in the random oracle model under the blind-4 bilinear LRSW assumption, the DDH assumption, and the gap-DL assumption.