A general certification framework with applications to privacy-enhancing certificate infrastructures

IFIP International Federation for Information Processing

Volumn 201, Issue , 2006, Pages 25-37

  Camenisch, Jan ^a   Sommer, Dieter ^a   Zimmermann, Roger ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; SPECIFICATION LANGUAGES; SPECIFICATIONS;

ABSTRACT INTERFACES; ANONYMOUS CREDENTIAL SYSTEMS; BINARY REPRESENTATIONS; CERTIFICATE-BASED; CONTROLLED RELEASE; ELECTRONIC MEDIA; GENERAL EXPRESSION; PUBLIC KEY INFRASTRUCTURE;

NETWORK FUNCTION VIRTUALIZATION;

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

References (30)

1. Bangerter, E., Camenisch, J., and Lysyanskaya, A. A cryptographic framework for the controlled release of certified data. In Twelfth International Workshop on Security Protocols 2004 (2004), LNCS, Springer Verlag.
2. Boudot, F. Efficient proofs that a committed number lies in an interval. In EUROCRYPT 2000, vol. 1807 of LNCS, Springer Verlag, pp. 431-444.
3. Brands, S. Rapid demonstration of linear relations connected by boolean operators. In EUROCRYPT '97 (1997), vol. 1233 of LNCS, Springer Verlag, pp. 318-333.
4. Brands, S. Rethinking Public Key Infrastructure and Digital Certificates - Building in Privacy. PhD thesis, Eindhoven Institute of Technology, Eindhoven, The Netherlands, 1999.
5. Brickell, E., Camenisch, J., and Chen, L. Direct anonymous attestation. In ACM CCS '04, ACM Press, pp. 132-145.
6. Camenisch, J., and Damgård, I. Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In ASIACRYPT 2000, vol. 1976 of LNCS, Springer Verlag, pp. 331-345.
7. Camenisch, J., and Lysyanskaya, A. A signature scheme with efficient protocols. In Third Conference on Security in Communication Networks (2002), vol. 2576 of LNCS, Springer Verlag, pp. 274-295.
8. Camenisch, J., and Lysyanskaya, A. Signature schemes and anonymous credentials from bilinear maps. In CRYPT0 2004, Springer Verlag.
9. Camenisch, J., and Michels, M. Proving in zero-knowledge that a number n is the product of two safe primes. In EUROCRYPT '99, vol. 1592 of LNCS, Springer Verlag, pp. 107-122.
10. Camenisch, J., and Michels, M. Separability and efficiency for generic group signature schemes. In CRYPTO '99 (1999), vol. 1666 of LNCS, Springer Verlag, pp. 413-430.
11. Camenisch, J., and Shoup, V. Practical verifiable encryption and decryption of discrete logarithms. In CRYPTO 2003, LNCS.
12. Camenisch, J., and Sommer, D. Tech. Rep. Research Report RZ 3646, IBM Zurich Research Laboratory, 2006.
13. Camenisch, J., Sommer, D., and Zimmermann, R. A general certification framework with applications to privacy-enhancing certificate infrastructures. Tech. Rep. 3629, IBM Zurich Research Laboratory, November 2005.
14. Camenisch, J. L. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Zürich, 1998. Diss. ETH No. 12520, Hartung Gorre Verlag, Konstanz.
15. Chan, A, Frankel, Y., and Tsiounis, Y. Easy come - easy go divisible cash. In EUROCRYPT '98 (1998), vol. 1403 of LNCS, Springer Verlag, pp. 561-575.
16. Chaum, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24, 2 (Feb. 1981), 84-88.
17. Chaum, D. Blind signature systems. In CRYPTO '83, Plenum Press, p. 153.
18. Chaum, D., and Pedersen, T. P. Wallet databases with observers. In CRYPTO '92, vol. 740 of LNCS, Springer-Verlag, pp. 89-105.
19. Chaum, D., and van Heyst, E. Group signatures. In EUROCRYPT '91 (1991), vol. 547 of LNCS, Springer-Verlag, pp. 257-265.
20. Cramer, R., Damgård, I., and Schoenmakers, B. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPT0 '94 (1994), vol. 839 of LNCS, Springer Verlag, pp. 174-187.
21. Damgård, I. Efficient concurrent zero-knowledge in the auxiliary string model. In EUROCRYPT 2000, vol. 1807 of LNCS, Springer Verlag, pp. 431-444.
22. Damgård, I., and Fujisaki, E. An integer commitment scheme based on groups with hidden order. In ASAACRYPT 2002, vol. 2501 of LNCS, Springer.
23. Fiat, A., and Shamir, A. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO '86, vol. 263 of LNCS, Springer Verlag, pp. 186-194.
24. Fujisaki, E., and Okamoto, T. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO '97, vol. 1294 of LNCS, Springer Verlag, pp. 16-30.
25. Kiayias, A., Tsiounis, Y., and Yung, M. Traceable signatures. In EUROCRYPT, vol. 3027 of LNCS, Springer, pp. 571-589.
26. Kilian, J., and Petrank, E. Identity escrow. Theory of Cryptography Library, Record Nr. 97-11, http://theory.lcs.mit.edu/~tcryptol,Aug. 1997.
27. Pedersen, T. P. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO '91, vol. 576 of LNCS, Springer Verlag, pp. 129-140.
28. PRIME project. www.prime-project.eu.org.
29. Rivest, R., Shamir, A., and Adleman, L. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 2 (Feb. 1978), 120-126.
30. Schnorr, C. P. Efficient signature generation for smart cards. Journal of Cryptology 4, 3 (1991), 239-252.