Elliptic curves in cryptography
Elliptic curves in cryptography
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the 11th ACM conference on Computer and communications security
Identity-based key agreement protocols from pairings
International Journal of Information Security
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
A direct anonymous attestation scheme for embedded devices
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
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
On Proofs of Security for DAA Schemes
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
A note on the Chen--Morrissey--Smart DAA scheme
Information Processing Letters
Anonymous authentication with TLS and DAA
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
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
An anonymous attestation scheme with optional traceability
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
Get shorty via group signatures without encryption
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
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
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
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
Efficient signatures of knowledge and DAA in the standard model
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
Pairings have now been used for constructive applications in cryptography for around eight years. In that time the range of applications has grown from a relatively narrow one of identity based encryption and signatures, through to more advanced protocols. In addition implementors have realised that pairing protocols once presented can often be greatly simplified or expanded using the mathematical structures of different types of pairings. In this paper we consider another advanced application of pairings, namely to the Direct Anonymous Attestation (DAA) schemes as found in the Trusted Computing Group standards. We show that a recent DAA proposal can be further optimized by transferring the underlying pairing groups from the symmetric to the asymmetric settings. This provides a more efficient and scalable solution than the existing RSA and pairing based DAA schemes.