Abstract
We propose considering the problem of electronic cash in the context of a network in which anonymous, untraceable communication is assumed to be possible. We present a formal model for such a network, and define security criteria for an electronic cash system in such a setting. Finally, we show that there exists a remarkably simple electronic cash system which meets the security criteria of the proposed model.
Chapter PDF
Similar content being viewed by others
References
D. Beaver, Foundations of Secure Interactive Computing, Proc. CRYPTO’ 91, pp. 377–391.
S. Brands, Untraceable Off-Line Cash in Wallet with Observers, Proc. CRYPTO 93, pp. 302–318.
M. Bellare and P. Rogaway, Entity Authentication and Key Distribution, Proc. CRYPTO’ 93, pp. 232–249.
D. Chaum, Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, CACM vol. 24, no. 2 (1981), p. 84–88.
D. Chaum, The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability, Journal of Cryptology vol. 1, no. 1 (1988), pp. 65–75.
D. Chaum, Elections with Unconditionally Secret Ballots and Disruption Equivalent to Breaking RSA, Proc. EUROCRYPT’ 88, pp. 177–182.
D. Chaum, Privacy Protected Payments-Unconditional Payer and/or Payee Untraceability, SMART CARD 2000: The Future of IC Cards-Proc. IFIP WG 11.6 Intl Conf., North-Holland (1989), pp. 69–93.
D. Chaum, On-line Cash Checks, Proc. EUROCRYPT 89, pp. 288–293.
R. Cleve, Limits on the Security of Coin Flips When Half the Processors are Faulty, Proc. 18th ACM Symposium on Theory of Computing (1986), pp. 364–369.
D. Chaum, A. Fiat and M. Naor, Untraceable Electronic Cash, Proc. CRYPTO’ 88, pp. 319–327.
S. Even, O. Goldreich and Y. Yacobi, Electronic Wallet, Proc. CRYPTO 83, pp. 383–386.
M. Franklin and M. Yung, Secure and Efficient Off-Line Digital Money, Proc. 20th Intl Colloquium on Automata, Languages and Programming (1993), pp. 265–276.
S. Goldwasser, S. Micali and R. Rivest, A Digital Signature Scheme Secure against Adaptive Chosen-Message Attacks, SIAM J. Computing 17(2) (1988), pp. 281–301.
M. Jakobsson, Ripping Coins for a Fair Exchange, Proc. EUROCRYPT’ 95, pp. 220–230.
G. Medvinsky and B.C. Neuman, Netcash: a Design for Practical Electronic Currency on the Internet, Proc. 1st ACM Conference on Computer and Communications Security (1993).
S. Micali and P. Rogaway, Secure Computation, Proc. CRYPTO’ 91, pp. 392–404.
T. Okamoto and K. Ohta, Universal Electronic Cash, Proc. CRYPTO 91, pp. 324–337.
B. Pfitzmann and M. Waidner, How to Break and Repair a “Provably Secure” Untraceable Payment System, Proc. CRYPTO’ 91, pp. 338–350.
J. Rompel, One-Way Functions Are Necessary and Sufficient for Secure Signatures, Proc. 31st IEEE Symp. on Foundations of Computer Science (1990), pp. 387–394.
C. Rackoff and D. Simon, Cryptographic Defense Against Traffic Analysis, Proc. 25th ACM Symp. on the Theory of Computation (1993), pp. 672–681.
Y. Yacobi, Efficient Electronic Money, Proc. ASIACRYPT 94.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simon, D.R. (1996). Anonymous Communication and Anonymous Cash. In: Koblitz, N. (eds) Advances in Cryptology — CRYPTO ’96. CRYPTO 1996. Lecture Notes in Computer Science, vol 1109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68697-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-68697-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61512-5
Online ISBN: 978-3-540-68697-2
eBook Packages: Springer Book Archive