Abstract
We propose a new untraceable electronic money system based on the discrete logarithm problem. Our system improves the efficiency of Yacobi's E-money system by making the applied blind signature partial. We compare our system to the previous e-money systems which use the ElGamal-type scheme in their tracing a double-spender.
We also remark a double-registration problem on a digital cash system, recently presented in [Nguyen-Mu-Varadharajan, in Information Security Workshop'97], based on the blind Nyberg-Rueppel signature.
A part of this work is done while visiting in Columbia University, Computer Science Dept.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Abe, J. Camenisch, “Partially Blind Signature Schemes,” Proceedings of the 1997 Symposium on Cryptography and Information Security, SCIS97-33D, 1997.
M. Abe, E. Fujisaki, “How to Date Blind Signatures,” Advances in Cryptology — ASACRYPT '96, LNCS 1163, pp. 244–251, 1996.
S. Brands, “Untraceable off-line cash in wallet with observers,” In Advances in Cryptology — CRYPTO '93, LNCS 773, pp. 302–318, 1994.
S. Brands, “Off-Line Electronic Cash Based on Secret-KeyCertificates,” Proceedings of the Second International Symposium of Latin American Theoretical Informatics, 1995. http://www.cwi.nl/cwi/publications/CS-R9506.ps.Z
S. Brands, “Restrictive Binding of Secret-Key Certificates,” Advances in Cryptology — EUROCRYPT '95, LNCS 921, pp.231–247, 1995.
A. Chan, Y. Frankel, P. MacKenzie, Y. Tsiounis, “Mis-representation of Identities in E-cash Schemes and how to Prevent it,” Advances in Cryptology — ASIACRYPT '96, LNCS 1163, pp. 276–285, 1996.
D. Chaum, A. Fiat, M. Naor, “Untraceable Electronic Cash,” In Advances in Cryptology — CRYPTO '88, pp. 319–327, 1988.
D. Chaum, “Blind Signature for Untraceable Payments,” In Advances in Cryptology — CRYPTO '82, pp. 199–203, 1983.
J. Camenisch, J. M. Piveteau, M. Stadler∄B!∄(B “Blind Signatures Based on the Discrete Logarithm Problem,” Advances in Cryptology — EUROCRYPT '94, LNCS 950, pp. 428–432, 1994.
T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, pp. 469–472, 1985.
M. K. Franklin, M. Yung “Secure and Efficient Off-line Digital Money,” Proceedings of ICALP '93, 1993.
O. Goldreich, S. Micali, A. Wigderson, “Proofs that yield nothing but their validity and a methodology of cryptographic protocol design,” Proceedings of IEEE FOCS '86, p.174–187, 1986.
P. Horster, M. Michels, H. Petersen, “Meta-ElGamal signature schemes,” Proceedings of 2nd ACM CCS manuscript, pp. 96–107, 1994.
P. Horster, M. Michels, H. Petersen, “Meta Message Recovery and Meta Blind signature schemes based on the discrete logarithm problem and their applications,” Advances in Cryptology — ASIACRYPT '94, LNCS 917, pp. 224–237, 1994.
S. Miyazaki, M. Abe, K. Sakurai, “Partially Blind Signature Schemes for the DSS and for a Discrete Log. based Message Recovery Signature,” Proceedings of the 1997 Korea-Japan Joint Workshop on Information Security and Cryptology, pp. 217–226, 1997.
NIST FIPS PUB XX, Digital Signature Standard(DSS), National Institute of Standards and Technology, U.S. Department of Commerce, DRAFT, 1993.
K. Q. Nguyen, Y. Mu, V. Varadharajan, “A new digital cash scheme based on blind Nyberg-Rueppel digital signature,” Pre-Proceedings of 1997 Information Security Workshop, pp. 219–226, 1997.
K. Nyberg, R. A. Rueppel, “A new signature scheme based on the DSA giving message recovery,” Proceedings of 1st ACM CCS manuscript, 1993.
D. Pointcheval, J. Stern, “Provably Secure Blind Signature Schemes,” Advances in Cryptology — ASIACRYPT '96, LNCS 1163, pp. 252–265, 1996.
C. P. Schnorr, “Efficient signature generation by smart cards,” Journal of Cryptology, pp. 161–174, 1991.
B. Schoenmakers, “An efficient electronic payment system with standing parallel attacks,” Technical report, CWI, 1995. http://www.cwi.n1/ftp/CWIreports/AA/CSR9522.ps.Z
Y. Yacobi, “Efficient electronic money,” Advances in Cryptology — ASIACRYPT '94, LNCS 917, pp. 153–163, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miyazaki, S., Sakurai, K. (1998). A more efficient untraceable e-cash system with partially blind signatures based on the discrete logarithm problem. In: Hirchfeld, R. (eds) Financial Cryptography. FC 1998. Lecture Notes in Computer Science, vol 1465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055490
Download citation
DOI: https://doi.org/10.1007/BFb0055490
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64951-9
Online ISBN: 978-3-540-53918-6
eBook Packages: Springer Book Archive