Abstract
Okamoto and Ohta [OO91, OO93] proposed a digital cash protocol and showed that it satisfies some useful properties for digital cash as well as basic requirements such as security. One of its features is “divisibility”; i.e., a property that enables us to subdivide a piece of given digital cash into several pieces of smaller value. There is, however, some problem in their implementation of this feature: the amount of data transfer per payment may increase depending on the amount of the payment and how the coins have been used. Here we propose a new protocol by which we can fix the amount of data transfer per payment, which is much smaller than the average amount necessary in Okamoto-Ohta protocol.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.L. Carter and M.N. Wegman, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), 143–154.
D. Chaum, Security without identification: transaction systems to make big brothers obsolete, Comm. of the ACM, 28 (1985), 1030–1044.
D. Chaum and T. Pedersen, Transferred cash grows in size, in Proc. EUROCRYPTO'92 Lecture Notes in Computer Science 58 (1993), 390–407.
D. Chaum, A. Fiat, and M. Naor, Untraceable electronic cash, in Advances in Cryptology: Proc. of CRYPTO'88, Lecture Notes in Computer Science 403 (1990), 319–327.
. Goldreich, Foundations of Cryptography, in Electric Colloquim on Computational Complexity (http://www. informatik.uni-trier.de: 80 /eccc/), 1995.
M. Naor and M. Yung, Universal one-way hash functions and their cryptographic application, in Proc. 21st ACM Sympos. on Theory of Computing (1989), 203–210.
T. Okamoto and K. Ohta, Disposable zero-knowledge authentication and their applications to untraceable electronic cash, in Advances in Cryptology: Proc. of CRYPTO'89, Lecture Notes in Computer Science 435 (1990), 134–149.
T. Okamoto and K. Ohta, Universal electronic cash, in Advances in Cryptology: Proc. of CRYPTO'91, Lecture Notes in Computer Science 576 (1992), 324–337.
T. Okamoto and K. Ohta, Universal electronic cash scheme (in Japanese), IEICE Trans. D-I, J76-D-I (1993), 315–323.
A. Otsuka and T. Shinohara, On electronic cash (in Japanese), Journal of Info. Process. Soc. Japan, 37 (1996), 303–310.
R.L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. of the ACM, 21 (1978), 120–126.
B. Schneier, Applied Cryptography, John Wiley & Sons, Inc., 1994.
O. Yamashita, Some Technical Problems on Digital Cash (in Japanese), Master's Thesis, Tokyo Institute of Technology, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Watanabe, O., Yamashita, O. (1996). An improvement of the digital cash protocol of Okamoto and Ohta. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009520
Download citation
DOI: https://doi.org/10.1007/BFb0009520
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62048-8
Online ISBN: 978-3-540-49633-5
eBook Packages: Springer Book Archive