The Complexity of Certain Multi-Exponentiation Techniques in Cryptography, Journal of Cryptology, vol.18, issue.4, pp.357-373, 2005. ,
DOI : 10.1007/s00145-004-0229-5
Pairing-Friendly Elliptic Curves of Prime Order, Selected Areas in Cryptography ? SAC 2005, pp.319-331, 2006. ,
DOI : 10.1007/11693383_22
Fast batch verification for modular exponentiation and digital signatures, Advances in Cryptology ? Eurocrypt '98, pp.236-250, 1998. ,
DOI : 10.1007/BFb0054130
Sort signatures without random oracles, Advances in Cryptology -EUROCRYPT 2004, pp.56-73, 2004. ,
DOI : 10.1007/978-3-540-24676-3_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5374
Direct anonymous attestation, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.132-145, 2004. ,
DOI : 10.1145/1030083.1030103
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.5041
Direct anonymous attestation in context, IEEE London, pp.143-174, 2005. ,
Simplified security notions of direct anonymous attestation and a concrete scheme from pairings, International Journal of Information Security, vol.4, issue.3, pp.315-330, 2009. ,
DOI : 10.1007/s10207-009-0076-3
A New Direct Anonymous Attestation Scheme from Bilinear Maps, Trusted Computing -Challenges and Applications ? TRUST 2008, pp.166-178, 2008. ,
DOI : 10.1007/978-3-540-68979-9_13
Enhanced privacy id, Proceedings of the 2007 ACM workshop on Privacy in electronic society , WPES '07, pp.21-30, 2007. ,
DOI : 10.1145/1314333.1314337
Enhanced privacy ID from bilinear pairing. Cryptology ePrint Archive, Report, vol.095, p.95, 2009. ,
Signature Schemes and Anonymous Credentials from Bilinear Maps, Advances in Cryptology ? CRYPTO 2004, pp.56-72, 2004. ,
DOI : 10.1007/978-3-540-28628-8_4
Group signatures Advances in Cryptology ? EURO- CRYPT '91, LNCS, vol.547, pp.257-265, 1991. ,
A DAA Scheme Requiring Less TPM Resources, Conference on Information Security and Cryptology -Inscrypt, 2009. ,
DOI : 10.1007/978-3-642-16342-5_26
A note on the Chen-Morrissey-Smart direct anonymous attestation scheme ,
Pairings in Trusted Computing, Pairings in Cryptography ? Pairing, pp.1-17, 2008. ,
DOI : 10.1007/978-3-540-85538-5_1
On Proofs of Security for DAA Schemes, Provable Security ? ProvSec, pp.167-175, 2008. ,
DOI : 10.1007/978-3-540-73275-4_16
DAA: Fixing the pairing based protocols. Cryptology ePrint Archive, Report, 0198. ,
Identity-based key agreement protocols from pairings, International Journal of Information Security, vol.10, issue.4, pp.213-242, 2007. ,
DOI : 10.1007/s10207-006-0011-9
Direct Anonymous Attestation for Next Generation TPM, Journal of Computers, vol.3, issue.12, pp.43-50, 2008. ,
DOI : 10.4304/jcp.3.12.43-50
Pairings for cryptographers, Discrete Applied Mathematics, vol.156, issue.16, pp.3113-3121, 2008. ,
DOI : 10.1016/j.dam.2007.12.010
On computing products of pairings. Cryptology ePrint Archive, Report, vol.172172, 2006. ,
The Eta Pairing Revisited, IEEE Transactions on Information Theory, vol.52, issue.10, pp.4595-4602, 2006. ,
DOI : 10.1109/TIT.2006.881709
Pseudonym Systems, Selected Areas in Cryptography ? SAC 1999, pp.184-199, 1999. ,
DOI : 10.1007/3-540-46513-8_14
Algorithms for Multi-exponentiation, Selected Areas in Cryptography ? SAC 2001, pp.165-180, 2001. ,
DOI : 10.1007/3-540-45537-X_13
TCG TPM specification 1.2, 2003. ,
A Software-Based Trusted Platform Module Emulator, Trusted Computing and Trust in Information Technologies ? TRUST 2008, pp.33-47, 2008. ,
DOI : 10.1007/978-3-540-68979-9_3