Advertisement

Making Electronic Refunds Safer

  • Rafael Hirschfeld
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 740)

Abstract

We show how to break an electronic cash protocol due to van Antwerpen (a refinement of the system proposed by Chaum, Fiat, and Naor), and given an alternative protocol that fixes the problem.

Keywords

Blind Signature Check Scheme Electronic Cash Unused Portion Electronic Money 
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

  1. 1.
    C. J. van Antwerpen, “Electronic cash,” master’s thesis, Eindhoven University of Technology (1990).Google Scholar
  2. 2.
    B. den Boer, D. Chaum, E. van Heyst, S. Mjølsnes, and A. Steenbeek, “Efficient offline electronic checks,” Proceedings of Eurocrypt’ 89, 294–301.Google Scholar
  3. 3.
    D. Chaum, “Blind signatures for untraceable payments,” Proceedings of Crypto’ 82, 199–203.Google Scholar
  4. 4.
    D. Chaum, A. Fiat, and M. Naor, “Untraceable electronic cash,” Proceedings of Crypto’ 88, 319–327.Google Scholar
  5. 5.
    T. Okamoto and K. Ohta, “Universal electronic cash,” Proceedings of Crypto’ 91.Google Scholar
  6. 6.
    M. O. Rabin, “Digitalized signatures,” Foundations of Secure Computation, Academic Press, NY (1978).Google Scholar
  7. 7.
    R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” CACM 21,2 (February 1978).Google Scholar
  8. 8.
    T. Veugen, “Some mathematical and computational aspects of electronic cash,” master’s thesis, Eindhoven University of Technology (1991).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Rafael Hirschfeld
    • 1
  1. 1.Laboratory For Computer ScienceMassachusetts Institute of TechnologyCambridge

Personalised recommendations