Abstract
Most anonymous, electronic cash systems are signature-based. A side effect of this is that in these systems the bank has the technical ability to issue unreported, valid money. It has been noticed in the past that this may lead to a disaster if the secret key of the bank is compromised. Furthermore, the above feature prevents any effective monitoring of the system.
In this paper we build a fully anonymous, auditable system, by constructing an electronic cash system that is signature-free, and where the bank needs to have no secret at all. The security of the system relies instead on the ability of the bank to maintain the integrity of a public database. Our system takes a completely new direction for meeting the above requirements, and, in particular, it is the first to do so without the necessity of making individual transactions potentially traceable: payers enjoy unconditional anonymity for their payment transactions. The system is theoretically efficient but not yet practical.
Chapter PDF
Similar content being viewed by others
Keywords
References
FATF-VII report on money laundering typologies. Financial Crimes Enforcement Network Publications, August 1996. http://www.treas.gov/fincen/pubs.html.
Cyberpayments and money laundering. RAND, 1998. http://www.rand.org/publications/MR/MR965/MR965.pdf/.
D. Bayer, S. Haber, and W. S. Stornetta. Improving the efficiency and reliability of digital time-stamping. In R. M. Capocelli et al., editor, Sequences II: Methods in Communication, Security and Computer Science, pages 329–334. SV, New York, 1992.
Bellare, Jakobsson, and Yung. Round-optimal zero-knowledge arguments based on any one-way function. In EUROCRYPT: Advances in Cryptology: Proceedings of EUROCRYPT, 1997.
M. Bellare and O. Goldreich. On defining proofs of knowledge. In Ernest F. Brickell, editor, Advances in Cryptology—CRYPTO’ 92, volume 740 of Lecture Notes in Computer Science, pages 390–420. Springer-Verlag, 1993, 16–20 August 1992.
Mihir Bellare and Phillip Rogaway. Random oracles are practical: A pardigm for designing efficient protocols. In Victoria Ashby, editor, 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, November 1993. ACM Press. also appeared as IBM RC 19619 (87000) 6/22/94.
J. Benaloh and M. de Mare. One-way accumulators: A decentralized alternative to digital signatures. Lecture Notes in Computer Science, 765:274–--, 1994.
J. Benaloh and M. de Mare. Efficient broadcast time-stamping. Technical Report 1, Clarkson University Department of Mathematics and Computer Sciences. August, 1991.
S. Brands. An efficient off-line electronic cash system based on the representation problem. In 246. Centrum voor Wiskunde en Informatica (CWI), ISSN 0169-118X, December 31 1993. AA (Department of Algorithmics and Architecture), CS-R9323, ftp://ftp.cwi.nl/pub/CWIreports/AA/CS-R9323.ps.Z.
S. Brands. Untraceable off-line cash in wallet with observers. In Douglas R. Stinson, editor, Crypto 93, volume 773 of LNCS, pages 302–318. SV, 1993.
Brassard and Crepeau. Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond. In FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), 1986.
G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37:156–189, 1988.
E. Brickell, P. Gemmell, and D. Kravitz. Trustee-based tracing extensions to anonymous cash and the making of anonymous change. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’95), pages 457–466. Sandia National Labs, January 1995.
Report by the Committee on Payment, Settlement Systems, and the Group of Computer Experts of the central banks of the Group of Ten countries. Security of electronic money. Publication of the Bank for International Settlements, Basle, August 1996. http://www.bis.org/publ/index.htm.
J. Camenisch, U. Maurer, and M. Stadler. Digital payment systems with passive anonymity-revoking trustees. Lecture Notes in Computer Science, 1146:33, 1996.
J. Camenisch, J. Piveteau, and M. Stadler. Fair blind signatures. In L. Guilloy and J-J. Quisquater, editors, EuroCrypt 95, LNCS, pages 209–219. SV, 1995.
J. Camenisch, J. Piveteau, and M. Stadler. An efficient fair payment system. In Clifford Neuman, editor, 3rd ACM Conference on Computer and Communications Security, pages 88–94, New Delhi, India, March 1996. ACM Press.
G. Davida, Y. Frankel, Y. Tsiounis, and Moti Yung. Anonymity control in E-cash systems. In Rafael Hirschfeld, editor, Financial Cryptography: First International Conference, FC’ 97, volume 1318 of Lecture Notes in Computer Science, pages 1–16, Anguilla, British West Indies, 24–28 February 1997. Springer-Verlag.
E. Fujisaki and T. Okamoto. Practical escrow cash system. Lecture Notes in Computer Science, 1189:33–--, 1997.
General Accounting Offce (GAO). Private banking: Raul Salinas, Citibank, and alleged money laundering. GAO/OSI-99-1, December 1998. http://www.gao.gov/monthly.list/dec98/dec9811.htm.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(3):691–729, July 1991.
Oded Goldreich, Silvio Micali, and Avi Wigderson. How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (extended abstract). In A. M. Odlyzko, editor, Advances in Cryptology—CRYPTO’ 86, volume 263 of Lecture Notes in Computer Science, pages 171–185. Springer-Verlag, 1987, 11–15 August 1986.
Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186–208, February 1989.
Stuart Haber and W. Scott Stornetta. How to time-stamp a digital document. Journal of Cryptology, 3(2):99–111, 1991.
M. Jakobsson and J. Muller. Improved magic ink signatures using hints. In proceedings of Financial Cryptography’ 99. Forthcoming volume in Lecture Notes in Computer Science, 1999.
M. Jakobsson and M. Yung. Revokable and versatile electronic mony. In Clifford Neuman, editor, 3rd ACM Conference on Computer and Communications Security, pages 76–87, New Delhi, India, March 1996. ACM Press.
R. Merkle. Protocols for public key cryptosystems. In IEEE, editor, Proceedings of the 1980 Symposium on Security and Privacy, April –, 1980 Oakland, California, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1980. IEEE Computer Society Press.
D. M’Raihi. Cost-effective payment schemes with privacy regulation. In Kwangjo Kim and Tsutomu Matsumoto, editors, Advances in Cryptology— ASIACRYPT’ 96, volume 1163 of Lecture Notes in Computer Science, pages 266–275, Kyongju, Korea, 3-7 November 1996. Springer-Verlag.
M. Naor, R. Ostrovsky, Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology, 11, 1998.
K. Nyberg. Fast accumulated hashing. In Dieter Grollman, editor, Fast Software Encryption: Third International Workshop, volume 1039 of Lecture Notes in Computer Science, pages 83–87, Cambridge, UK, 21–23 February 1996. Springer-Verlag.
Basle Committee on Banking Supervision. Core principles for effective banking supervision. Publication of the Bank for International Settlements, Basle, September 1997. http://www.bis.org/publ/index.htm.
Basle Committee on Banking Supervision. Risk management for electronic banking and electronic money activities. Publication of the Bank for International Settlements, Basle, March 1998. http://www.bis.org/publ/index.htm.
H. Peterson and G. Poupard. Efficient scalable fair cash with off-line extortion prevention. Lecture Notes in Computer Science, 1334:463, 1997.
T. Sander. Efficient accumulators without trapdoor. Manuscript, 1999.
T. Sander and A. Ta-Shma. Flow control: A new approach for anonymity control in electronic cash systems. In proceedings of Financial Cryptography’ 99. Forthcoming volume in Lecture Notes in Computer Science, 1999.
Daniel R. Simon. Anonymous communication and anonymous cash. In Neal Koblitz, editor, Advances in Cryptology—CRYPTO’ 96, volume 1109 of Lecture Notes in Computer Science, pages 61–73. Springer-Verlag, 18–22 August 1996.
S. von Solms and D. Naccache. On blind signatures and perfect crimes. Computers and Security, 11(6):581–583, October 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sander, T., Ta-Shma, A. (1999). Auditable, Anonymous Electronic Cash. In: Wiener, M. (eds) Advances in Cryptology — CRYPTO’ 99. CRYPTO 1999. Lecture Notes in Computer Science, vol 1666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48405-1_35
Download citation
DOI: https://doi.org/10.1007/3-540-48405-1_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66347-8
Online ISBN: 978-3-540-48405-9
eBook Packages: Springer Book Archive