Protecting (anonymous) credentials with the Trusted Computing Group's TPM V1.2

IFIP International Federation for Information Processing

Volumn 201, Issue , 2006, Pages 135-147

  Camenisch, Jan ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CRIME; COMPUTER HARDWARE; COMPUTER PRIVACY; HARDWARE; HARDWARE SECURITY; SECURITY OF DATA;

ANONYMOUS CREDENTIAL; ANONYMOUS CREDENTIAL SYSTEMS; APPLICATION SPECIFIC; DIFFERENT SERVICES; DIGITAL CREDENTIALS; PHISHING ATTACKS; TRUSTED COMPUTING GROUPS; VIRUSES AND WORMS;

TRUSTED COMPUTING;

EID: 33845516445     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/0-387-33406-8_12     Document Type: Article

References (21)

1. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In CRYPTO 2000, vol. 1880 of LNCS, pp. 255-270. Springer Verlag, 2000.
2. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In EUROCRYPT 2000, vol. 1087 of LNCS, pp. 139-155.
3. S. M. Bellovin and M. Merritt. Augmented encrypted key exchange: A password-based protocol secure against dictionary attacks and password file compromise. In ACM CCS, pp. 244-250, 1993.
4. S. Brands. Rapid demonstration of linear relations connected by boolean operators. In EUROCRYPT '97, vol. 1233 of LNCS, pp. 318-333. Springer Verlag, 1997.
5. E. Brickell, J. Camenisch, and L. Chen. Direct anonymous attestation. In ACM CSS, pp. 225-234. acm press, 2004.
6. J. Camenisch and A. Lysyanskaya. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In EUROCRYPT 2001, vol. 2045 of LNCS, pp. 93-118. Springer Verlag, 2001.
7. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In SCN 2002, vol. 2576 of LNCS, pp. 268-289. Springer Verlag, 2003.
8. J. Camenisch and M. Michels. Proving in zero-knowledge that a number n is the product of two safe primes. In EUROCRYPT '99, vol. 1592 of LNCS, pp. 107-122.
9. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In CRYPTO '97, vol. 1296 of LNCS, pp. 410-424. Springer Verlag, 1997.
10. A. Chan, Y. Frankel, and Y. Tsiounis. Easy come - easy go divisible cash. In EUROCRYPT '98, vol. 1403 of LNCS, pp. 561-575. Springer Verlag, 1998.
11. D. Chaum. Security without identification: Transaction systems to make big brother obsolete. Communications ojthe ACM, 28(10): 1030-1044, Oct. 1985.
12. D. Chaum and T. P. Pedersen. Wallet databases with observers. In CRYPTO '92, vol. 740 of LNCS, pp. 89-105. Springer-Verlag, 1993.
13. R. Cramer, I. Damgåd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO '94, vol. 839 of LNCS, pp. 174-187. Springer Verlag, 1994.
14. I. Damgård and E. Fujisaki. An integer commitment scheme based on groups with hidden order. In ASIACRYPT 2002, vol. 2501 of LNCS. Springer, 2002.
15. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO '86, vol. 263 of LNCS, pp. 186-194.
16. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO '97, vol. 1294 of LNCS, pp. 16-30.
17. R. Gennaro and Y. Lindell. A framework for password-based authenticated key exchange. In EUROCRYPT 2003, vol. 2656 of LNCS, pp. 524-543. Springer Verlag,
18. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO '91, vol. 576 of LNCS, pp. 129-140. Springer Verlag, 1992.
19. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120-126.
20. C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239-252, 1991.
21. Trusted Computing Group. TCG TPM specification 1.2. Available at www.trustedcomputinggroup.org, 2003.