Advertisement

Short Discreet Proofs

  • Joan Boyar
  • René Peralta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1070)

Abstract

We show how to produce short proofs of theorems such that a distrusting Verifier can be convinced that the theorem is true yet obtains no information about the proof itself. The proofs are non-interactive pro- vided that the quadratic residuosity bit commitment scheme is available to the Prover and Verifier. For typical applications, the proofs are short enough to fit on a floppy disk.

Keywords

Boolean Function Truth Table Security Parameter Random String Commitment Scheme 
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.
    Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In Proceedings of the 20th ACM Symposium on Theory of Computing (1988) pp. 103–112.Google Scholar
  2. 2.
    Blum, De Santis, Micali, Persiano: Non-interactive zero-knowledge. SIAM Journal on Computing 20 (1991) 1084–1118.CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Boyar, J., Brassard, G., Peralta, R.: Subquadratic zero-knowledge. In Proceedings of the 32th IEEE Symposium on Foundations of Computer Science (1991) pp. 69–78 (to appear in JACM).Google Scholar
  4. 4.
    Boyar, J., Krentel, M., Kurtz, S.: A discrete logarithm implementation of zero-knowledge blobs. Journal of Cryptology 2 (1990) 63–76.CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Boyar, J., Lund, C., Peralta, R.: On the communication complexity of zero-knowledge proofs. Journal of Cryptology 6 (1993) 65–85.CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Brassard, G., Chaum, D., Crépeau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences 37 (1988) 156–189.CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Brassard, G., Crépeau, C.: Zero-knowledge simulation of boolean circuits. In Advances in Cryptology-Proceedings of CRYPTO 86 (1987) vol. 263 of Lecture Notes in Computer Science, Springer-Verlag pp. 223–233.Google Scholar
  8. 8.
    Damgård, I.: Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing. In Advances in Cryptology-Proceedings of EURO-CRYPT 92 (1993) vol. 658 of Lecture Notes in Computer Science, Springer-Verlag pp. 341–355.Google Scholar
  9. 9.
    Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero-knowledge proofs based on a single random string. In Proceedings of the 31th IEEE Symposium on Foundations of Computer Science (1990) pp. 308–317.Google Scholar
  10. 10.
    Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology-Proceedings of CRYPTO 86 (1987) vol. 263 of Lecture Notes in Computer Science, Springer-Verlag pp. 186–194.CrossRefGoogle Scholar
  11. 11.
    Kilian, J., Petrank, E.: An efficient non-interactive zero-knowledge proof ystem for NP with general assumptions. Technical Report No. TR95-038, Electronic Colloquium in Computational Complexity (ECCC), July 1995.Google Scholar
  12. 12.
    Lenstra, A. K.: Factoring integers using the web and number field sieve. In Proceedings of JAIST International Forum on Multimedia and Information Security (1995) Japan Advanced Institute of Science and Technology pp. 93–113.Google Scholar
  13. 13.
    De Santis, A., Di Crescenzo, G., Persiano, G.: Secret sharing and perfect zero knowledge. In Advances in Cryptology-Proceedings of CRYPTO 93 (1993) vol. 773 of Lecture Notes in Computer Science, Springer-Verlag pp. 73–84.CrossRefGoogle Scholar
  14. 14.
    Odlyzko, A.: The future of integer factorization. In Proceedings of JAIST International Forum on Multimedia and Information Security (1995) Japan Advanced Institute of Science and Technology pp. 139–151.Google Scholar
  15. 15.
    Schnorr, C.: Efficient signature generation for smart cards. Journal of Cryptology 4 (1991) 161–174.CrossRefzbMATHGoogle Scholar
  16. 16.
    van de Graaf, J., Peralta, R.: A simple and secure way to show the validity of your public key. In Advances in Cryptology-Proceedings of CRYPTO 87 (1988) vol. 293 of Lecture Notes in Computer Science, Springer-Verlag pp. 128–134.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Joan Boyar
    • 1
  • René Peralta
    • 2
  1. 1.Department of Mathematics and Computer ScienceOdense UniversityOdense MDenmark
  2. 2.School of Information ScienceJapan Advanced Institute of Science and TechnologyIshikawaJapan

Personalised recommendations