Advertisement

Untraceable Electronic Cash

(Extended Abstract)
  • David Chaum
  • Amos Fiat
  • Moni Naor
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 403)

Abstract

The use of credit cards today is an act of faith on the p a t of all concerned. Each party is vulnerable to fraud by the others, and the cardholder in particular has no protection against surveillance.

Keywords

Proper Form Account Number Boolean Circuit Major Candidate Digital Signature Scheme 
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. [BC86a]
    Brassard, G. and C. Crépeau, Zero-knowledge simulation of Boolean circuits, presented at Crypto’ 86, 1986.Google Scholar
  2. [BC86b]
    Brassard, G. and C. Crépeau, Zero-knowledge simulation of Boolean circuits, Proc. of 27th Symp. on Foundations of Computer Science, 1986.Google Scholar
  3. [BCC]
    Brassard, G., Chaum D., and C. Crépeau, Minimum Disclosure Proofs of Knowledge. Center for Mathematics and Computer Science, Report PM-R8710, December 1987.Google Scholar
  4. [C85]
    Chaum, D., Security without identification: transaction systems to make big brother obsolete, Comm. ACM 28,10 (October 1985).Google Scholar
  5. [C86]
    Chaum, D., Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How, presented at Crypto’ 86, 1986.Google Scholar
  6. [C88]
    Chaum, D., Privacy Protected Payments: Unconditional Payer And/Or Payee Untracability, Smartcard 2000, North Holland, 1988.Google Scholar
  7. [CE]
    Chaum, D. and J.H. Evertse, Showing credentials without identification: signatures transferred between unconditionally unlinkable pseudonyms, Proceedings of Crypto’ 86, Springer-Verlag, 1987.Google Scholar
  8. [CDG]
    Chaum, D., I. Damgaard, and J. v.d. Graaf, Multiparty computations ensuring the privacy of each party’s input and the correctness of the result, Proceedings of Crypto 87, Springer-Verlag, 1988.Google Scholar
  9. [GMR]
    Goldwasser, S., S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, Proc. of 17th ACM symp. on Theory of Computation, 1985.Google Scholar
  10. [GMW86a]
    Goldreich, O., S. Micali, and A. Wigderson, How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design, presented at Crypto’ 86, 1986.Google Scholar
  11. [GMW86b]
    Goldreich, O., S. Micali, and A. Wigderson, Proofs that yield nothing but their validity and a methodology of cryptographic protocol design, Proc. of 27th Symp. on Foundations of Computer Science, 1986.Google Scholar
  12. [R77]
    Rabin, M.O., Digitalized signatures, in Foundations of Secure Computation, Academic Press, NY, 1978.Google Scholar
  13. [RSA]
    Rivest, R.L., A. Shamir, and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, CACM 21,2 (February 1978).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • David Chaum
    • 1
  • Amos Fiat
    • 2
  • Moni Naor
    • 3
  1. 1.Center for Mathematics and Computer ScienceAmsterdamThe Netherlands
  2. 2.Tel-Aviv UniversityTel-AvivIsrael
  3. 3.IBM Almaden Research CenterSan Jose

Personalised recommendations