Advertisement

A non-interactive electronic cash system

Extended abstract
  • Giovanni Di Crescenzo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 778)

Abstract

We give the first electronic cash system whose transactions require no interaction between the parties. Its security is based on the computational intractability of factoring Blum integers.

We also give a non-interactive perfect zero-knowledge proof system of membership to the language of Blum integers. We use this proof system in our electronic cash system as a tool for proving the correctness of some computations modulo Blum integers without revealing the factorization of such integers.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Bar Ilan and D. Beaver, Non-Cryptographic Fault-Tolerant Computation in a Constant Number of Rounds of Interaction, in Proc. of the 8th PODC (1989) pp. 201–209.Google Scholar
  2. 2.
    D. Beaver, S. Micali, and P. Rogaway, The Round Complexity of Secure Protocols, Proceedings of the 22nd Annual Symposium on the Theory of Computing, 1990, pp. 503–513.Google Scholar
  3. 3.
    M. Bellare and M. Yung, Certifying Cryptographic Tools: The case of Trapdoor Permutations, in Proceedings of CRYPTO-92.Google Scholar
  4. 4.
    M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero Knowledge, in “Advances in Cryptology — CRYPTO 88”, Ed. S. Goldwasser, vol. 403 of “Lecture Notes in Computer Science”, Springer-Verlag, pp. 37–56.Google Scholar
  5. 5.
    J. Boyar, K. Friedl, and C. Lund, Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies, Journal of Cryptology, n. 4, pp. 185–206, 1991.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 103–112.Google Scholar
  8. 8.
    R. Boppana, J. Hastad, and S. Zachos, Does co-N P has Short Interactive Proofs?, Information Processing Letters, vol. 25, May 1987, pp. 127–132.Google Scholar
  9. 9.
    D. Chaum, Security without Identification: Transaction System to Make Big Brother Obsolete, in Communication of the ACM, 28, 101985, pp. 1030–1044.Google Scholar
  10. 10.
    D. Chaum, A. Fiat, and M. Naor, Untraceable Electronic Cash, in “Advances in Cryptology — CRYPTO 88”, Ed. S. Goldwasser, vol. 403 of “Lecture Notes in Computer Science”, Springer-Verlag, pp. 319–327.Google Scholar
  11. 11.
    I. B. Damgard, Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals, in “Advances in Cryptology — CRYPTO 88”, Ed. S. Goldwasser, vol. 403 of “Lecture Notes in Computer Science”, Springer-Verlag, pp. 328–335.Google Scholar
  12. 12.
    A. De Santis, G. Di Crescenzo, and G. Persiano, The Knowledge Complexity of Quadratic Residuosity Languages, to appear in Theoretical Computer Science.Google Scholar
  13. 13.
    A. De Santis, G. Di Crescenzo, and G. Persiano, Secret Sharing and Perfect Zero-Knowledge, to appear in Proceedings of CRYPTO 93.Google Scholar
  14. 14.
    A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof-Systems, in “Advances in Cryptology — CRYPTO 87”, vol. 293 of “Lecture Notes in Computer Science”, Springer Verlag.Google Scholar
  15. 15.
    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
  16. 16.
    U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, in Proceedings of 22nd Annual Symposium on the Theory of Computing, 1990, pp. 308–317.Google Scholar
  17. 17.
    N. Ferguson, Single Term Off-Line Coins, to appear in Proceedings of Eurocrypt 93.Google Scholar
  18. 18.
    L. Fortnow, The Complexity of Perfect Zero-Knowledge, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 204–209.Google Scholar
  19. 19.
    M. Franklin and M. Yung, Secure and Efficient Off-Line Digital Money, in Proceedings of ICALP 93.Google Scholar
  20. 20.
    O. Goldreich and E. Kushilevitz, A Perfect Zero Knowledge Proof for a Decision Problem Equivalent to Discrete Logarithm, in “Advances in Cryptology — CRYPTO 88”, Ed. S. Goldwasser, vol. 403 of “Lecture Notes in Computer Science”, Springer-Verlag.Google Scholar
  21. 21.
    O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Design, Proceedings of 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 174–187.Google Scholar
  22. 22.
    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
  23. 23.
    R. Impagliazzo and M. Yung, Direct Minimum Knowledge Computations “Advances in Cryptology — CRYPTO 87”, vol. 293 of “Lecture Notes in Computer Science”, Springer Verlag pp. 40–51.Google Scholar
  24. 24.
    I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers, John Wiley and Sons, 1960, New York.Google Scholar
  25. 25.
    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
  26. 26.
    M. Tompa and H. Woll, Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information, Proc. 28th Symposium on Foundations of Computer Science, 1987, pp. 472–482.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Giovanni Di Crescenzo
    • 1
  1. 1.Dipartimento di Informatica ed ApplicazioniUniversità di SalernoBaronissiItaly

Personalised recommendations