Abstract
We present a new construction for off-line electronic coins that is both far more efficient and much simpler than previous systems. Instead of using many terms, each for a single bit of the challenge, our system uses a single term for a large number of possible challenges. The withdrawal protocol does not use a cut-and-choose methodology as with earlier systems, but uses a direct construction.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Stefan Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, CWI (Centre for Mathematics and Computer Science), Amsterdam, 1993. Anonymous ftp://ftp.cwi.nl:/pub/CWIreports/AA/CS-R9323.ps.Z.
Stefan Brands. Electronic cash systems based on the representation problem in groups of prime order. In Proceedings of CRYPTO’ 93, 1994. To appear.
[CdBvH+90]_David Chaum, Bert den Boer, Eugène van Heyst, Stig Mjølsnes, and Adri Steenbeek. Efficient off-line electronic checks. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology—EUROCRYPT’ 89, Lecture Notes in Computer Science, pages 294–301. Springer-Verlag, 1990.
David Chaum, Amos Fiat, and Moni Naor. Untraceable electronic cash. In S. Goldwasser, editor, Advances in Cryptology—CRYPTO’ 88, Lecture Notes in Computer Science, pages 319–327. Springer-Verlag, 1990.
David Chaum. Online cash checks. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology—EUROCRYPT’ 89, Lecture Notes in Computer Science, pages 288–293. Springer-Verlag, 1990.
David Chaum. Randomized blind signature. Personal communications, April 1992.
Jan-Hendrik Evertse and Eugène van Heyst. Which new RSA-signatures can be computed from certain given RSA-signatures? J. Cryptology, 5(1):41–52, 1992.
Niels Ferguson. Single term off-line coins. Technical Report CS-R9318, CWI (Centre for Mathematics and Computer Science), Amsterdam, 1993. Anonymous ftp://ftp.cwi.nl:/pub/CWIreports/AA/CS-R9318.ps.Z.
Niels Ferguson. Extensions to single term off-line coins. In Proceedings of CRYPTO’ 93, 1994. To appear.
Matthew Franklin and Moty Yung. Secure and efficient off-line digital money. In A. Lingas, R. Karlsson, and S. Carlsson, editors, Automata, Languages and Programming, 20th International Colloquium, ICALP 93, Lund, Sweden, Lecture Notes in Computer Science 700, pages 265–276. Springer-Verlag, 1993.
Rafael Hirschfeld. Making electronic refunds safer. In Advances in Cryptology—CRYPTO’ 92, 1993. To appear.
Tatsuaki Okamoto and Kazuo Ohta. Universal electronic cash. In J. Feigenbaum, editor, Advances in Cryptology—CRYPTO’ 91, Lecture Notes in Computer Science, pages 324–337. Springer-Verlag, 1992.
Ronald Rivest, Adi Shamir, and Leonard Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21:120–126, February 1978.
Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612–613, 1979.
Hans van Antwerpen. Off-line electronic cash. Master’s thesis, Eindhoven University of Technology, department of Mathematics and Computer Science, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferguson, N. (1994). Single Term Off-Line Coins. In: Helleseth, T. (eds) Advances in Cryptology — EUROCRYPT ’93. EUROCRYPT 1993. Lecture Notes in Computer Science, vol 765. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48285-7_28
Download citation
DOI: https://doi.org/10.1007/3-540-48285-7_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57600-6
Online ISBN: 978-3-540-48285-7
eBook Packages: Springer Book Archive