Skip to main content
SpringerLink
Log in

Proofs that Release Minimum Knowledge

  • Late Arrivals
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 233))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publ. Co., 1974.

    Google Scholar 

  2. Chor, B., S. Goldwasser, S. Micali, and B. Awerbuch, ”Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults”, Proc. 26th FOCS, 1985, pp. 383–395.

    Google Scholar 

  3. Babai, L., ”Trading Group Theory for Randomness”, Proc. 17th STOC, 1985, pp. 421–429.

    Google Scholar 

  4. Ben-Or, M., private communication, 1986.

    Google Scholar 

  5. Blum, M., ”Coin Flipping by Phone”, IEEÉ Spring COMPCOM, pp. 133–137, February 1982.

    Google Scholar 

  6. Boppana, R., and J. Hastad, in preparation, 1986.

    Google Scholar 

  7. Cook, S.A., ”The Complexity of Theorem Proving Procedures”, 3rd STOC, pp. 151–158, 1971.

    Google Scholar 

  8. Galil, Z., S. Haber, and M. Yung, ”A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems”, Proc. 26th FOCS, 1985, pp. 360–371.

    Google Scholar 

  9. Garey, M.R., and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.

    Google Scholar 

  10. Goldreich, O., ”A Zero-Knowledge Proof that a Two-Prime Moduli Is Not a Blum Integer”, unpublished manuscript, 1985.

    Google Scholar 

  11. Goldwasser, S., and S. Micali, ”Probabilistic Encryption”, JCSS, Vol. 28, No. 2, 1984, pp. 270–299.

    Google Scholar 

  12. Goldwasser, S., S. Micali, and C. Rackoff, ”Knowledge Complexity of Interactive Proofs”, Proc. 17th STOC, 1985, pp. 291–304.

    Google Scholar 

  13. Goldwasser, S., and M. Sipser, ”Arthur Merlin Games versus Interactive Proof Systems”, to appear in the 18th STOC, 1986.

    Google Scholar 

  14. Karp, R.M., ”Reducibility among Combinatorial Problems”, Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (eds.), Plenum Press, pp. 85–103, 1972.

    Google Scholar 

  15. Levin, L.A., ”Universal Search Problems”, Problemy Peredaci Informacii 9, pp. 115–116, 1973. Translated in problems of Information Transmission 9, pp. 265–266.

    Google Scholar 

  16. Shamir, A., ”How to Share a Secret”, CACM, Vol. 22, 1979, pp. 612–613.

    Google Scholar 

  17. Yao, A.C., ”Theory and Applications of Trapdoor Functions”, Proc. of the 23rd IEEE Symp. on Foundation of Computer Science, 1982, pp. 80–91.

    Google Scholar 

Download references

Author information

Author notes

  1. Oded Goldreich

    Present address: the Laboratory for Computer Science, MIT, USA

Authors and Affiliations

  1. Computer Science Dept., Technion, Haifa, Israel

    Oded Goldreich

  2. Laboratory for Computer Science, MIT, 02139, Cambridge, MA, USA

    Silvio Micali

  3. Mathematical Sciences Research Institute, 94720, Berkeley, CA

    Avi Wigderson

  4. Institute of Mathematics and Computer Science, Hebrew University, Israel

    Avi Wigderson

Authors
  1. Oded Goldreich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Silvio Micali
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Avi Wigderson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goldreich, O., Micali, S., Wigderson, A. (1986). Proofs that Release Minimum Knowledge. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016291

Download citation

  • DOI: https://doi.org/10.1007/BFb0016291

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation