Abstract
In this paper we propose a coin-based electronic payment system suitable for small payments. It is derived from Brands' scheme presented at Crypto'93, in the sense that the coins are built using the representation problem. The main contribution of our solution consists of the speedup of the withdrawal protocol. The gain of efficiency is achieved preserving the same level of integrity for user, shop and bank. A coin remains untraceable with respect to the user. This feature is fulfilled even if one assumes that the bank has unlimited computing power and colludes with shops in order to trace a coin to a specific user. However, a set of coins axe linkable to a pseudonym of the user, restricting in this way his privacy. This drawback can be limited by “rotating” coins derived from different pseudonyms in a set of consecutive payment transactions.
Preview
Unable to display preview. Download preview PDF.
References
S. Brands. Untraceable off-line cash in wallet with observers. In Advances in Cryptology—CRYPTO '93, volume 773 of Lecture Notes in Computer Science, pages 302–318, Berlin, 1993. Springer-Verlag.
S. Brands. An efficient off-line electronic cash system based on the representation problem. Report CS-119323, Centrum voor Wiskunde en Informatica, March 1993.
D. Chaum, B. den Boer, E. van Heyst, S. Mjølsnes, and A. Steenbeek. Efficient offline electronic checks. In Advances in Cryptology—EUROCRYPT '89, volume 434 of Lecture Notes in Computer Science, pages 294–301, Berlin, 1990. Springer-Verlag.
D. Chaum, A. Fiat, and M. Naor. Untraceable electronic cash. In Advances in Cryptology—CRYPTO '88, volume 403 of Lecture Notes in Computer Science, pages 319–327, Berlin, 1990. Springer-Verlag.
D. Chaum and T. P. Pedersen. Wallet databases with observers. In Advances in Cryptology—CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 89–105, Berlin, 1993. Springer-Verlag.
N. T. Ferguson.Single term off-line coins. In Advances in Cryptology—EUROCRYPT '93, volume 765 of Lecture Notes in Computer Science, pages 318–328, Berlin, 1993. Springer-Verlag.
M. Franklin and M. Yung. Towards provably secure efficient electronic cash. Technical report CUCS-018-92, Columbia University, Dept. of Computer Science, April 1992.
M. Franklin and M. Yung. Secure and efficient off-line digital money. In Automata, Languages and Programming, ICALP 93, volume 700 of Lecture Notes in Computer Science, pages 265–276, Berlin, 1993. Springer-Verlag.
T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. In Advances in Cryptology—CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 31–53, Berlin, 1993. Springer-Verlag.
T. Okamoto and K. Ohta. Universal electronic cash. In Advances in Cryptology—CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 324–337, Berlin, 1992. Springer-Verlag.
C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161–174, 1991.
Y. Yacobi. Efficient electronic money. In Advances in Cryptology—ASIA CRYPT '94, volume 917 of Lecture Notes in Computer Science, pages 153–164, Berlin, 1994. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Radu, C., Govaerts, R., Vandewalle, J. (1997). Efficient electronic cash with restricted privacy. In: Hirschfeld, R. (eds) Financial Cryptography. FC 1997. Lecture Notes in Computer Science, vol 1318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63594-7_67
Download citation
DOI: https://doi.org/10.1007/3-540-63594-7_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63594-9
Online ISBN: 978-3-540-69607-0
eBook Packages: Springer Book Archive