A secure three-move blind signature scheme for polynomially many signatures

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

Volumn 2045, Issue , 2001, Pages 136-151

  Abe, Masayuki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC DATA INTERCHANGE; NETWORK SECURITY;

BLIND SIGNATURE SCHEME; POLYNOMIAL NUMBER; PROVABLY SECURE; RANDOM ORACLE MODEL; SECURITY PARAMETERS;

AUTHENTICATION;

EID: 84945119655     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44987-6_9     Document Type: Conference Paper

References (31)

1. M. Abe and J. Camenisch. Partially blind signatures. In the 1997 Symposium on Cryptography and Information Security, 1997.
2. M. Abe and E. Fujisaki. How to date blind signatures. In Asiacrypt ‘96, LNCS 1163, pp. 244-251. Springer-Verlag, 1996.
3. M. Abe and T. Okamoto. Provably secure partially blind signatures. In Crypto 2000, LNCS 1880, pp. 271-286. Springer-Verlag, 2000.
4. M. Bellare and P. Rogaway. Optimal asymmetricencryption. In Eurocrypt ‘94, LNCS 950, pp. 92-111. Springer-Verlag, 1995.
5. M. Bellare and P. Rogaway. The exact security of digital signatures - how to sign with RSA and Rabin. In Eurocrypt ‘96, LNCS 1070, pp. 399-416. Springer-Verlag, 1996.
6. S. Brands. Untraceable off-line cash in wallet with observers. In Crypto ‘93, LNCS 773, pp. 302-318. Springer-Verlag, 1993.
7. S. Brands. Restrictive binding of secret-key certificates. In Eurocrypt ‘95, LNCS 921, pp. 231-247. Springer-Verlag, 1995.
8. S. Brands. Restrictive blinding of secret-key certificates. Tech. report, CWI, 1995.
9. J. Camenisch. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Zurich, 1998.
10. J. Camenisch, J.-M. Piveteau, and M. Stadler. Blind signatures based on the discrete logarithm problem. In Eurocrypt 94, LNCS 950, pp. 428-432. Springer-Verlag, 1995.
11. J. Camenisch, J.-M. Piveteau, and M. Stadler. Fair blind signatures. In Euro- crypt 95, LNCS 921, pp. 209-219. Springer-Verlag, 1995.
12. D. Chaum. Blind signatures for untraceable payments. In Crypto ‘82, pp. 199-204. Prenum Publishing Corporation, 1982.
13. R. Cramer, I. Damgard, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Crypto ‘94, LNCS 839, pp. 174-187. Springer-Verlag, 1994.
14. I. Damgard. A design principle for hash functions. In Crypto ‘89, LNCS 435, pp. 416-427. Springer-Verlag, 1990.
15. U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. In 21st STOC, pp. 416-426, 1990.
16. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Crypto 86, LNCS 263, pp. 186-199. Springer-Verlag, 1986.
17. M. Fischlin. A note on security proofs in the generic model. In Asiacrypt 2000, LNCS 1976, pp. 458-469. Springer-Verlag, 2000.
18. Y. Frankel, Y. Tsiounis, and M. Yung. “Indirect discourse proofs”: Achieving efficient fair off-line e-cash. In Asiacrypt ‘96, LNCS 1163, pp. 286-300. Springer-Verlag, 1996.
19. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing, 17(2):281-308, April 1988.
20. L. C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In Euro-crypt 88, LNCS 330, pp. 123-128. Springer-Verlag, 1988.
21. H. Horster, M. Michels, and H. Petersen. Meta-message recovery and meta-blind signature schemes based on the discrete logarithm problem and their applications. In Asiacrypt ‘92, LNCS 917, pp. 224-237. Springer-Verlag, 1992.
22. A. Juels, M. Luby, and R. Ostrovsky. Security of blind digital signatures. In Crypto ‘97, LNCS 1294, pp. 150-164. Springer-Verlag, 1997.
23. T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. In Crypto 92, LNCS 740, pp. 31-53. Springer-Verlag, 1993.
24. T. Okamoto and K. Ohta. Divertible zero knowledge interactive proofs and commutative random self-reducibility. In Eurocrypt ‘89, LNCS 434, pp. 134-149. Springer-Verlag, 1990.
25. B. Pfitzmann and M. Waidner. How to break and repair a “probably secure” untraceable payment system. In Crypto ‘91, LNCS 576, pp. 338-350. Springer-Verlag, 1992.
26. D. Pointcheval. Strengthened security for blind signatures. In Eurocrypt 98, LNCS, pp. 391-405. Springer-Verlag, 1998.
27. D. Pointcheval and J. Stern. Provably secure blind signature schemes. In Asi-acrypt 96, LNCS 1163, pp. 252-265. Springer-Verlag, 1996.
28. D. Pointcheval and J. Stern. Security proofs for signature schemes. In Euro-crypt 96, LNCS 1070, pp. 387-398. Springer-Verlag, 1996.
29. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 2000.
30. C. Schnorr and M. Jakobsson. Security of discrete log cryptosystems in the random oracle and generic model. Tech. report, University Frankfurt and Bell Labs., 1999.
31. C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239-252, 1991.