Transferred cash grows in size

99Citations
Citations of this article
50Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Chaum, D., & Pedersen, T. P. (1993). Transferred cash grows in size. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 658 LNCS, pp. 390–407). Springer Verlag. https://doi.org/10.1007/3-540-47555-9_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free