How to win the clonewars: Efficient periodic n-times anonymous authentication

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2006, Pages 201-210

  Camenisch, Jan ^a   Hohenberger, Susan ^a   Kohlweiss, Markulf ^b   Lysyanskaya, Anna ^c   Meyerovich, Mira ^c  

^a IBM RESEARCH ZURICH   (Switzerland)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c Brown Univerity   (United States)

Author keywords

Clone detection; Credentials; N anonymous authentication

Indexed keywords

CLONE DETECTION; CREDENTIALS; N-ANONYMOUS AUTHENTICATION;

COMPUTER PRIVACY; INFORMATION MANAGEMENT; PARAMETER ESTIMATION; PROBLEM SOLVING; TIME VARYING SYSTEMS; USER INTERFACES;

AUTHENTICATION;

EID: 34547379480     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1180405.1180431     Document Type: Conference Paper

References (47)

1. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In CRYPTO, vol. 1880, p. 255-270, 2000.
2. G. Ateniese, K. Fu, M. Green, and S. Hohenberger. Improved Proxy Re-encryption Schemes with Applications to Secure Distributed Storage. In NDSS, p. 29-13, 2005.
3. L. Ballard, M. Green, B. de Medeiros, and F. Monrose. Correlation-Resistant Storage. Johns Hopkins University, Technical Report # TR-SP-BGMM-050705, 2005.
4. N. Baric and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In EUROCRYPT '97, volume 1233, p. 480-194, 1997.
5. D. Boneh and X. Boyen. Short signatures without random oracles. In EUROCRYPT, v.3027 of LNCS, p. 56-73, 2004.
6. D. Boneh, X. Boyen, and H. Shacham. Short group signatures using strong DifHe-Hellman. In CRYPTO, volume 3152 of LNCS, p. 41-55, 2004.
7. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In CRYPTO, v.2139, p. 213-229, 2001.
8. F. Boudot. Efficient proofs that a committed number lies in an interval. In EUROCRYPT, vol. 1807, p. 431-144, 2000.
9. S. Brands. Rethinking Public Key Infrastructure and Digital Certificates- Building in Privacy. PhD thesis, Eindhoven Inst. of Tech. The Netherlands, 1999.
10. E. Brickell, P. Gemmel, and D. Kravitz. Trustee-based tracing extensions to anonymous cash and the making of anonymous change. In SIAM, p. 457-166, 1995.
11. J. Camenisch and I. Damgård. Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In ASIACRYPT, volume 1976 of LNCS, p. 331-345, 2000.
12. J. Camenisch, S. Hohenberger, and A. Lysyanskaya. Compact E-Cash. In EUROCRYPT, volume 3494 of LNCS, p. 302-321, 2005.
13. J. Camenisch, S. Hohenberger, and A. Lysyanskaya. Balancing accountability and privacy using e-cash. In SCN (to appear), 2006.
14. J. Camenisch and A. Lysyanskaya. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In EUROCRYPT, volume 2045 of LNCS, p. 93-118, 2001.
15. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In CRYPTO, 2442 of LNCS, p. 61-76, 2002.
16. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In SCN 2002, volume 2576 of LNCS, p. 268-289, 2003.
17. J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In CRYPTO 2004, volume 3152 of LNCS, p. 56-72, 2004.
18. J. Camenisch, U. Maurer, and M. Stadler. Digital payment systems with passive anonymity-revoking trustees. In ESORICS 96, volume 1146 of LNCS, p. 33-13, 1996.
19. J. Camenisch and M. Michels. Proving in zero-knowledge that a number n is the product of two safe primes. In EUROCRYPT '99, volume 1592, p. 107-122, 1999.
20. J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In CRYPTO '99, volume 1666 of LNCS, p. 413-430, 1999.
21. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In CRYPTO '97, volume 1296 of LNCS, p. 410-124, 1997.
22. A. Chan, Y. Frankel, and Y. Tsiounis. Easy come - easy go divisible cash. In EUROCRYPT, v. 1403, p. 561-575, 1998.
23. D. Chaum. Blind signatures for untraceable payments. In CRYPTO '82, p. 199-203. Plenum Press, 1982.
24. D. Chaum. Blind signature systems. In CRYPTO '83, p. 153-156. Plenum, 1983.
25. D. Chaum. Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030-1044, Oct. 1985.
26. D. Chaum, A. Fiat, and M. Naor. Untraceable electronic cash. In CRYPTO, volume 403 of LNCS, p. 319-327, 1990.
27. D. Chaum and E. van Heyst. Group signatures. In EUROCRYPT '91, volume 547 of LNCS, p. 257-265, 1991.
28. S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee. Toward privacy in public databases. In TCC, volume 3378 of LNCS, p. 363-385, 2005.
29. I. Damgard, K. Dupont, and M. O. Pedersen. Unclonable group identification. In EUROCRYPT, volume 4004 of LNCS, p. 555-572, 2006.
30. I. B. Damgård. Payment systems and credential mechanism with provable security against abuse by individuals. In CRYPTO, volume 403 of LNCS, p. 328-335, 1990.
31. Y. Dodis. Efficient construction of (distributed) verifiable random functions. In PKC, volume 2567, p. 1-17, 2003.
32. Y. Dodis and A. Yampolskiy. A Verifiable Random Function with Short Proofs an Keys. In PKC, volume 3386 of LNCS, p. 416-431, 2005.
33. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO, volume 263 of LNCS, p. 186-194, 1986.
34. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO '97, volume 1294 of LNCS, p. 16-30, 1997.
35. S. D. Galbraith. Supersingular curves in cryptography. In ASIACRYPT, volume 2248 of LNCS, p. 495-513, 2001.
36. S. Jarecki and V. Shmatikov. Handcuffing big brother: an abuse-resilient transaction escrow scheme. In EUROCRYPT, volume 3027 of LNCS, p. 590-608, 2004.
37. A. Kiayias, M. Yung, and Y. Tsiounis. Traceable signatures. In EUROCRYPT, vol. 3027, p. 571-589, 2004.
38. A. Lysyanskaya. Signature Schemes and Applications to Cryptographic Protocol Design. PhD thesis, Massachusetts Institute of Technology, Sept. 2002.
39. A. Lysyanskaya, R. Rivest, A. Sahai, and S. Wolf. Pseudonym systems. In SAC, vol. 1758, p. 184-199, 1999.
40. N. McCullagh and P. S. L. M. Barreto. A new two-party identity-based authenticated key agreement. In CT-RSA, volume 3376 of LNCS, p. 262-274, 2004.
41. V. I. Nechaev. Complexity of a determinate algorithm for the discrete log. Mathematical Notes, 55:165-172, 1994.
42. L. Nguyen and R. Safavi-Naini. Dynamic k-times anonymous authentication. In ACNS, volume 3531 in LNCS, p. 318-333, 2005.
43. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO, volume 576 of LNCS, p. 129-140, 1992.
44. M. Scott. Authenticated ID-based key exchange and remote log-in with simple token and PIN number, 2002. http://eprint.iacr.org/2002/164.
45. V. Shoup. Lower bounds for discrete logarithms and related problems. In EUROCRYPT, LNCS, p. 256-266, 1997. Update: http://www.shoup.net/papers/.
46. L. Sweeney, k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):557-570, 2002.
47. I. Teranishi, J. Furukawa, and K. Sako. k-times anonymous authentication (extended abstract). In Asiacrypt, volume 3329 of LNCS, p. 308-322, 2004.