Skip to main content

Risk Management for E-Cash Systems with Partial Real-Time Audit

  • Conference paper
  • First Online:
Financial Cryptography (FC 1999)

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

Included in the following conference series:

Abstract

We analyze “coin-wallet” and “balance-wallet” under partial real-time audit, and compute upper bounds on theft due to the fact that not all the transactions are audited in real time, assuming that every- thing else is perfect. In particular, we assume that the audit regime holds for innocent players. Let v be the maximum allowed balance in a wallet, 0 ≤ μ ≤ 1 be the fraction of transactions that are audited in real time in an audit round that includes overall n transactions. Assume one unit transactions. We show that for μ << 1 the upper bound on expected theft for coin-wallet is \( \frac{\upsilon } {{e^{\mu ^2 \upsilon } - 1}} \) (which if v << μ−2 becomes \( (e^{\mu ^2 } - 1)^{ - 1} \)), while for plausible parameter choice the bound for a balance-wallet is O(exp(v 2/n)). This last bound can become huge in some cases, implying that partial audit, while suitable for coin-wallets with low denomination coins, may be too risky for balance-wallet. Some implications to the design of anonymous and non-anonymous systems are discussed.

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. N. Alon, J.H. Spencer, and P. Erdos The Probabilistic Method, Wiley Interscience, ISBN 0-471-53588-5

    Google Scholar 

  2. D. Chaum Achieving Electronic Privacy Scientific American, August 1992, pp. 96–101.

    Google Scholar 

  3. Chaum Fiat and Naor Untraceable Electronic Cash, Proc. Crypto 1988.

    Google Scholar 

  4. S. Even, O. Goldreich, Y. Yacobi: Electronic Wallet, Crypto’83 (See also the Zurich’94 Seminar).

    Google Scholar 

  5. M Franklin and M. Yung Secure and efficient off-line digital money, Proc. 20th ICALP 1993

    Google Scholar 

  6. E. Gabber and A. Silberschatz: Agora: A Minimal Distributed Protocol for Electronic Commerce, USENIX Workshop on E-Commerce, Oakland CA, Nov. 1996.

    Google Scholar 

  7. S. Jarecki and A.M. Odlyzko:An efficient micropayment system based on probabilistic polling, Proc. Financial Cryptography-97.

    Google Scholar 

  8. R.C. Merkle: Protocols for Public Key Cryptosystems, Proc. of 1980 Symp. on Security and Privacy, IEEE Computer Society, pp. 122–133 (April 1980).

    Google Scholar 

  9. T. Okamoto:`An Efficient Divisible Electronic Cash Scheme, Proc. Crypto’95, Springer Verlag LNCS 963, pp. 438–451.

    Google Scholar 

  10. T. Okamoto and K. Ohta: Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash, Proc. Crypto’89, Springer-Verlag LNCS 435, pp. 481–496

    Google Scholar 

  11. T. Okamoto and K. Ohta: Universal Electronic Cash, Proc. Crypto’90, Springer-Verlag LNCS 576, pp. 324–337

    Google Scholar 

  12. R.L. Rivest: Electronic Lottery Tickets as Micropayments Financial Cryptography 97, Springer Verlag LNCS 1318, pp. 306–314, Rafael Hirschfeld (Ed.)

    Google Scholar 

  13. D.R. Simon: Anonymous Communication and Anonymous Cash, Proc. Crypto’96, Springer Verlag LNCS 1109, pp 61–73.

    Google Scholar 

  14. D. Wheeler: Transactions Using Bets, Proc. ARE, 1997, LNCS 1189, pp. 89–92

    Google Scholar 

  15. Y. Yacobi: Efficient E-money, in Proc. Asiacrypt’94, Springer Verlag LNCS 917, pp. 153–163.

    Google Scholar 

  16. Y. Yacobi: On the Continuum Between On-line and Off-line E-cash Systems-I, Proc. Financial Cryptography-97.

    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

Yacobi, Y. (1999). Risk Management for E-Cash Systems with Partial Real-Time Audit. In: Franklin, M. (eds) Financial Cryptography. FC 1999. Lecture Notes in Computer Science, vol 1648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48390-X_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-48390-X_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48390-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics