Single Term Off-Line Coins

  • Niels Ferguson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 765)

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.

References

  1. [Bra93]
    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.Google Scholar
  2. [Bra94]
    Stefan Brands. Electronic cash systems based on the representation problem in groups of prime order. In Proceedings of CRYPTO’ 93, 1994. To appear.Google Scholar
  3. [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.Google Scholar
  4. [CFN90]
    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.CrossRefGoogle Scholar
  5. [Cha90]
    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.Google Scholar
  6. [Cha92]
    David Chaum. Randomized blind signature. Personal communications, April 1992.Google Scholar
  7. [EvH92]
    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.MATHCrossRefMathSciNetGoogle Scholar
  8. [Fer93]
    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.Google Scholar
  9. [Fer94]
    Niels Ferguson. Extensions to single term off-line coins. In Proceedings of CRYPTO’ 93, 1994. To appear.Google Scholar
  10. [FY93]
    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.Google Scholar
  11. [Hir93]
    Rafael Hirschfeld. Making electronic refunds safer. In Advances in Cryptology—CRYPTO’ 92, 1993. To appear.Google Scholar
  12. [OO92]
    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.Google Scholar
  13. [RSA78]
    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.MATHCrossRefMathSciNetGoogle Scholar
  14. [Sha79]
    Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612–613, 1979.MATHCrossRefMathSciNetGoogle Scholar
  15. [vA90]
    Hans van Antwerpen. Off-line electronic cash. Master’s thesis, Eindhoven University of Technology, department of Mathematics and Computer Science, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Niels Ferguson
    • 1
  1. 1.CWIAmsterdamNetherlands

Personalised recommendations