K-times anonymous authentication

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E92-A, Issue 1, 2009, Pages 147-165

  Teranishi, Isamu ^a   Furukawa, Jun ^a   Sako, Kazue ^a  

^a NEC CORPORATION   (Japan)

Author keywords

Group signature; K times anonymous authentication; Public verifiability

Indexed keywords

COMPUTER SCIENCE; ELECTRICAL ENGINEERING;

ANONYMOUS AUTHENTICATION; AUTHENTICATION SCHEME; DISHONEST USERS; E-VOTING; GROUP SIGNATURES; PUBLIC VERIFIABILITY;

AUTHENTICATION;

EID: 77952346760     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1587/transfun.E92.A.147     Document Type: Conference Paper

References (54)

1. M. Abe and E. Fujisaki, "How to date blind signatures," ASIACRYPT 1996, pp.244-251, 1996.
2. M. Abe and T. Okamoto, "Provably secure partially blind signatures," CRYPTO 2000, pp.271-286, 2000.
3. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik, "A practical and provably secure coalition-resistant group signature scheme," CRYPTO'00, pp.255-270, 2000.
4. G. Ateniese and B. de Medeiros, "Efficient group signatures without trapdoors," ASIACRYPT'03, pp.246-268, 2003.
5. G. Ateniese and G. Tsudik, "Some open issues and new directions in group signatures," FC'99, pp.196-211, 1999.
6. F. Boudot, "Efficient proofs that a committed number lies in an interval," EUROCRYPT'00, pp.255-270, 2000.
7. S. Brands, "An efficient off-line electronic cash system based on the representation problem," Technical Report CS-R9323, Centrum voor Wiskunde en Informatica, 1993.
8. D. Boneh and X. Boyen, "Short signatures without random oracles," EUROCRYPT'04, pp.56-73, 2004.
9. E. Brickell, J. Camenisch, and L. Chen, "Direct anonymous attestation," ZISC Information Security Colloquium SS 2004, June 2004. http://www.hpl.hp.com/techreports/2004/HPL-2004-93.pdf.
10. M. Bellare, R. Canetti, and H. Krawczyk, "Pseudorandom functions revisited: The cascade construction and its concrete security," FOCS'96, pp.514-523, 1996.
11. M. Bellare, D. Micciancio, and B. Warinschi, "Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions," EUROCRYPT'03, pp.614-629, 2003.
12. M. Bellare, H. Shi, and C. Zhang, "Foundations of group signatures: The case of dynamic groups," CT-RSA'05, pp.136-153, 2005.
13. J. Camenisch and J. Groth, "Group signatures: Better efficiency and new theoretical aspects," SCN'04, pp.120-133, 2004.
14. J. Camenisch, S. Hohenberger, and A. Lysyanskaya, "Compact e-cash," EUROCRYPT'05, pp.302-321, 2005.
15. S. Canard and J. Traoré, "List signature schemes and application to electronic voting," International Workshop on Coding and Cryptography 2003, pp.24-28, March 2003.
16. J. Camenisch and A. Lysyanskaya, "Dynamic accumulators and application to efficient revocation of anonymous credentials," CRYPTO 2002, pp.61-76, 2002.
17. S. Canard, B. Schoenmakers, M. Stam, and J. Traoré, "List signature schemes," Discrete Appl. Math., vol.154, no.2, pp.189-201, 2006.
18. J. Camenisch and A. Lysyanskaya, "Signature schemes and anonymous credentials from bilinear maps," CRYPTO'04, pp.56-72, 2004.
19. A. Chan, Y. Frankel, and Y. Tsiounis, "Easy come-easy go divisible cash," EUROCRYPT'98, pp.614-629, 1998.
20. D. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms," Commun. ACM, vol.24, no.2, pp.84-88, 1981.
21. D. Chaum, "Blind signature system," CRYPTO'83, pp.153-153, Plenum Press, 1984.
22. D. Chaum and E. van Heyst, "Group signatures," EUROCRYPT'91, pp.257-265, Springer-Verlag, 1991.
23. D. Chaum and T.P. Pedersen, "Transferred cash grows in size," EUROCRYPT' 92, pp.390-407, 1992.
24. R. Cramer, I. Damgård, and B. Schoenmakers, "Proofs of partial knowledge and simplified design of witness hiding protocols," CRYPTO'94, pp.174-187, Springer-Verlag, 1994.
25. I. Damgård and M. Jurik, "A generalization, a simplification and some applications of paillier's probabilistic public-key system," PKC'01, pp.119-136, 2001.
26. I. Damgård and J.B. Nielsen, "Expanding pseudorandom functions; or: From known-plaintext security to chosen-plaintext security," CRYPTO'02, pp.449-464, 2002.
27. Y. Dodis, A. Kiayias, A. Nicolosi, and V. Shoup, "Anonymous identification in ad hoc groups," EUROCRYPT'04, pp.609-626, Springer-Verlag, 2004.
28. Y. Dodis and A. Yampolskiy, "A verifiable random function with short proofs and keys," PKC'05, pp.416-431, 2005.
29. A. Fiat and A. Shamir, "How to prove yourself: Practical solution to identification and signature problems," CRYPTO'86, pp.186-194, Springer-Verlag, 1987.
30. J. Furukawa and H. Imai, "An efficient group signature scheme from bilinear maps," ACISP'05, pp.455-467, 2005.
31. J. Furukawa and K. Sako, "An efficient scheme for proving a shuffle," CRYPTO'01, pp.368-387, 2001.
32. E. Fujisaki and K. Suzuki, "Traceable ring signature," eprint http://eprint.iacr.org/2006/389, PKC 2007, pp.181-200, 2007. IEICE Trans. Fundamentals, vol.91-A, no.1, pp.83-93, Jan. 2008.
33. O. Goldreich, S. Goldwasser, and S. Micali, "How to construct random function," J.ACM, vol.33, no.4, pp.797-807, 1986.
34. A. Kiayias, Y. Tsiounis, and M. Yung, "Traceable signatures," EUROCRYPT' 04, pp.571-589, Springer-Verlag, 2004.
35. A. Kiayias and M. Yung, "Group signatures: Provable secure, efficient constructions and anonymity from trapdoor holders," http://eprint.iacr.org/2004/076.ps.
36. A. Kiayias and M. Yung, "Group signatures with efficient concurrent join," EUROCRYPT'05, pp.198-214, 2005. Full version: http://eprint.iacr. org/2005/345.
37. J. Kilian and E. Petrank, "Identity escrow," CRYPTO'98, pp.169-185, Springer-Verlag, 1998.
38. S. Mitsunari, M. Kasahara, and R. Sakai, "A new traitor tracing," IEICE Trans. Fundamentals, vol.E85-A, no.2, pp.481-484, Feb. 2002.
39. T. Nakanishi, N. Haruna, and Y. Sugiyama, "Unlinkable electronic coupon protocol with anonymity control," ISW'99, pp.37-46, 1999.
40. T. Nakanishi, N. Haruna, and Y. Sugiyama, "Electronic coupon ticket protocol with unlinkable transcripts of payments," SCIS'99, pp.359-363, 1999.
41. M. Naor and O. Reingold, "Number-theoretic constructions of efficient pseudo-random functions," FOCS'97, pp.458-467, 1997.
42. C.A. Neff, "A verifiable secret shuffle and its application to evoting," ACM-CCS 01, pp.116-125, 2001.
43. L. Nguyen, "Efficient dynamic k-times anonymous authentication, " VIETCRYPT 2006, pp.81-98, 2006.
44. L. Nguyen and R. Safavi-Naini, "Efficient and provably secure trapdoor-free group signature schemes from bilinear pairings," ASIACRYPT' 04, pp.316-337, 2004.
45. L. Nguyen and R. Safavi-Naini, "Dynamic k-times anonymous authentication," ACNS'05, pp.318-333, 2005.
46. T. Okamoto and K. Ohta, "One-time zero-knowledge authentications and their applications to untraceable electronic cash," IEICE Trans. Fundamentals, vol.E81-A, no.1, pp.2-10, Jan. 1998.
47. M. Ohkubo, F. Miura, M. Abe, A. Fujioka, and T. Okamoto, "An improvement of a practical secret voting scheme," ISW'99, pp.37-46, 1999.
48. C. Pavlovski, C. Boyd, and E. Foo, "Detachable electronic coins," Information and Communication Security, Second International Conference, ICICS'99, pp.54-70, 1999.
49. T.P. Pedersen, "A threshold cryptosystem without a trusted party," EUROCRYPT'91, pp.522-526, 1991.
50. K. Sako, "Restricted anonymous participation," SCIS'00, B12, Jan. 2000.
51. K. Sako and J. Kilian, "Secure voting using partially compatible homomorphisms," CRYPTO'94, pp.411-424, 1994.
52. I. Teranishi and J. Furukawa, "Tag signature," (Preliminary version of [53]), SCIS'03, 6C-2, Jan. 2003.
53. I. Teranishi, J. Furukawa, and K. Sako, "k-times anonymous authentication (Extended Abstract)," ASIACRYPT'04, pp.308-322, 2004.
54. I. Teranishi and K. Sako, "k-times anonymous authentication with a constant proving cost," PKC'06, pp.525-542, 2006.