Transferred Cash Grows in Size
All known methods for transferring electronic money have the disadvantages that the number of bits needed to represent the money after each payment increases, and that a payer can recognize his money if he sees it later in the chain of payments (forward traceability). This paper shows that it is impossible to construct an electronic money system providing transferability without the property that the money grows when transferred. Furthermore it is argued that an unlimited powerful user can always recognize his money later. Finally, the lower bounds on the size of transferred electronic money are discussed in terms of secret sharing schemes.
- [Cha83]D. Chaum. Blind signatures for untraceable payments. In Advances in Cryptology — proceedings of CRYPTO 82, pages 199–203, 1983.Google Scholar
- [Cha84]D. Chaum. Blind signature systems. In Advances in Cryptology — proceedings of CRYPTO 83, 1984.Google Scholar
- [OO90]T. Okamoto and K. Ohta. Disposable zero-knowledge authentication and their applications to untraceable electronic cash. In Advances in Cryptology — proceedings of CRYPTO 89, pages 481–496, 1990.Google Scholar
- [OO92]T. Okamoto and K. Ohta. Universal electronic cash. In J. Feigenbaum, editor, Advances in Cryptology — proceedings of CRYPTO 91, Lecture Notes in Computer Science, pages 324–337. Springer-Verlag, 1992.Google Scholar
- [vA90]Hans van Antwerpen. Electronic cash. Master’s thesis, CWI, 1990.Google Scholar
- [Wel88]Dominic Welsh. Codes and Cryptography. Oxford University Press, 1988.Google Scholar