Advertisement

Efficient electronic money

Extended abstract
  • Yacov Yacobi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 917)

Abstract

Current e-cash systems with off-line bank are too complex to be practical for inexpensive e-wallets. In this paper we propose a new paradigm for e-cash, that relaxes the demands from e-cash systems, and thus enables simpler schemes. One first example along these lines is presented, which is significantly simpler in terms of computation complexity than the best previously published e-cash scheme (one or three orders of magnitude, depending on situation).

Keywords

Signature Scheme Random Element Certification Authority Initial Certificate Payment Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Brand Electronic Cash Systems Based On The Representation Problem In Groups Of Prime Order, Proceedings of Crypto'93, Santa Barbara 1993, pp. 26.1–26.15.Google Scholar
  2. 2.
    E.F. Brickell, D. Chaum, I.B. Damgard, and J. van de Graaf Gradual and Verifiable Release of a Secret, Proc. Crypto'87.Google Scholar
  3. 3.
    D. Chaum Achieving Electronic Privacy Scientific American, August 1992, pp. 96–101.Google Scholar
  4. 4.
    D. Chaum, A. Fiat, M. Naor Untraceable Electronic Cash, Proc. Crypto 1988.Google Scholar
  5. 5.
    W. Diffie, M. Hellman New Directions in Cryptography IEEE Trans. IT. 1976Google Scholar
  6. 6.
    T. ElGamal A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans. IT, Vol. IT-31, No. 4, July 1985, pp. 469–472.Google Scholar
  7. 7.
    S. Even, O. Goldreich, Y. Yacobi, Electronic Wallet, Proc. Crypto'83. A later version appeared in Proc. 1984 International Zurich Seminar on Digital Communications, pp. 199–201, IEEE cat No. 84CH1998-4.Google Scholar
  8. 8.
    T. Eng, T. Okamoto, Single-Term Divisible Electronic Coins, Proc. Eurocrypt'94, pp. 311–323.Google Scholar
  9. 9.
    M. Franklin, M. Yung, Secure and Efficient Off-Line Digital Money, Proc. ICALP 93, pp. 449–460 (1993)Google Scholar
  10. 10.
    Goldreich, Micali, and Wigderson Proofs that yield nothing, but their validity, or All languages in NP have zero-knowledge proof systems. J. of the ACM, 38: 691–729, 1991.Google Scholar
  11. 11.
    Goldwasser, Micali, and Rackoff, The knowledge complexity of Interactive proof systems, SIAM J. on Computing, 181, 1989, pp. 186–208.Google Scholar
  12. 12.
    T. Okamoto, K. Ohta, Disposable Zero-Knowledge Authentication and Their Application to Untraceable Electronic Cash, Proc. Crypto'89, pp. 481–496 (Springer-Verlag, LNCS 435, G. Brassard Ed.)Google Scholar
  13. 13.
    M.O. Rabin, Digitalized signatures, in Foundations of secure computation, Academic Press, NY, 1978.Google Scholar
  14. 14.
    R. Rivest, A. Shamir, and L. Adelman A method for obtaining digital signatures and public key cryptosystems, CACM, vol. 21, 1978, pp. 120–126.Google Scholar
  15. 15.
    Y. Yacobi, Efficient Non-Traceable Digital Checks, Witnessed and signed Bellcore Lab-Notebook, pp. 49–53, June 17, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Yacov Yacobi
    • 1
  1. 1.Bellcore (2Q-338)MorristownUSA

Personalised recommendations