Abstract
Blind signature schemes allow a person to get a message signed by another party without revealing any information about the message to the other party. To believe the message contains a certain form, cut and choose protocol and partially blind signature protocol are used to prevent cheating. In electronic cash system, unconditional anonymity may be misused for criminal activities such as blackmailing and money laundering. Fair electronic cash schemes are introduced for preventing these fraudulent activities. In this paper, we point out a weakness in Fan and Lei’s user efficient blind signatures. Utilizing this weakness, a user can cheat the signer in cut and choose protocol, and the user can also break Fan and Lei’s low-computation partially blind signature scheme and Yu et al.’s user efficient fair e-cash scheme.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abe, M., Fujisaki, E.: How to date blind signatures. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 244–251. Springer, Heidelberg (1996)
Cao, T., Lin, D., Xue, R.: Cryptanalysis of User Efficient Fair E-Cash Schemes. In: Proceedings of 16th International Conference on Computer Communication, pp. 524–528 (2004)
Chaum, D.: Blind signatures for untraceable payments. In: Advances in Cryptology -CRYPTO 1982, pp. 199–203. Plenum (1983)
Chaum, D., Fiat, A., Naor, M.: Untraceable Electronic Cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 319–327. Springer, Heidelberg (1990)
Fan, C.-I.: Improved low-computation partially blind signatures. Applied Mathematics and Computation 145(2-3), 853–867 (2003)
Fan, C.-I., Lei, C.-L.: User efficient blind signatures. Electronics letters 34(6), 544–546 (1998)
Fan, C.-I., Lei, C.-L.: Low-Computation Partially Blind Signatures for Electronic Cash, IEICE Transactions on Fundamentals of Electronics. Communications and Computer Sciences E81-A(5), 818–824 (1998)
Fan, C.-I., Lei, C.-L.: Divisible Blind Signatures Based on Hash Chains. International Journal of Computers and Application 26(1), 202–210 (2004)
Liao, G.-J.: Presentation of improved low-computation partially blind signatures (2003), http://140.134.25.71/~education/subgroup_2/031021.ppt
Pollard, J.M., Schnorr, C.P.: An efficient solution of the congruence x 2+ky 2 = m(mod n). IEEE Transactions on Information Theory 33(5), 702–709 (1987)
von Solms, S., Naccache, D.: On blind signatures and perfect crimes. Computer & Security 11, 581–583 (1992)
Stadler, M., Piveteau, J.M., Camenisch, J.: Fair Blind Signatures. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 209–219. Springer, Heidelberg (1995)
Yu, P.-L., Lei, C.-L., Chen, H.-J., Huang, C.-Y.: User Efficient Fair Blind Signatures. In: The Second International Workshop for Asian Public Key Infrastructures (2002), http://dsns.csie.nctu.edu.tw/iwap/proceedings/proceedings/sessionD/15.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cao, T., Lin, D., Xue, R. (2004). Security Analysis of User Efficient Blind Signatures. In: Chi, CH., Lam, KY. (eds) Content Computing. AWCC 2004. Lecture Notes in Computer Science, vol 3309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30483-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-30483-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23898-0
Online ISBN: 978-3-540-30483-8
eBook Packages: Springer Book Archive