Advertisement

Efficient Offline Electronic Checks

Extended Abstract
  • David Chaum
  • Bert den Boer
  • Eugène van Heyst
  • Stig Mjølsnes
  • Adri Steenbeek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 434)

Abstract

Chaum, Fiat, and Naor proposed an offline check system [1], which has the advantage that the withdrawal and (anonymous) payment of a check are unlinkable. Here we present an improved protocol that saves 91% of the signatures, 41% of the other multiplications, 73% of the divisions, and 33% of the bit transmissions.

Keywords

Payment System Improve Protocol Minor Term Card Computer Blinding Factor 
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]
    David Chaum, Amos Fiat, and Moni Naor, “Untraceable Electronic Cash”, to appear in Advances in Cryptology—Crypto’ 88, Lecture Notes in Computer Science, Springer-Verlag.Google Scholar
  2. [2]
    Jan-Hendrik Evertse and Eugène van Heyst, “Which RSA signatures can be computed from some given RSA signatures?”, in preparation, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • David Chaum
    • 1
  • Bert den Boer
    • 1
  • Eugène van Heyst
    • 1
  • Stig Mjølsnes
    • 1
  • Adri Steenbeek
    • 1
  1. 1.Centre for Mathematics and Computer ScienceAmsterdamThe Netherlands

Personalised recommendations