k-Times Anonymous Authentication with a constant proving cost

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3958 LNCS, Issue , 2006, Pages 525-542

  Teranishi, Isamu ^a   Sako, Kazue ^a  

^a NEC CORPORATION   (Japan)

Author keywords

Efficiency; K times anonymous authentication; Public verifiability

Indexed keywords

E-COUPONS; E-VOTING; K-TIMES ANONYMOUS AUTHENTICATION; PUBLIC VERIFIABILITY;

ARTIFICIAL INTELLIGENCE; EFFICIENCY; PUBLIC KEY CRYPTOGRAPHY; WEB BROWSERS;

COPYRIGHTS;

EID: 33745871113     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11745853_34     Document Type: Conference Paper

References (43)

1. [ACJT00] Ateniese, Camenisch, Joye, Tsudik. A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. CRYPTO 2000, pp. 255-270.
2. [AF96] Abe, Fujisaki, How to Date Blind Signatures, In ASIACRYPT'96, pp. 244-251.
3. [AM03] Ateniese Medeiros. Efficient Group Signatures without Trapdoors. ASI-ACRYPT'03, pp. 246-268.
4. [BCK03] Bellare, Canetti, Krawczyk. Pseudorandom functions revisited: The cascade construction and its concrete security. FOCS'96, 514-523.
5. [BMW03] Bellare, Micciancio, Warinschi. Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions In EUROCRYPT'03, pp. 614-629.
6. [BSZ05] Bellare, Shi Zhang. Foundations of Group Signatures: The Case of Dynamic Groups. CT-RSA'05, pp. 136-153.
7. [BB04] Boneh, Boyen. Short Signatures Without Random Oracles. EUROCRYPT'04, pp. 56-73.
8. [BBS04] Boneh, Boyen, Shacham. Short Group Signatures. CRYPTO'04, pp. 41-55.
9. [B00] Boudot. Efficient Proofs that a Committed Number Lies in an Interval. EUROCRYPT'00, pp 431-444.
10. [B93] Brands. An Efficient Off-line Electronic Cash System Based On The Representation Problem. TR. CS-R9323, Centrum voor Wiskunde en Informatica.
11. [BCC04] Brickell, Camenisch, Chen. Direct Anonymous Attestation. ACMCCS'04, pp. 132-145.
12. [CDS94] Crarner, Damgård, Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. CRYPTO'94, pp. 174-187.
13. [CFT98] Chan, Frankel, Tsiounis. Easy Come - Easy Go Divisible Cash. EUROCRYPT '98, pp. 614-629.
14. [CG04] Camenisch, Groth. Group Signatures: Botter Efficiency and New Theoretical Aspects. SCN'04, pp. 120-133.
15. [CHL05] J. Camenisch, S. Hohenberger and A. Lysyanskaya. Compact E-Cash. EUROCRYPT'05, pp. 302-321.
16. [CL02] Camenisch, Lysyanskaya. A Signature Scheme with Efficient Protocols. SCN'02, pp. 268-289.
17. [CL04] Camenisch, Lysyanskaya. Signature Schemes and Anonymous Credentials from Bilinear Maps. CRYPTO'04, pp. 56-72.
18. [CH91] D. Chaum, E. van Heijst. Group signatures. EUROCRYPT'91, pp. 257-265.
19. [CP92] Chaum,Pedersen.Transferred Cash Grows in Size, EUROCRYPT'92, pp.390-407
20. [CT03] Canard, Traoré. List Signature Schemes and Application to Electronic Voting. International Workshop on Coding and Cryptography 2003, pp.24-28.
21. [CT04] Canard, Schoenmakers, Stam, Traoré. List Signature Schemes. Special Issue of the Journal Discrete Applied mathematics, 2005.
22. [DJ01] Damgard Jurik. A Generalization, a Simplification and Some Applications of Paillier's Probabilistic Public-key system. PKC'01. pp. 119-136.
23. [DN02] Damgard, Nielsen. Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security. CRYPTO'02, pp.449-464.
24. [DY05] Dodis, Yampolskiy. A Verifiable Random Function with Short Proofs and Keys. PKC'05, pp.416-431
25. [FI05] Furukawa, Imai. An Efficient Group Signature Scheme from Bilinear Maps. ACISP'05, pp.455-467.
26. [FS01] Furukawa, Sako. An Efficient Scheme for Proving a Shuffle. CRYPTO'01,pp. 368-387.
27. [GGM86] Goldreich, Goldwasser, Micali. How to construct random function. J.ACM. 33(4): pp.797-807, 1986.
28. [KY04] Kiayias, Yung. Group Signatures: Provable Secure, Efficient Constructions and Anonymity from Trapdoor Holders, http://eprint.iacr.org/2004/076.ps
29. [KY05] A. Kiayias, M. Yuug. Group Signatures with Efficient Concurrent Join. EUROCRYPT'05 pp. 198-214. Full version: http://eprint.iacr.org/2005/345.
30. [MSK02] Mitsunari, Sakai, Kasahara. A new traitor tracing. IEICE Trans. Vol. E85-A, No.2, pp.481-484, 2002.
31. [NHS99] Nakanishi, Haruna, Sugiyama. Unlinkable Electronic Coupon Protocol with Anonymity Control, ISW'99, pp. 37-46.
32. [NR97] Naor Reingold. Number-Theoretic Constructions of Efficient Pseudo-Random Functions. FOCS'97. pp.458-467.
33. [NN04] Nguyen, Safavi-Naini. Efficient and Provably Secure Trapdoor-free Group Signature Schemes from Bilinear Pairings. ASIACRYPT'04, pp. 316-337.
34. [NN05] Nguyen, Safavi-Naini. Dynamic k-Times Anonymous Authentication. ACNS'05, pp. 318-333.
35. [Neff01] Neff. A Verifiable Secret Shuffle and its Application to E-Voting, ACMCCS'01 pp. 116-125.
36. [OO98] Okamoto, Ohta. One-Time Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, vol E81-A, No. 1, pp. 2-10, 1998.
37. [OMAFO99] Ookubo, Miura, Abe, Fujioka, Okamoto. An improvement of a practical secret voting scheme. ISW'99, pp. 37-46.
38. [PBF99] Pavlovski, Boyd, Foo. Detachable Electronic Coins. ICICS'99, pp. 54-70.
39. [P91] Torben P. Pedersen. A Threshold Cryptosystem without a Trusted Party. EUROCRYPT'91, pp.522-526.
40. [S00] Sako. Restricted Anonymous Participation. SCIS'OO, B12. (Japanese).
41. [SK94] Sako, Kilian. Secure Voting using Partially Compatible Homomorphisms. CRYPTO '94, pp. 411-424.
42. [TF03] Teranishi, Furukawa. Tag Signature. SCIS'03, 6C-2. (Japanese. Preliminary version of [TFS04]).
43. [TFS04] Teranishi, Furukawa, Sako. k-Times Anonymous Authentication. ASIACRYPT'04, pp. 308-322.