Abstract
In this paper we develop a new protocol for untraceable electronic cash, in which the bank involvement in the payment transaction between a user and a receiver is eliminated. The user withdraws electronic “coins“ from the bank and uses them to pay to a receiver. The receiver subsequently deposits the coins back to the bank. In the process the user remains anonymous, unless she spends a single coin more than once (double spend). The security of the system is based on DLA (Discrete Logarithm Assumption) and the cut-and-choose methodology.
The first author now is a visiting scholar at University of Southern Queensland in Australia from University of Info. Engeering, China
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Chaum. Blind signatures for untraceable payments. Advances in Cryptology. Proc. Crypto’82, pp:199–203.
D. Chaum, A. Fiat, and M. Naor. Un traceable electronic cash. In Advances in Cryptology Crypto’ 88, pp:319–327. Springer-Verlag, 1990.
D. Simon. Anonymous communication and anonymous cash. Advances in Cryptology, Proc. of Crypto’ 96, pp:61–73, Springer-Verlag, 1991.
Y. Yacobi. Efficien telectronic money. Advances in Cryptology, Proc. of Asiacrypt’ 94, pp: 153–163. Springer-Verlag, 1995.
T. Okamoto and K. Ohta. Disposable zero-kno wledge authen tication and their applications to untraceable electronic cash. Advances in Cryptology, Proc. of Crypto’ 89, pp:481–496, Springer-Verlag, 1990.
B. Pfitzmann and M. Waidner. How to break and repair a ‘provably secure’ untraceable payment system. Advances in Cryptology, Proc. of Crypto’91, pp:338–350, Springer-Verlag, 1992.
M. Franklin and M. Yung. Secure and efficient off-line digital money. In Proc. of the twentieth International Colloquium on Automata, Languages and Programming(ICALP 1993). (Lecture Notes in Computer Science 700), pp: 265–276. Springer-Verlag, 1993.
A. Chan, Y. Frankel, and Y. Tsiounis. An efficient off-line electronic cash scheme as secure as RSA. Research report NU-CCS-96-03, Northeastern University, Boston, Massachussets, 1995.
T. Okamoto. An efficient divisible electronic cash scheme. Advances in Cryptology. Proc. of Crypto’95, pp:438–451. Springer-Verlag, 1995.
Y. Frankel, T. Yiannis and M. Yung. Indirect Discourse Proofs: Achieving Fair Off-Line Electronic Cash. Asiacrypt’96, Lecture Notes in Computer Science 1163, pp: 286–300.
T. Yiannis. Fair Off-Line Cash made easy. Asiacrypt’98, Lecture Notes in Computer Science 1346, pp:240–252.
T. Yiannis, M. Yung. On the security of ElGamal-based encryption. In 1998 International Workshop on Practice and Theory in Public Key Cryptography (PKC’ 98), Japan, pp:37–49.
M. Bellare and P. Roga way. Random oracles are practical: a paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pp:62–73, 1993.
Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21,2 (Feb. 1978), pp:120–126.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, H., Zhang, Y. (2000). A Protocol for Untraceable Electronic Cash. In: Lu, H., Zhou, A. (eds) Web-Age Information Management. WAIM 2000. Lecture Notes in Computer Science, vol 1846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45151-X_18
Download citation
DOI: https://doi.org/10.1007/3-540-45151-X_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67627-0
Online ISBN: 978-3-540-45151-8
eBook Packages: Springer Book Archive