A DAA scheme using batch proof and verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6101 LNCS, Issue , 2010, Pages 166-180

  Chen, Liqun ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

batch proof and verification; direct anonymous attestation

Indexed keywords

COMPUTATIONAL WORKLOAD; CRYPTOGRAPHIC PRIMITIVES; DIRECT ANONYMOUS ATTESTATION; DIRECT ANONYMOUS ATTESTATIONS; EXPONENTIATIONS; LINKABILITY; TRUSTED COMPUTING GROUPS; TRUSTED COMPUTING TECHNOLOGY; TRUSTED PLATFORM MODULE; USER AUTHENTICATION;

AUTHENTICATION; THERMOELECTRIC POWER;

SECURITY OF DATA;

EID: 77954709878     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13869-0_11     Document Type: Conference Paper

References (33)

1. Bellare, M., Garay, J.A., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 236-250. Springer, Heidelberg (1998)
2. Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 614-629. Springer, Heidelberg (2003)
3. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: The 1st ACM Conference on Computer and Communications Security, pp. 62-73. ACM Press, New York (1993)
4. Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56-73. Springer, Heidelberg (2004)
5. Boyd, C., Pavlovski, C.: Attacking and repairing batch verification schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 58-71. Springer, Heidelberg (2000)
6. Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In: The 11th ACM Conference on Computer and Communications Security, pp. 132-145. ACM Press, New York (2004)
7. Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation in context. In: Mitchell (ed.) Trusted Computing, ch. 5, pp. 143-174. IEEE, Los Alamitos (2005)
8. Brickell, E., Chen, L., Li, J.: Simplified security notions for direct anonymous attestation and a concrete scheme from pairings. Int. Journal of Information Security 8, 315-330 (2009)
9. Brickell, E., Chen, L., Li, J.: A new direct anonymous attestation scheme from bilinear maps. In: Lipp, P., Sadeghi, A.-R., Koch, K.-M. (eds.) Trust 2008. LNCS, vol. 4968, pp. 166-178. Springer, Heidelberg (2008)
10. Brickell, E., Li, J.: Enhanced privacy ID: A direct anonymous attestation scheme with enhanced revocation capabilities. In: The 6th ACM Workshop on Privacy in the Electronic Society - WPES 2007, pp. 21-30. ACM Press, New York (2007)
11. Brickell, E., Li, J.: Enhanced privacy ID from bilinear pairing. Cryptology ePrint Archive. Report 2009/095, http://eprint.iacr.org/2009/095
12. Brickell, E., Li, J.: A pairing-based DAA scheme furhter reducing TPM resources. In: Acquisti, A., Smith, S.W., Sadeghi, A.-R. (eds.) TRUST 2010. LNCS, vol. 6101. Springer, Heidelberg (2010)
13. Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56-72. Springer, Heidelberg (2004)
14. Chen, L.: A DAA scheme requiring less TPM resources. In: The Proceedings of the 5th China International Conference on Information Security and Cryptology - Inscrypt 2009. The full paper is in Cryptology ePrint Archive. Report 2010/008 (2009), http://eprint.iacr.org/2010/008
15. Chen, L., Cheng, Z., Smart, N.P.: Identity-based key agreement protocols from pairings. Int. Journal of Information Security 6, 213-242 (2007)
16. Chen, L., Li, J.: A note on the Chen-Morrissey-Smart DAA scheme (preprint)
17. Chen, L., Morrissey, P., Smart, N.P.: Pairings in trusted computing. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 1-17. Springer, Heidelberg (2008)
18. Chen, L., Morrissey, P., Smart, N.P.: On proofs of security of DAA schemes. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol. 5324, pp. 156-175. Springer, Heidelberg (2008)
19. Chen, L., Morrissey, P., Smart, N.P.: DAA: Fixing the pairing based protocols. Cryptology ePrint Archive. Report 2009/198, http://eprint.iacr.org/ 2009/198
20. Chen, X., Feng, D.: Direct anonymous attestation for next generation TPM. Journal of Computers 3(12), 43-50 (2008)
21. Chen, L., Page, D., Smart, N.P.: On the design and implementation of an efficient DAA scheme. In: Gollmann, D. (ed.) CARDIS 2010. LNCS, vol. 6035, pp. 223-238. Springer, Heidelberg (2010)
22. Galbraith, S., Paterson, K., Smart, N.P.: Pairings for cryptographers. Discrete Applied Mathematics 156, 3113-3121 (2008)
23. Ge, H., Tate, S.R.: A Direct anonymous attestation scheme for embedded devices. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 16-30. Springer, Heidelberg (2007)
24. Granger, R., Smart, N.P.: On computing products of pairings. Cryptology ePrint Archive. Report 2006/172, http://eprint.iacr.org/2006/172
25. Hoshino, F., Abe, M., Kobayashi, T.: Lenient/strict batch verification in several groups. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol. 2200, pp. 81-94. Springer, Heidelberg (2001)
26. ISO/IEC 11889:2009 Information technology - Security techniques - Trusted Platform Module
27. ISO/IEC 14888-3 Information technology - Security techniques - Digital signatures with appendix - Part 3: Discrete logarithm based mechanisms
28. Leung, A., Chen, L., Mitchell, C.J.: On a possible privacy flaw in direct anonymous attestation (DAA). In: Lipp, P., Sadeghi, A.-R., Koch, K.-M. (eds.) Trust 2008. LNCS, vol. 4968, pp. 179-190. Springer, Heidelberg (2008)
29. Lysyanskaya, A., Rivest, R., Sahai, A., Wolf, S.: Pseudonym systems. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol. 1758, pp. 184-199. Springer, Heidelberg (2000)
30. Peng, K., Boyd, C., Dawson, E.: Batch zero-knowledge proof and verification and its applications. ACM Trans. Inf. Syst. Secur. Article 6, 10(2) (2007)
31. Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239-252. Springer, Heidelberg (1990)
32. Smyth, B., Chen, L., Ryan, M.: Direct Anonymous Attestation (DAA): Ensuring privacy with corrupt administrators. In: Stajano, F., Meadows, C., Capkun, S., Moore, T. (eds.) ESAS 2007. LNCS, vol. 4572, pp. 218-231. Springer, Heidelberg (2007)
33. Trusted Computing Group. TCG TPM specification 1.2 (2003), http://www.trustedcomputinggroup.org