Abstract
This paper proposes the first ideal untraceable electronic cash system which solves the most crucial problem inherent with real cash and all previous untraceable electronic cash systems. The main advantage of the new system is that the customer can subdivide his cash balance, C (dollars), into many pieces in any way he pleases until the total value of all subdivided piece equals C. This system can be implemented efficiently. In a typical implementation, the data size of one piece of electronic cash is less than 100 bytes regardless of the face value of piece, the computation time for each transaction is several seconds, assuming the existence of a Rabin scheme chip. The security of this scheme relies on the difficulty of factoring.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E.R. Berlekamp, “Factoring Polynomials over Large Finite Fields,” Math. Comp., Vol.24, No.111, pp.713–735 (1970)
M. Blum, “Coin flipping by telephone”, IEEE, COMPCON, pp.133–137 (1982)
D. Chaum, “Security without Identification: Transaction Systems to Make Big Brother Obsolete,” Comm. of the ACM, 28,10, pp.1030–1044 (1985)
D. Chaum, A. Fiat and M. Naor, “Untraceable Electronic Cash,” Proc. of Crypto’88, pp.319–327 (1988)
J.L. Carter and M.N. Wegman, “Universal Classes of Hash Functions,” Journal of Computer and System Sciences, 18, pp.143–154 (1979)
I.B. Damgård, “Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals,” Proc. of Crypto’88, pp.328–335 (1988)
S. Even, O. Goldreich, A. Lempel: “A Randomized Protocol for Signing Contracts”, Proc. of Crypto’82, pp.205–210 (1982)
S. Even, O. Goldreich, Y. Yacobi: “Electronic Wallet”, Proc. of Crypto’83, pp.383–386 (1983)
A. Fujioka, T. Okamoto, S. Miyaguchi: “ESIGN: An Efficient Digital Signature Implementation for Smart Cards”, to appear in Proc. of Eurocrypt’91
B. Hayes, “Anonymous One-Time Signatures and Flexible Untraceable Electronic Cash,” Proc. of Auscrypt’90, pp.294–305 (1990)
T. Okamoto, and K. Ohta “Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash,” Proc. of Crypto’89, pp.481–496 (1989)
T. Okamoto, and K. Ohta “Divertible Zero-Knowledge Interactive Proofs and Commutative Random Self-Reducible,” Proc. of Eurocrypt’89 (1989)
B. Pfitzmann, M. Waidner, “How to Break and Repair a “Provably Secure” Untraceable Payment System,” to appear in Proc. of Crypto’91
M.O. Rabin, “Digitalized Signatures and Public-Key Functions as Intractable as Factorization,” Tech. Rep., MIT/LCS/TR-212, MIT Lab. Comp. Sci., (1979)
H.C. Williams, “A Modification of the RSA Public-Key Encryption Procedure,” IEEE Trans. on Information Theory, Vol.IT-26, No.6, pp.726–729 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okamoto, T., Ohta, K. (1992). Universal Electronic Cash. In: Feigenbaum, J. (eds) Advances in Cryptology — CRYPTO ’91. CRYPTO 1991. Lecture Notes in Computer Science, vol 576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46766-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-46766-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55188-1
Online ISBN: 978-3-540-46766-3
eBook Packages: Springer Book Archive