Abstract
At Crypto'92, Micali [6] introduced the concept of fair cryptosystems for preventing misuse of strong cryptosystems by criminals. At Eurocrypt'95, Stadler and al. [9] proposed the concept of fair Blind Signature Schemes (fair BSS in short) aimed to solve the same issue within the context of blind signature schemes. In fair BSS (unlike “ordinary” blind signature schemes) the signer doesn't completely lose control of the signatures that he issues. By using fair blind signatures, for example within anonymous payment schemes (instead of ordinary blind signatures), one can prevent embezzlement by criminals such as money-laundering and perfect black-mailing [10]. In this paper, we show that one of the fair BSS proposed by Stadler and al. [9] is not fair.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Brands, Untraceable Off-Line Cash in Wallets with Observers, Proceedings of CRYPTO'93, Lecture Notes in Computer Science, Vol. 773, Springer-Verlag, pp. 302–318.
D. Chaum, Blind Signatures for Untraceable Payments, Proceedings of CRYPTO'82, Plenum Press, 1983, pp. 199–203.
D. Chaum, A. Fiat and M. Naor, Untraceable Electronic Cash, Proceedings of CRYPTO'88, Lecture Notes in Computer Science, Vol. 403, Springer-Verlag, pp. 319–327.
S. Even, O. Goldreich and A. Lempel, A Randomized Protocol for Signing Contracts, Communications of the ACM, 28, 1985, pp. 637–647.
A. Fiat and A. Shamir, How to Prove Yourself. Practical Solutions to Identification and Signature Problems, Proceedings of CRYPTO'86, Lecture Notes in Computer Science, Vol. 263, Springer-Verlag, pp. 186–194.
S. Micali, Fair Cryptosystems, Technical Report MIT/LCS/TR-579.b, 1993.
T. Okamoto and K. Ohta, Divertible Zero-Knowledge Interactive Proofs and Commutative Random Self-Reducibility, Proceedings of EUROCRYPT”89, Lecture Notes in Computer Science, Vol. 434, Springer-Verlag, pp. 134–149.
M. Stadler, Cryptographic Protocols for Revocable Privacy, Ph.D. Thesis,ETH Zürich, 1996. Diss. ETH No. 11651.
M. Stadler, J.M. Piveteau and J. Camenisch, Fair Blind Signatures, Proceedings of EUROCRYPT'95, Lecture Notes in Computer Science, Vol. 921, Springer-Verlag, pp. 209–219.
S. von Solms and D. Naccache, On Blind Signatures and Perfect Crimes, Computer & Security, 11, 1992, pp. 581–583.
S.S. Wagstaff Jr, Greatest of the Least Primes in Arithmetic Progression Having a Given Modulus, Mathematics of Computation, 33(147), pp. 1073–1080.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Traoré, J. (1997). Making unfair a “Fair” blind signature scheme. In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028494
Download citation
DOI: https://doi.org/10.1007/BFb0028494
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63696-0
Online ISBN: 978-3-540-69628-5
eBook Packages: Springer Book Archive