Skip to main content

On Fair E-cash Systems Based on Group Signature Schemes

  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 2003)

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

Included in the following conference series:

Abstract

A fair electronic cash system is a system that allows customers to make payments anonymously. Moreover, under certain circumstances, a trusted authority can revoke the anonymity of suspicious transactions. Various fair e-cash systems using group signature schemes have been proposed [4,15,16,18]. Unfortunately, they do not realize coin tracing [4,15,18] (the possibility to trace the coins withdrawn by a customer). In this paper, we describe several failures in the solution of [16] and we present a secure and efficient fair e-cash system based on a group signature scheme. Our system ensures traceability of double-spenders, supports coin tracing and provides coins that are unforgeable and anonymous under standard assumptions.

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

Access this chapter

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. G. Ateniese, J. Camenisch, M. Joye, G. Tsudik. A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. Crypto’2000, volume 1880 of LNCS, pages 255–270. Springer-Verlag, 2000.

    Google Scholar 

  2. D. Boneh. The Decision Diffie-Hellman Problem. 3rd Algorithmic Number Theory Symposium, volume 1423 of LNCS, pages 48–63. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  3. E. Brickell, P. Gemmel, D. Kravitz. Trustee-Based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change. 6th ACM-SIAM, pages 457–466. ACM Press, 1995.

    Google Scholar 

  4. J. Camenisch, A. Lysyanskaya. An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. Eurocrypt 2001, volume 2045 of LNCS, pages 93–118. Springer-Verlag, 2001.

    Chapter  Google Scholar 

  5. J. Camenisch, U.M. Maurer, M. Stadler. Digital Payment Systems with Passive Anonymity-Revoking Trustees. Esorics’96, pages 33–43. Springer-Verlag, 1996.

    Google Scholar 

  6. D. Chaum, E. van Heyst. Group Signatures. Eurocrypt’91, volume 547 of LNCS, pages 257–265. Springer-Verlag, 1991.

    Google Scholar 

  7. I. Damgård, E. Fujisaki. A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. Asiacrypt 2002, volume 2501 of LNCS, pages 143–159. Springer-Verlag, 2002.

    Chapter  Google Scholar 

  8. G. Davida, Y. Frankel, Y. Tsiounis, M. Yung. Anonymity Control in E-Cash Systems. Financial Crypto’97, volume 1318 of LNCS, pages 1–16. Springer-Verlag, 1997.

    Google Scholar 

  9. T. El Gamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans. Inform. Theory, 31, pages 469–472. 1985.

    Article  MathSciNet  MATH  Google Scholar 

  10. A. Fiat, A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. Crypto’86, volume 263 of LNCS, pages 186–194. Springer-Verlag, 1987.

    Google Scholar 

  11. Y. Frankel, Y. Tsiounis, M. Yung. Indirect Discourse Proofs: Achieving Efficient Fair Off-Line E-Cash. Asiacrypt’96, volume 1163 of LNCS, pages 286–300. Springer-Verlag, 1996.

    Google Scholar 

  12. Y. Frankel, Y. Tsiounis, M. Young. Fair Off-Line e-cash Made Easy, Asiacrypt’98, volume 1514 of LNCS, pages 257–270. Springer-Verlag, 1998.

    Google Scholar 

  13. E. Fujisaki, T. Okamoto. Statistical Zero-Knowledge Protocols Solution to Identification and Signature Problems. Crypto’97, volume 1294 of LNCS, pages 16–30. Springer-Verlag, 1997.

    Google Scholar 

  14. M. Gaud, J. Traoré. On the Anonymity of Fair Off-Line e-Cash Systems, Financial Crypto’03 (to appear).

    Google Scholar 

  15. G. Maitland, C. Boyd. Fair Electronic Cash Based on a Group Signature Scheme. ICICS 2001, volume 2229 of LNCS, pages 461–465. Springer-Verlag, 2001.

    Google Scholar 

  16. W. Qiu, K. Chen, D. Gu. A New Off-line Privacy Protecting E-Cash System with Revokable Anonymity. ISC 2002. 2002.

    Google Scholar 

  17. M. Stadler, J.M. Piveteau, J. Camenisch. Fair Blind Signatures, Eurocrypt’95, volume 921 of LNCS. pages 209–219. Springer-Verlag, 1995.

    Google Scholar 

  18. J. Traoré. Group Signatures and Their Relevance to Privacy-Protecting Off-Line Electronic Cash Systems. ACISP’99, volume 1587 of LNCS, pages 228–243. Springer-Verlag, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Canard, S., Traoré, J. (2003). On Fair E-cash Systems Based on Group Signature Schemes. In: Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 2003. Lecture Notes in Computer Science, vol 2727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45067-X_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-45067-X_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40515-3

  • Online ISBN: 978-3-540-45067-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics