Online subscriptions with anonymous access

Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08

Volumn , Issue , 2008, Pages 217-227

  Blanton, Marina ^a  

^a University of Notre Dame   (United States)

Author keywords

Anonymous access; Privacy; Signatures; Zero knowledge proofs

Indexed keywords

COMPUTATION OVERHEADS; CURRENT PRACTICES; DIGITAL FORMS; HETEROGENEOUS INFORMATION; LARGE DATA; MUSIC COLLECTION; ONLINE PRIVACY; SERVICE PROVIDER; THIRD PARTIES; USER ACCESS; ZERO KNOWLEDGE PROOF;

NETWORK SECURITY;

DIGITAL LIBRARIES;

EID: 77952375091     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1368310.1368342     Document Type: Conference Paper

References (39)

1. G. Ateniese, D. Song, and G. Tsudik. Quasi-efficient revocation of group signatures. In Financial Cryptography (FC'02), pages 183-197, 2002.
2. M. Backes, J. Camenisch, and D. Sommer. Anonymous yet accountable access control. In ACM Workshop on Privacy in the Electronic Society (WPES'05), pages 40-46, 2005.
3. M. Belenkiy, M. Chase, M. Kohlweiss, and A. Lysyanskaya. Non-interactive anonymous credentials. In To appear in Theory of Cryptography Conference (TCC'08), 2008.
4. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In Advances in Cryptology - CRYPTO'04, volume 3152 of LNCS, pages 41-55, 2004. Full version availalbe at http://crypto.stanford.edu/~dabo/abstracts/groupsigspdf.
5. F. Boudot. Efficient proofs that a committed number lies in an interval. In Advances in Cryptology - EUROCRYPT'00, volume 1807 of LNCS, pages 431-444, 2000.
6. S. Brands. A technical overview of digital credentials. Unpublished manuscript. Available from http://www.credentica.com/whitepapers.php.
7. S. Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, Centre for Mathematics and Computer Science (CWI), 1993.
8. S. Brands. Untraceable off-line cash in wallets with observers. In Advances in Cryptology - CRYPTO'93, volume 773 of LNCS, pages 344-359, 1993.
9. E. Bresson and J. Stern. Efficient revocation in group signatures. In International Workshop on Practice and Theory in Public Key Cryptography (PKC'01), volume 1992 of LNCS, pages 190-206, 2001.
10. E. Bresson and J. Stern. Proofs of knowledge for non-monotone discrete-log formulae and applications. In Information Security Conference (ISC'02), volume 2433 of LNCS, pages 272-288, 2002.
11. J. Camenisch and J. Groth. Group signatures: Better efficiencey and new theoretical results. In Conference on Security in Communication Networks (SCN'04), volume 3352 of LNCS, pages 120-133, 2005.
12. J. Camenisch, S. Hohenberger, M. Kohlweiss, A. Lysyanskaya, and M. Meyerovich. How to win the clone wars: Efficient periodic n-times anonymous authentication. In ACM Conference on Computer and Communications Security (CCS'06), pages 201-210, 2006.
13. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Advances in Cryptology - CRYPTO'02, volume 2442 of LNCS, pages 61-76, 2002.
14. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In Conference on Security in Communication Networks (SCN'02), volume 2576 of LNCS, pages 268-289, 2002.
15. J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In Advances in Cryptology - CRYPTO'04, pages 56-72, 2004.
16. J. Camenisch and M. Michels. Proving in zero-knowledge that a number is the product of two safe primes. In Advances in Cryptology - EUROCRYPT'99, volume 1592 of LNCS, pages 107-122, 1999.
17. J. Camenisch, D. Sommer, and R. Zimmermann. A general certification framework with applications to privacy-enhancing certificate infrastructures. In IFIP International Information Security Conference (SEC'06), May 2006.
18. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In Advances in Cryptology - CRYPTO'97, volume 1296 of LNCS, pages 410-424, 1997.
19. J. Camenisch and M. Stadler. Proof systems for general statements about discrete logarithms. Technical Report No. 260, ETH Zurich, 1997.
20. D. Chaum, J. Evertse, J. van de Graaf, and R. Peralta. Demonstrating posession of a discrete logarithm without revealing it. In Advances in Cryptology - CRYPTO'86, volume 263 of LNCS, pages 200-212, 1987.
21. D. Chaum, J.-H. Evertse, and J. van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In Advances in Cryptology - EUROCRYPT'87, volume 304 of LNCS, pages 127-141, 1988.
22. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology - CRYPTO'94, volume 839 of LNCS, pages 174-187, 1994.
23. A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung. On monotone formula closure in SZK. In Symposium on Foundations of Computer Science (FOCS'94), pages 454-465, 1994.
24. X. Ding, G. Tsudik, and S. Xu. Leak-free group signatures with immediate revocation. In International Conference on Distributed Computing Systems (ICDCS'04), pages 608-615, 2004.
25. R. Dingledine, N. Mathewson, and P. Sylverson. TOR: The second-generation onion router. In USENIX Security Symposium, 2004.
26. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology - CRYPTO'86, volume 263 of LNCS, pages 186-194, 1987.
27. S. Galbraith, K. Paterson, and N. Smart. Pairings for cryptographers. Cryptology ePrint Archive Report 2006/165, http://eprint.iacr.org/2006/165, 2006.
28. J. Groth and A. Sahai. Efficient non-interactive proof systems for bilinear groups. IACR ePrint Archive Report 2007/155, http://eprint.iacr.org/ 2007/155, 2007.
29. A. Lysyanskaya, R. Rivest, A. Sahai, and S. Wolf. Pseudonym systems. In Selected Areas in Cryptography (SAC'99), pages 184-199, 1999.
30. W. Mao. Guaranteed correct sharing of integer factorization with off-line shareholders. In Public Key Cryptography, pages 27-42, 1998.
31. L. Nguyen and R. Safani-Naini. Dynamic k-times anonymous authentication. In ACNS, volume 3531 of LNCS, pages 318-333, 2005.
32. P. Persiano and I. Visconti. A secure and private system for subscription-based remote services. ACM Transactions on Information and System Security (TISSEC), 6 (4):472-500, November 2003.
33. Z. Ramzan and M. Ruhl. Protocols for anonymous subscription services. Unpublished manuscript, 2000.
34. S. Schechter, T. Pernell, and A. Hartemink. Anonymous authentication of membership in dynamic groups. In International Conference on Financial Cryptography (FC'99), pages 184-195, 1999.
35. C. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4 (3):239-252, 1991.
36. M. Scott. MIRACL library. Indigo software, http://indigo.ie/~mscott.
37. D. Song. Practical forward secure group signature schemes. In ACM Conference on Computer and Communications Security (CCS'01), pages 225-234, November 2001.
38. S. Stubblebine, P. Syverson, and D. Goldschlag. Unlinkable serial transactions: Protocols and applications. ACM Transactions on Information and System Security (TISSEC), 2 (4):354-389, November 1999.
39. I. Teranishi, J. Furukawa, and K. Sako. k-times anonymous authentication. In ASIACRYPT'04, volume 3329 of LNCS, pages 308-322, 2004.