Advertisement

Methodology for digital money based on general cryptographic tools

  • Stefano D'Amiano
  • Giovanni Di Crescenzo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 950)

Abstract

In this paper we investigate methodologies for off-line digital cash using general cryptographic tools. First we give a way for off-line spending of coins using non-interactive zero-knowledge proofs of knowledge with preprocessing. Under this paradigm and using other general cryptographic tools, we show how to obtain the property of dividability of coins and give a technique for avoiding double spending of coins.

Chaum and Pedersen considered a model in which the Bank discovers the author of a double spending of a coin immediately after that coin has been deposited, and proved that in this model transferred coins grow in size. We consider a different model and show how to obtain transferability of coins without any increase in size.

Keywords

Signature Scheme Blind Signature Random String Blind Signature Scheme Digital Equivalent 
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.

References

  1. 1.
    M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge, SIAM Journal of Computing, vol. 20, no. 6, Dec 1991, pp. 1084–1118.CrossRefGoogle Scholar
  2. 2.
    M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, Proceedings of the 20th ACM Symposium on Theory of Computing, 1988, pp. 103–112.Google Scholar
  3. 3.
    S. Brands, Untraceable Off-line Cash in Wallets with Observers, in “Advances in Cryptology — CRYPTO 93”, vol. 773 of “Lecture Notes in Computer Science”, Springer-Verlag, pp. 302–318.Google Scholar
  4. 4.
    D. Chaum, A. Fiat, and M. Naor, Untraceable Electronic Cash, in “Advances in Cryptology — CRYPTO 88”, vol. 403 of “Lecture Notes in Computer Science”, Springer-Verlag, pp. 319–327.Google Scholar
  5. 5.
    D. Chaum and T. Pedersen, Transferred Cash Grows in Size, in “Advances in Cryptology — Eurocrypt 92”, vol. 658 of “Lecture Notes in Computer Science”, Springer-Verlag, pp. 390–407.Google Scholar
  6. 6.
    A. De Santis and G. Persiano, Communication Efficient Zero-Knowledge Proof of knowledge (with Application to Electronic Cash), in Proceedings of STACS 92, pp. 449–460.Google Scholar
  7. 7.
    A. De Santis and G. Persiano, Zero-Knowledge Proofs of Knowledge Without Interaction, Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, 1992, pp. 427–436.Google Scholar
  8. 8.
    G. Di Crescenzo, A Non-Interactive Electronic Cash System, in Proceedings of Italian Conference on Algorithms and Complexity (CIAC 94), Springer Verlag.Google Scholar
  9. 9.
    G. Di Crescenzo, Anonymous NIZK Proofs of Knowledge with Preprocessing, manuscript.Google Scholar
  10. 10.
    W. Diffie and M. E. Hellman, New Directions in Cryptography, IEEE Transaction on Information Theory, vol. IT-22, no. 6, Nov. 1976. pp.644–654.CrossRefMathSciNetGoogle Scholar
  11. 11.
    U. Feige, A. Fiat, and A. Shamir, Zero-knowledge Proofs of Identity, Journal of Cryptology, vol. 1, 1988, pp. 77–94.CrossRefMathSciNetGoogle Scholar
  12. 12.
    N. Ferguson, Single Term Off-Line Coins, in “Advances in Cryptology — Eurocrypt 93”, vol. 765 of “Lecture Notes in Computer Science”, Springer-Verlag, pp. 318–328.Google Scholar
  13. 13.
    M. Franklin and M. Yung, Secure and Efficient Off-Line Digital Money, in Proceedings of ICALP 93, vol. 700 of “Lecture Notes in Computer Science”, Springer-Verlag, pp. 265–276.Google Scholar
  14. 14.
    O. Goldreich, S. Goldwasser, and S. Micali, How to Construct Random Functions, Journal of the Association for Computing Machinery, vol. 33, no. 4, 1986, pp. 792–807.MathSciNetGoogle Scholar
  15. 15.
    S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.Google Scholar
  16. 16.
    S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attack, SIAM Journal of Computing, vol. 17, n. 2, April 1988, pp. 281–308.CrossRefMathSciNetGoogle Scholar
  17. 17.
    S. Goldwasser and R. Ostrovsky, Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent, in “Advances in Cryptology — CRYPTO 92”, vol. 470 of “Lecture Notes in Computer Science”, Springer-Verlag, pp. 246–259.Google Scholar
  18. 18.
    M. Naor, Bit Commitment using Pseudo-randomness, in “Advances in Cryptology — CRYPTO 89”, vol. 435 of “Lecture Notes in Computer Science”, Springer-Verlag.Google Scholar
  19. 19.
    M. Naor and M. Yung, Universal One-way Hash Functions and their Cryptographic Applications, Proceedings of 21st ACM Symposium on the Theory of Computing, 1989.Google Scholar
  20. 20.
    T. Okamoto and K. Ohta, Universal Electronic Cash, in “Advances in Cryptology — CRYPTO 91”, vol. 576 of “Lecture Notes in Computer Science”, Springer-Verlag, pp. 324–337.Google Scholar
  21. 21.
    T. Okamoto and K. Ohta, Disposable Zero-knowledge Authentications and their Applications to Untraceable Electronic Cash, in “Advances in Cryptology — CRYPTO 89”, vol. 435 of “Lecture Notes in Computer Science”, Springer-Verlag, pp. 481–496.Google Scholar
  22. 22.
    J. Rompel, One-way Functions are Necessary and Sufficient for Secure Signatures, Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990, pp. 387–394.Google Scholar
  23. 23.
    M. Tompa and H. Woll, Random Self-Reducibility and Zero-knowledge Interactive Proofs of Possession of Information, Proceedings of 28th Symposium on Foundations of Computer Science, 1987, pp. 472–482.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Stefano D'Amiano
    • 1
  • Giovanni Di Crescenzo
    • 2
  1. 1.Computer Science DepartmentCornell UniversityIthacaUSA
  2. 2.Dipartimento di Informatica ed ApplicazioniUniversità di SalernoBaronissiItaly

Personalised recommendations