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.
Work done while the second and third authors were at the University of California at Berkeley. The work of the second author was supported by a Weizmann Postdoctoral Fellowship and by NSF Grants DCR 84-11954 and DCR 85-13926. The work of the third author was supported by NSF Grants DCR 85-13926 and CCR 88-13632.
Download conference paper PDF
References
Brassard, G. and C. Crépeau, Zero-knowledge simulation of Boolean circuits, presented at Crypto’ 86, 1986.
Brassard, G. and C. Crépeau, Zero-knowledge simulation of Boolean circuits, Proc. of 27th Symp. on Foundations of Computer Science, 1986.
Brassard, G., Chaum D., and C. Crépeau, Minimum Disclosure Proofs of Knowledge. Center for Mathematics and Computer Science, Report PM-R8710, December 1987.
Chaum, D., Security without identification: transaction systems to make big brother obsolete, Comm. ACM 28,10 (October 1985).
Chaum, D., Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How, presented at Crypto’ 86, 1986.
Chaum, D., Privacy Protected Payments: Unconditional Payer And/Or Payee Untracability, Smartcard 2000, North Holland, 1988.
Chaum, D. and J.H. Evertse, Showing credentials without identification: signatures transferred between unconditionally unlinkable pseudonyms, Proceedings of Crypto’ 86, Springer-Verlag, 1987.
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.
Goldwasser, S., S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, Proc. of 17th ACM symp. on Theory of Computation, 1985.
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.
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.
Rabin, M.O., Digitalized signatures, in Foundations of Secure Computation, Academic Press, NY, 1978.
Rivest, R.L., A. Shamir, and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, CACM 21,2 (February 1978).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaum, D., Fiat, A., Naor, M. (1990). Untraceable Electronic Cash. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_25
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_25
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive