Rethinking accountable privacy supporting services

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2008, Pages 1-8

  Camenisch, Jan ^a   Groß, Thomas ^a   Heydt Benjamin, Thomas S ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Accountability; Anonymous credential systems; Cryptographic protocols; Privacy; Time capsule; Verifiable encryption

Indexed keywords

ACCOUNTABILITY; ANONYMOUS CREDENTIAL SYSTEMS; CRYPTOGRAPHIC PROTOCOLS; PRIVACY; TIME CAPSULE; VERIFIABLE ENCRYPTION;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

CRYPTOGRAPHY;

EID: 70349238641     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1456424.1456426     Document Type: Conference Paper

References (40)

1. M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi. Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. In V. Shoup, editor, Advances in Cryptology - CRYPTO 2005, volume 3621 of Lecture Notes in Computer Science, pages 205-222. Springer Verlag, 2005.
2. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In M. Bellare, editor, Advances in Cryptology - CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 255-270. Springer Verlag, 2000.
3. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In M. K. Franklin, editor, Advances in Cryptology - CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 41-55. Springer Verlag, 2004.
4. F. Boudot. Efficient proofs that a committed number lies in an interval. In B. Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 431-444. Springer Verlag, 2000.
5. S. Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, CWI, Apr. 1993.
6. S. Brands. Restrictive blinding of secret-key certificates. Technical Report CS-R9509, CWI, Sept. 1995.
7. S. Brands. Secret-key certificates. Technical Report CS-R9510, CWI, Sept. 1995.
8. S. Brands. Rapid demonstration of linear relations connected by boolean operators. In W. Fumy, editor, Advances in Cryptology - EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, pages 318-333. Springer Verlag, 1997.
9. S. Brands. Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy. MIT Press, 2000.
10. J. Camenisch, S. Hohenberger, and A. Lysyanskaya. Compact E-cash. In R. Cramer, editor, Advances in Cryptology - Eurocrypt 2005, volume 3494 of Lecture Notes in Computer Science, pages 302-321. Springer, 2005.
11. J. Camenisch, M. Kohlweiss, A. R. Durán, and C. Sheedy. Public key encryption with oblivious keyword search and its application to data retention. IBM Research Report RZ 3708, IBM Research, May 2008. http://domino.research. ibm.com/library/cyberdig.nsf/index.html.
12. J. Camenisch and A. Lysyanskaya. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In B. Pfitzmann, editor, Advances in Cryptology - EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 93-118. Springer Verlag, 2001.
13. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In S. Cimato, C. Galdi, and G. Persiano, editors, Security in Communication Networks, Third International Conference, SCN 2002, volume 2576 of Lecture Notes in Computer Science, pages 268-289. Springer Verlag, 2003.
14. J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In M. K. Franklin, editor, Advances in Cryptology - CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 56-72. Springer Verlag, 2004.
15. J. Camenisch and M. Michels. Proving in zero-knowledge that a number n is the product of two safe primes. Technical Report RS-98-29, BRICS, Departement of Computer Science, University of Aarhus, Nov. 1998.
16. J. Camenisch and M. Michels. Proving in zero-knowledge that a number n is the product of two safe primes. In J. Stern, editor, Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 107-122. Springer Verlag, 1999.
17. J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In M. Wiener, editor, Advances in Cryptology - CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 413-430. Springer Verlag, 1999.
18. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In D. Boneh, editor, Advances in Cryptology - CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 126-144, 2003.
19. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In B. Kaliski, editor, Advances in Cryptology - CRYPTO '97, volume 1296 of Lecture Notes in Computer Science, pages 410-424. Springer Verlag, 1997.
20. J. L. Camenisch. 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.
21. A. Chan, Y. Frankel, and Y. Tsiounis. Easy come - easy go divisible cash. In K. Nyberg, editor, Advances in Cryptology - EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science, pages 561-575. Springer Verlag, 1998.
22. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, Feb. 1981.
23. D. Chaum. Blind signatures for untraceable payments. In D. Chaum, R. L. Rivest, and A. T. Sherman, editors, Advances in Cryptology - Proceedings of CRYPTO '82, pages 199-203. Plenum Press, 1983.
24. D. Chaum. Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030-1044, Oct. 1985.
25. D. Chaum and J.-H. Evertse. A secure and privacy-protecting protocol for transmitting personal information between organizations. In M. Odlyzko, editor, Advances in Cryptology - CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 118-167. Springer-Verlag, 1987.
26. D. Chaum and T. P. Pedersen. Wallet databases with observers. In E. F. Brickell, editor, Advances in Cryptology - CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 89-105. Springer-Verlag, 1993.
27. D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, editor, Advances in Cryptology - EUROCRYPT '91, volume 547 of Lecture Notes in Computer Science, pages 257-265. Springer-Verlag, 1991.
28. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, editor, Advances in Cryptology - CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 174-187. Springer Verlag, 1994.
29. I. Damgård and E. Fujisaki. An integer commitment scheme based on groups with hidden order. http://eprint.iacr.org/2001, 2001.
30. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. M. Odlyzko, editor, Advances in Cryptology - CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 186-194. Springer Verlag, 1987.
31. Y. Frankel, Y. Tsiounis, and M. Yung. Fair off-line e-cash made easy. In K. Kim and T. Matsumoto, editors, Advances in Cryptology - ASIACRYPT '98, volume 1514 of Lecture Notes in Computer Science, pages 257-270. Springer Verlag, 1998.
32. A. Fujioka, T. Okamoto, and K. Ohta. A practical secret voting scheme for large scale elections. In J. Seberry and Y. Zheng, editors, ASIACRYPT, volume 718 of Lecture Notes in Computer Science, pages 244-251. Springer, 1992.
33. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. Kaliski, editor, Advances in Cryptology - CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 16-30. Springer Verlag, 1997.
34. M. Green and S. Hohenberger. Blind identity-based encryption and simulatable oblivious transfer. In ASIACRYPT, pages 265-282, 2007.
35. A. Kiayias and M. Yung. Secure scalable group signature with dynamic joins and separable authorities. IJSN, 1(1/2):24-45, 2006.
36. A. Kiayias, M. Yung, and Y. Tsiounis. Traceable signatures. In C. Cachin and J. Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 571-589. Springer, 2004.
37. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proc. 1st ACM Conference on Electronic Commerce, 1999.
38. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Advances in Cryptology - CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 129-140. Springer Verlag, 1992.
39. 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, Feb. 1978.
40. C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239-252, 1991.