Provably secure fair blind signatures with tight revocation

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

Volumn 2248, Issue , 2001, Pages 583-601

  Abe, Masayuki ^a   Ohkubo, Miyako ^b  

^a NTT CORPORATION   (Japan)

^b Sapporo Medical Center   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; NETWORK SECURITY;

ANONYMITY REVOCATION; FAIR BLIND SIGNATURES; PROVABLY SECURE; SECURITY PROOFS;

AUTHENTICATION;

EID: 84946829122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45682-1_34     Document Type: Conference Paper

References (26)

1. M. Abe. A three-move blind signature scheme secure for pollynomially many signatures. In B. Pfitzmann, editor, Advances in Cryptology — EUROCRYPT ’01, volume 2045 of Lecture Notes in Computer Science, pages 136–151. Springer-Verlag, 2001.
2. M. Abe and T. Okamoto. Provably secure partially blind signatures. In M. Bellare, editor, Advances in Cryptology — CRYPTO 2000, volume 1880of Lecture Notes in Computer Science, pages 271–286. Springer-Verlag, 2000.
3. G. Ateniese. Efficient verifiable encryption (and fair exchange) of digital signatures. In ACM CCS’99, pages 138–146. Association for Computing Machinery, 1999.
4. F. Bao. An efficient verifiable encryption scheme for encryption of discrete logarithms. In CARDIS’98, 1998.
5. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In First ACM Conference on Computer and Communication Security, pages 62–73. Association for Computing Machinery, 1993.
6. E. Brickell, P. Gemmell, and D. Kravitz. Trustee-based tracking extensions to anonymous cash and the making of anonymous change. In Proceedings of Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 457–466. ACM, 1995.
7. J. Camenisch. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Z¨urich, 1998.
8. J. Camenisch and I. Damgård. Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In T. Okamoto, editor, Advances in Cryptology – Asiacrypt 2000, volume 1976 of Lecture Notes in Computer Science, pages 331–345. Springer-Verlag, 2000.
9. J. Camenisch, J.-M. Piveteau, and M. Stadler. Fair blind signatures. In L. C. Guillou and J.-J. Quisquater, editors, Advances in Cryptology — EUROCRYPT ’95, volume 921 of Lecture Notes in Computer Science, pages 209–219. Springer-Verlag, 1995.
10. D. L. Chaum and T. P. Pedersen. Wallet databases with observers. In E. F. Brickell, editor, Advances in Cryptology — CRYPTO ’92, volume 740of Lecture Notes in Computer Science, pages 89–105. Springer-Verlag, 1993.
11. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. M. Odlyzko, editor, Advances in Cryptology — CRYPTO ’86, volume 263 of Lecture Notes in Computer Science, pages 186–199. Springer-Verlag, 1987.
12. Y. Frankel, Y. Tsiounis, and M. Yung. ”Indirect discourse proofs”: Achieving efficient fair off-line e-cash. In K. Kim and T. Matsumoto, editors, Advances in Cryptology — ASIACRYPT ’96, volume 1163 of Lecture Notes in Computer Science, pages 286–300. Springer-Verlag, 1996.
13. E. Fujisaki. A simple approach to secretly sharing a factoring witness in publiclyverifiable manner. (unpublished manuscript), 2001.
14. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. S. Kaliski Jr., editor, Advances in Cryptology — CRYPTO ’97, volume 1294 of Lecture Notes in Computer Science, pages 16–30. Springer-Verlag, 1997.
15. M. Jakobsson and J. Müller. Improved magic ink signatures using hints. In Financial Cryptography’99, 1999.
16. M. Jakobsson and M. Yung. Distributed ”Magic Ink” signatures. In W. Fumy, editor, Advances in Cryptology — EUROCRYPT ’97, volume 1233 of Lecture Notes in Computer Science, pages 450–464. Springer-Verlag, 1997.
17. A. Juels, M. Luby, and R. Ostrovsky. Security of blind digital signatures. In B. S. Kaliski Jr., editor, Advances in Cryptology — CRYPTO ’97, volume 1294 of Lecture Notes in Computer Science, pages 150–164. Springer-Verlag, 1997.
18. T. Okamoto and K. Ohta. Divertible zero knowledge interactive proofs and commutative random self-reducibility. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology – EUROCRYPT ’89, volume 434 of Lecture Notes in Computer Science, pages 134–149. Springer-Verlag, 1990.
19. T. Okamoto and S. Uchiyama. A new public-key cryptosystem as secure as factoring. In K. Nyberg, editor, Advances in Cryptology — EUROCRYPT ’98, volume 1403 of Lecture Notes in Computer Science, pages 308–318. Springer-Verlag, 1998.
20. D. Pointcheval and J. Stern. Provably secure blind signature schemes. In K. Kim and T. Matsumoto, editors, Advances in Cryptology – ASIACRYPT ’96, volume 1163 of Lecture Notes in Computer Science, pages 252–265. Springer-Verlag, 1996.
21. D. Pointcheval and J. Stern. Security proofs for signature schemes. In U. Maurer, editor, Advances in Cryptology — EUROCRYPT ’96, volume 1070 of Lecture Notes in Computer Science, pages 387–398. Springer-Verlag, 1996.
22. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 2000.
23. M. Stadler. Cryptographic Protocols for Revocable Privacy. PhD thesis, Swiss Federal Institute of Technology Zürich, 1996.
24. M. Stadler. Publicly verifiable secret sharing. In U. Maurer, editor, Advances in Cryptology — EUROCRYPT ’96, volume 1070 of Lecture Notes in Computer Science, pages 190–199. Springer-Verlag, 1996.
25. S. von Solms and D. Naccache. On blind signatures and perfect crime. Computer & Security, 11:581–583, 1992.
26. A. Young and M. Yung. Finding length-3 positive cunningham chains and their cryptographic significance. In ANTS ’98, Lecture Notes in Computer Science. Springer-Verlag, 1998.