Abstract
Current e-cash systems with off-line bank are too complex to be practical for inexpensive e-wallets. In this paper we propose a new paradigm for e-cash, that relaxes the demands from e-cash systems, and thus enables simpler schemes. One first example along these lines is presented, which is significantly simpler in terms of computation complexity than the best previously published e-cash scheme (one or three orders of magnitude, depending on situation).
It is recommended to use the NIST DSS member of the EG family, since this makes this deterministic (also it is more efficient).
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. Brand Electronic Cash Systems Based On The Representation Problem In Groups Of Prime Order, Proceedings of Crypto'93, Santa Barbara 1993, pp. 26.1–26.15.
E.F. Brickell, D. Chaum, I.B. Damgard, and J. van de Graaf Gradual and Verifiable Release of a Secret, Proc. Crypto'87.
D. Chaum Achieving Electronic Privacy Scientific American, August 1992, pp. 96–101.
D. Chaum, A. Fiat, M. Naor Untraceable Electronic Cash, Proc. Crypto 1988.
W. Diffie, M. Hellman New Directions in Cryptography IEEE Trans. IT. 1976
T. ElGamal A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans. IT, Vol. IT-31, No. 4, July 1985, pp. 469–472.
S. Even, O. Goldreich, Y. Yacobi, Electronic Wallet, Proc. Crypto'83. A later version appeared in Proc. 1984 International Zurich Seminar on Digital Communications, pp. 199–201, IEEE cat No. 84CH1998-4.
T. Eng, T. Okamoto, Single-Term Divisible Electronic Coins, Proc. Eurocrypt'94, pp. 311–323.
M. Franklin, M. Yung, Secure and Efficient Off-Line Digital Money, Proc. ICALP 93, pp. 449–460 (1993)
Goldreich, Micali, and Wigderson Proofs that yield nothing, but their validity, or All languages in NP have zero-knowledge proof systems. J. of the ACM, 38: 691–729, 1991.
Goldwasser, Micali, and Rackoff, The knowledge complexity of Interactive proof systems, SIAM J. on Computing, 181, 1989, pp. 186–208.
T. Okamoto, K. Ohta, Disposable Zero-Knowledge Authentication and Their Application to Untraceable Electronic Cash, Proc. Crypto'89, pp. 481–496 (Springer-Verlag, LNCS 435, G. Brassard Ed.)
M.O. Rabin, Digitalized signatures, in Foundations of secure computation, Academic Press, NY, 1978.
R. Rivest, A. Shamir, and L. Adelman A method for obtaining digital signatures and public key cryptosystems, CACM, vol. 21, 1978, pp. 120–126.
Y. Yacobi, Efficient Non-Traceable Digital Checks, Witnessed and signed Bellcore Lab-Notebook, pp. 49–53, June 17, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yacobi, Y. (1995). Efficient electronic money. In: Pieprzyk, J., Safavi-Naini, R. (eds) Advances in Cryptology — ASIACRYPT'94. ASIACRYPT 1994. Lecture Notes in Computer Science, vol 917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000431
Download citation
DOI: https://doi.org/10.1007/BFb0000431
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59339-3
Online ISBN: 978-3-540-49236-8
eBook Packages: Springer Book Archive