The DAA scheme in context

Trusted Computing

Volumn , Issue , 2005, Pages 143-174

  Brickell, Ernie ^a   Camenisch, Jan ^a   Chen, Liqun ^a  

^a NONE

Author keywords

DAA; Direct anonymous attestation; Remote anonymous authentication; Security model; Security of data; TCG specification; TPM authentication; Trusted computing group; Trusted platform module

Indexed keywords

AUTHENTICATION; HARDWARE SECURITY; SECURITY OF DATA; SPECIFICATIONS;

ANONYMOUS AUTHENTICATION; DIRECT ANONYMOUS ATTESTATIONS; IN CONTEXTS; SECURITY MODEL; TRUSTED COMPUTING GROUPS;

TRUSTED COMPUTING;

EID: 85013604515     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1049/PBPC006E_ch5     Document Type: Chapter

References (41)

1. B. Balacheff, L. Chen, S. Pearson, D. Plaquin, and G. Proudler. Trusted Computing Platforms: TCPA Technology in Context. Prentice Hall PTR, New York, 2003.
2. Trusted Computing Group website. www.trustedcomputinggroup.org.
3. E. Brickell. An efficient protocol for anonymously providing assurance of the container of a private key. Submitted to the Trusted Computing Group, April 2003.
4. L. Chen. A scheme of group signatures with revocation evidence - a proposal for TCG. Submitted to the Trusted Computing Group, May 2003.
5. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In M. Bellare, ed., Proceedings of the Advances in Cryptology, (CRYPTO 2000), volume 1880 of Lecture Notes in Computer Science, pp. 255-270, Springer-Verlag, Berlin, 2000.
6. IEEE. IEEE 1363A-2004: standard specifications for public key cryptography - amendment 1: additional techniques.
7. ISO/IEC. ISO/IEC 10118-3 (3rd edn): 2004. Information technology - Security techniques - Hash-functions - Part 3: Dedicated hash-functions.
8. C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161-174, 1991.
9. D. Boneh, E. Brickell, and H. Shacham. Set signatures. Unpublished manuscript, 2003.
10. D. Boneh, E. Brickell, L. Chen, and H. Shacham. Set signatures. Unpublished manuscript, 2003.
11. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In M. Yung, ed., Proceedings of the Advances in Cryptology, (CRYPTO 2002), volume 2442 of Lecture Notes in Computer Science, pp. 61-76, Springer-Verlag, Berlin, 2002.
12. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In B. Kaliski, ed., Proceedings of the Advances in Cryptology, (CRYPTO’97), volume 1296 of Lecture Notes in Computer Science, pp. 410-424, Springer-Verlag, Berlin, 1997.
13. D. Chaum and E. van Heyst. Group signatures. In D.W. Davies, ed., Proceedings of the Advances in Cryptology, (EUROCRYPT '91), volume 547 of Lecture Notes in Computer Science, pp. 257-265, Springer-Verlag, Berlin, 1991.
14. J. Kilian and E. Petrank. Identity escrow. In H. Krawczyk, ed., Proceedings of the Advances in Cryptology, (CRYPTO '98), volume 1642 of Lecture Notes in Computer Sciences, pp. 169-185, Springer-Verlag, Berlin, 1998.
15. J. Camenisch and A. Lysyanskaya. Efficient non-transferable anonymous multishow credential system with optional anonymity revocation. In B. Pfitzmann, ed., Proceedings of the Advances in Cryptology, (EUROCRYPT 2001), volume 2045 of Lecture Notes in Computer Science, pp. 93-118, Springer-Verlag, Berlin, 2001.
16. D. Chaum. Security without identification: transaction systems to make big brother obsolete. Communications of theACM, 28(10):1030-1044, October 1985.
17. F. Boudot. Efficient proofs that a committed number lies in an interval. In B. Preneel, ed., Proceedings of Advances in Cryptology, (EUROCRYPT 2000), volume 1807 of Lecture Notes in Computer Science, pp. 431-444, Springer-Verlag, 2000.
18. E. F. Brickell, D. Chaum, I. B. Damgård, and J. van de Graaf. Gradual and verifiable release of a secret. In C. Pomerance, ed., Proceedings in Advances in Cryptology, (CRYPTO '87), volume 293 of Lecture Notes in Computer Science, pp. 156-166, Springer-Verlag, Berlin, 1988.
19. J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In M. Wiener, ed., Proceedings of the Advances in Cryptology, (CRYPTO’99), volume 1666 of Lecture Notes in Computer Science, pp. 413-430, Springer-Verlag, Berlin, 1999.
20. D. Chaum. Zero-knowledge undeniable signatures. In I. B. Damgård, ed., Proceedings of the Advances in Cryptology, (EUROCRYPT’90), volume 473 of Lecture Notes on Computer Science, pp. 458-464, Springer-Verlag, Berlin, 1991.
21. D. Chaum, J.-H. Evertse, and J. van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In D. Chaum and W. L. Price, eds, Proceedings of the Advances in Cryptology, (EUROCRYPT '87), volume 304 of Lecture Notes in Computer Science, pp. 127-141, Springer-Verlag, Berlin, 1988.
22. D. Chaum and T. P. Pedersen. Wallet databases with observers. In E. F. Brickell, ed., Proceedings of the Advances in Cryptology, (CRYPTO '92), volume 740 of Lecture Notes in Computer Science, pp. 89-105, Springer-Verlag, Berlin, 1993.
23. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In A. M. Odlyzko, ed., Proceedings of the Advances in Cryptology, (CRYPTO '86), volume 263 of Lecture Notes in Computer Science, pp. 186-194, Springer-Verlag, Berlin, 1987.
24. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. Kaliski, ed., Proceedings of the Advances in Cryptology, (CRYPTO '97), volume 1294 of Lecture Notes in Computer Science, pp. 16-30, Springer-Verlag, Berlin, 1997.
25. D. Pointcheval and J. Stern. Security proofs for signature schemes. In U. Maurer, ed., Proceedings of the Advances in Cryptology, (EUROCRYPT '96), volume 1070 of Lecture Notes in Computer Science, pp. 387-398, Springer-Verlag, Berlin, 1996.
26. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62-73, ACM Press, New York, 1993.
27. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In S. Cimato, C. Galdi, and G. Persiano, eds, Proceedings of the Third International Conference, Security in Communication Networks, (SCN 2002), volume 2576 of Lecture Notes in Computer Science, pp. 268-289, Springer-Verlag, Berlin, 2003.
28. A. Lysyanskaya. Signature schemes and applications to cryptographic protocol design. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, September 2002.
29. S. Goldwasser, S. Micali, and R. Rivest. Adigital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, 1988.
30. E. Brickell, J. Camenisch, and L. Chen. Direct anonymous attestation. In B. Pfitzmann and P. Liu, eds, Proceedings of the 11th ACM Conference on Computer and Communications Security, pp. 132-145, ACM Press, New York, October 2004.
31. A. K. Lenstra and E. K. Verheul. Selecting cryptographic key sizes. Journal of Cryptology, 14(4):255-293, 2001.
32. R. Cramer andV. Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3):161-185, 2000.
33. E. Brickell, J. Camenisch, and L. Chen. Direct anonymous attestation. Available at http://eprint.iacr.org/2004/205/.
34. Trusted Computing Group. Trusted computing platform alliance (TCPA) main specification, version 1.1a. Republished asTrusted Computing Group (TCG) main specification, Version 1.1b, Available at www.trustedcomputinggroup. org, 2001.
35. J. Camenisch and M. Michels. Proving in zero-knowledge that a number n is the product of two safe primes. In J. Stern, ed., Proceedings of the Advances in Cryptology, (EUROCRYPT '99), volume 1592 of Lecture Notes in Computer Science, pp. 107-122, Springer-Verlag, Berlin, 1999.
36. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In D. Boneh, ed., Proceedings of the Advances in Cryptology, (CRYPTO 2003), volume 2729 of Lecture Notes in Computer Science, pp. 126-144, 2003.
37. M. Bellare, J. A. Garay, and T. Rabin. Fast batch verification for modular exponentiation and digital signatures. In K. Nyberg, ed., Proceedings of Advances in Cryptology, (EUROCRYPT '98), volume 1403 of Lecture Notes in Computer Science, pp. 236-250, Springer-Verlag, Berlin, 1998.
38. D. Challener and R. Zimmermann. Private communications, November 2004.
39. Trusted Computing Group. TCG TPM specification 1.2. Available at www.trustedcomputinggroup.org, 2003.
40. J. Camenisch and J. Groth. Group signatures: better efficiency and new theoretical aspects. In C. Blundo and S. Cimato, eds, Proceedings of the 4th International Conference on Security in Communication Networks, (SCN 2004), volume 3352 of Lecture Notes in Computer Science, pp. 122-135, Springer-Verlag, Berlin, 2005.
41. W. M. Grossman. Anonymous trust: making trusted computer work with privacy. Scientific American, August 2004.