Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Detachable Electronic Coins

  • Conference paper
Information and Communication Security (ICICS 1999)

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

Included in the following conference series:

Abstract

We propose a non-divisible electronic cash system that combines the restrictive blind signature technique and a batch signature scheme based upon the binary tree structure. Contemporary electronic cash solutions rely on the divisibility paradigm to achieve significant computational savings, and such techniques are considered to be the most efficient. We demonstrate an alternative approach that employs batch cryptography to withdraw and spend multiple coins. This approach provides a set of alternative primitives for an electronic cash system that possesses comparable efficiency to the most efficient divisible based schemes.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Boyd, C., Foo, E., Pavlovski, C.: Efficient Electronic Cash Using Batch Signatures. In: Pieprzyk, J.P., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol. 1587, pp. 244–257. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Bellare, M., Garay, J.A., Rabin, T.: Fast Batch Verification for Modular Exponentiation and Digital Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 236–250. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Brands, S.: Untraceable Off-line Cash in Wallet with Observers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 302–318. Springer, Heidelberg (1994)

    Google Scholar 

  4. Chaum, D., Evertse, E., Graaf, J.: An improved protocol for demonstrating possession of discrete logarithms and some generalisations. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 127–141. Springer, Heidelberg (1988)

    Google Scholar 

  5. Chan, A., Frankel, Y., Tsiounis, Y.: Easy Come - Easy Go Divisible Cash. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 561–574. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Coron, J.S., Naccache, D.: On The Security oif RSA Screening. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, p. 197. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Chaum, D., Pedersen, T.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)

    Google Scholar 

  8. Ferguson, N.: Single Term Off-Line Coins. In: Advances in Cryptology - Crypto 1993, pp. 318–328. Springer, Heidelberg (1994)

    Google Scholar 

  9. Fiat, A.: Batch RSA. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 175–185. Springer, Heidelberg (1990)

    Google Scholar 

  10. Koblitz, N.: A course in number theory and cryptography. In: Graduate Texts in Mathematics, vol. 114. Springer, Heidelberg (1987)

    Google Scholar 

  11. Merkle, R.C.: A Certified Digital Signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218–238. Springer, Heidelberg (1990)

    Google Scholar 

  12. Naccache, D., M’Raihi, D., Rapheali, D., Vaudenay, S.: Can DSA be improved: complexity trade-offs with the digital signature standard. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 85–94. Springer, Heidelberg (1995)

    Google Scholar 

  13. Nguyen, K.Q., Mu, Y., Varadharajan, V.: One-Response Off-line Digital Coins. In: Proceedings of SAC 1997 (1997)

    Google Scholar 

  14. Okamoto, T.: An Efficient Divisible Electronic Cash Scheme. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 438–451. Springer, Heidelberg (1995)

    Google Scholar 

  15. Okamoto, T., Ohta, K.: Divertible Zero-Knowledge Interactive Proofs and Commutative Random Self-Reducibility. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 481–946. Springer, Heidelberg (1990)

    Google Scholar 

  16. Okamoto, T., Ohta, K.: Universal Electronic Cash. In: EUROCRYPT 1991. LNCS, pp. 324–337. springer, Heidelberg (1992)

    Google Scholar 

  17. Pavlovski, C., Boyd, C.: Efficient Batch Signature Generation Using Tree Structures. In: CrypTEC 1999, Hong Kong (1999)

    Google Scholar 

  18. Schnorr, C.: Efficient Signature Generation for Smart Cards. In: CRYPTO 1989. LNCS, pp. 239–252. Springer, Heidelberg (1990)

    Google Scholar 

  19. Tsiounis, Y.: Efficient Electronic Cash: New Notions and Techniques, Ph.D. Thesis, College ofComputer Science, Northern University, Boston MA (June 1997)

    Google Scholar 

  20. Yacobi, Y., Beller, M.: Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 208–217. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  21. Yen, S., Laih, C.: Improved Digital Signature Suitable for Batch Verification. IEEE Transactions on Computers 44(7) (July 1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pavlovski, C., Boyd, C., Foo, E. (1999). Detachable Electronic Coins. In: Varadharajan, V., Mu, Y. (eds) Information and Communication Security. ICICS 1999. Lecture Notes in Computer Science, vol 1726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-47942-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-47942-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66682-0

  • Online ISBN: 978-3-540-47942-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics