Skip to main content
SpringerLink
Log in

A Fair Electronic Cash Scheme

  • Conference paper
  • First Online:
Electronic Commerce Technologies (ISEC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2040))

Included in the following conference series:

Abstract

This paper proposes a fair anonymous electronic cash scheme that ensures fairness for both clients and vendors. The proposed scheme is based on the Nyberg-Rueppel digital signature scheme, therefore it provides an alternative for the construction of fair electronic cash. The proposed scheme meets all basic security requirements for fair electronic cash including fairness, anonymity, confidentiality, authenticity, efficiency and double-spending detection.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Brands. Rapid demonstration of linear relations connected by boolean operators. In Advances in Cryptology-Eurocrypt'97, pages 318–333. LNCS vol. 1223, Springer-Verlag, 1997.

    Google Scholar 

  2. E.F. Brickell, P. Gemmell, and D. Kravitz. Trustee-based tracing extensions to anonymous cash and the making of anonymous change. In In symposium on Distributed Algorithms(SODA). Albuquerque, NM. Available from http://www.cs.sandia.gov/psgemme/., 1995.

    Google Scholar 

  3. J. Camenisch. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problems. PhD thesis, Swiss Federal Institute of Technology, Zurich, 1998. 28 Y. Mu, K.Q. Nguyen, and V. Varadharajan

    Google Scholar 

  4. J. Camenisch and M. Michels. Proving in zero-knowledge that a number is the product of two safe primes. Technical Report RS-98-29, BRICS, 1999. an abstract version appeared in Proceeding of Eurocrypt'99, LNCS vol. 1592, pages. 106–121.

    MathSciNet  Google Scholar 

  5. J. Camenisch, J. M. Piveteau, and M. Stadler. Blind signatures based on the discrete logarithm problem. In Advances in Cryptology-Eurocrypt'94, pages 428–432. LNCS vol. 950, Springer-Verlag, 1995.

    Google Scholar 

  6. M. Camenisch, U. Maurer, and M. Stadler. Digital payment systems with passive anonymity-revoking trustees. In ESORICS'96, pages 33–43. LNCS vol. 1146, Springer-Verlag, 1996.

    Google Scholar 

  7. D. Chaum, J. Evertse, and J. van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In Advances in Cryptology-EUROCRYPT'87, pages 127–141. LNCS vol. 304, Springer-Verlag,1988.

    Google Scholar 

  8. R. Cramer and T.P. Pedersen. Improved privacy in wallets with observers. In Advances of Cryptology-Eurocrypt'93, pages 329–343. LNCS vol. 765, Springer-Verlag, 1994.

    Google Scholar 

  9. G. Davida, Y. Frankel, Y. Tsiounis, and M. Yung. Anonymity control in e-cash. In Proceedings of 1st Financial Cryptography conference. LNCS vol. 1318, Springer-Verlag, 1997.

    Google Scholar 

  10. U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1:77–94, 1988.

    Google Scholar 

  11. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identi_cation and signature problems. In Advances in Cryptology-CRYPTO'86, pages 186–194. LNCS vol. 263, Springer-Verlag, 1987.

    Google Scholar 

  12. Y. Frankel, Y. Tsiounis, and M. Yung. Indirect discourse proofs: achieving fair on-line e-cash. In Advances in Cryptology-ASIACRYPT'96, pages 286–300. LNCS vol. 1163, Springer-Verlag, 1996.

    Google Scholar 

  13. E. Fujisaki and T. Okamoto. Statistical zero-knowledge protocols to prove modular polynomial relation. In Advances in Cryptology-CRYPTO'97, pages 16–30. LNCS vol. 1294, Springer-Verlag, 1997.

    Google Scholar 

  14. J. Piveteau J. Camenisch and M. Stadler. An efficient payment system protecting privacy. In Computer Security-ESORICS'94, pages 207–215. LNCS vol. 875, Springer-Verlag, 1994.

    Google Scholar 

  15. Khanh Quoc Nguyen, Yi Mu, and Vijay Varadharajan. A new digital cash scheme based on blind nyberg-rueppel digital signature. In Information Security Workshop, pages 312–320. LNCS vol. 1396, Springer-Verlag, 1997.

    Google Scholar 

  16. T. Okamoto. An efficient divisible electronic cash scheme. In Advances in Cryptology-CRYPTO'95, pages 439–451. LNCS vol. 963, Springer-Verlag, 1995.

    Google Scholar 

  17. M. Stadler. Cryptographic Protocols for Revocable Privacy. PhD thesis, Swiss Federal Institute of Technology, Zurich, 1996.

    Google Scholar 

  18. B. von Solms and D. Naccache. On blind signatures and perfect crimes. Computer and Security, 11(6):581–583, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Macquarie University, Sydney, Australia

    Yi Mu & Vijay Varadharajan

  2. Motorola Lab, Adelaide, Australia

    Khanh Quoc Nguyen

Authors
  1. Yi Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Khanh Quoc Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vijay Varadharajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The University of Hong Kong E-Business Technology Institute IBM, China/Hong Kong

    Weidong Kou

  2. Department of Computer Science and Electrical Engineering, The University of Maryland Baltimore County, Maryland

    Yelena Yesha

  3. T.J. Watson Research Centre, The University of Hong Kong E-Business Technology Institute and IBM, Hong Kong

    Chung Jen Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mu, Y., Nguyen, K.Q., Varadharajan, V. (2001). A Fair Electronic Cash Scheme. In: Kou, W., Yesha, Y., Tan, C.J. (eds) Electronic Commerce Technologies. ISEC 2001. Lecture Notes in Computer Science, vol 2040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45415-2_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45415-2_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41963-1

  • Online ISBN: 978-3-540-45415-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation