Conditional E-Cash

  • Larry Shi
  • Bogdan Carbunar
  • Radu Sion
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4886)

Abstract

We introduce a novel conditional e-cash protocol allowing future anonymous cashing of bank-issued e-money only upon the satisfaction of an agreed-upon public condition. Payers are able to remunerate payees for services that depend on future, yet to be determined outcomes of events. Once payment complete, any double-spending attempt by the payer will reveal its identity; no double-spending by the payee is possible. Payers can not be linked to payees or to ongoing or past transactions. The flow of cash within the system is thus both correct and anonymous. We discuss several applications of conditional e-cash including online trading of financial securities, prediction markets, and betting systems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Intrade: A trade exchange network company, http://www.intrade.com/
  2. 2.
    Iowa electronic markets, http://www.biz.uiowa.edu/iem/
  3. 3.
    Iowa health prediction market, http://fluweb.biz.uiowa.edu/fluhome/index.html
  4. 4.
  5. 5.
  6. 6.
  7. 7.
    Arrow, K.J., Debreu, G.: The existence of an equilibrium for a competitive economy. Econometrica 22 (1954)Google Scholar
  8. 8.
    Balasko, Y.: Foundations of the Theory of General Equilibrium (1986)Google Scholar
  9. 9.
    Blake, I.F., Chan, A.C.F.: Scalable, server-passive, user-anonymous timed release cryptography. In: ICDCS 2005. Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, Washington, DC, USA, pp. 504–513. IEEE Computer Society, Los Alamitos (2005)Google Scholar
  10. 10.
    Camenisch, J., Maurer, U.M., Stadler, M.: Digital payment systems with passive anonymity-revoking trustees. In: Martella, G., Kurth, H., Montolivo, E., Bertino, E. (eds.) ESORICS 1996. LNCS, vol. 1146, pp. 33–43. Springer, Heidelberg (1996)Google Scholar
  11. 11.
    Cathalo, J., Libert, B., Quisquater, J.-J.: Efficient and non-interactive timed-release encryption. In: Qing, S., Mao, W., Lopez, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 291–303. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Chaum, D.: Blind signatures for untraceable payments. In: Advances in Cryptology— Proceedings of Crypto 1982, pp. 199–203. Plenum Press (1982)Google Scholar
  13. 13.
    Chaum, D.: Security without identification: transaction systems to make big brother obsolete. Communications of the ACM 28(10), 1030–1044 (1985)CrossRefGoogle Scholar
  14. 14.
    Chaum, D.: Privacy protected payments: Unconditional payer and/or payee untraceability. In: Proceedings of SmartCard 2000 (1988)Google Scholar
  15. 15.
    Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 319–327. Springer, Heidelberg (1990)Google Scholar
  16. 16.
    Davida, G.I., Frankel, Y., Tsiounis, Y., Yung, M.: Anonymity control in e-cash systems. In: FC 1997. LNCS, vol. 1318, pp. 1–16. Springer, Heidelberg (1997)Google Scholar
  17. 17.
    Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. In: Proceedings of the 13th USENIX Security Symposium (2004)Google Scholar
  18. 18.
    Dodis, Y., Yum, D.H.: Time capsule signature. In: Patrick, A.S., Yung, M. (eds.) FC 2005. LNCS, vol. 3570, pp. 57–71. Springer, Heidelberg (2005)Google Scholar
  19. 19.
    Frankel, Y., Tsiounis, Y., Yung, M.: ”indirect discourse proof”: Achieving efficient fair off-line e-cash. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 286–300. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  20. 20.
    Franklin, M.K., Yung, M.: Secure and efficient off-line digital money (extended abstract). In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol. 700, pp. 265–276. Springer, Heidelberg (1993)Google Scholar
  21. 21.
    Kiviat, B.: The end of management? Time - Inside Business, http://www.time.com/time/insidebiz/printout/0,8816,1101040712-660965,00.html
  22. 22.
    Stadler, M., Piveteau, J.-M, Camenisch, J.: Fair blind signatures. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 209–219. Springer, Heidelberg (1995)Google Scholar
  23. 23.
    Samuelson, P.A.: Foundations of Economic Analysis. Harvard University Press (1947)Google Scholar
  24. 24.
  25. 25.
    Schneier, B.: Applied Cryptography: Protocols, Algorithms and Source Code in C. Wiley & Sons, Chichester (1996)MATHGoogle Scholar
  26. 26.
    Simon, D.R.: Anonymous communication and anonymous cash. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 61–73. Springer, Heidelberg (1996)Google Scholar
  27. 27.
    Waldman, M., Rubin, A.D., Cranor, L.F.: Publius: A robust, tamper-evident, censorship-resistant, web publishing system. In: Proc. 9th USENIX Security Symposium, pp. 59–72 (August 2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Larry Shi
    • 2
  • Bogdan Carbunar
    • 2
  • Radu Sion
    • 1
  1. 1.Network Security and Applied Cryptography Lab Computer ScienceStony Brook University 
  2. 2.Pervasive Platforms and ArchitecturesMotorola Labs 

Personalised recommendations