The Knowledge Complexity of Interactive Proof Systems.Proofs that Release Minimum Knowledge.Randomness, Interactive Proofs, and Zero-Knowledge--A Survey [Book Review]

, , , , , , , , &
Journal of Symbolic Logic 56 (3):1092 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275080

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof systems. SIAM journal on computing, vol. 18 , pp. 186–208. - Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that release minimum knowledge. Mathematical foundations of computer science 1986, Proceedings of the 12th symposium, Bratislava, Czechoslovakia, August 25–29, 1986, edited by J. Gruska, B. Rovan, and J. Wiedermann, Lecture notes in computer science, vol. 233, Springer-Verlag, Berlin, Heidelberg, New York, etc., 1986, pp. 639–650. - Oded Goldreich. Randomness, interactive proofs, and zero-knowledge—a survey. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988, pp. 377–405. [REVIEW]Lance Fortnow - 1991 - Journal of Symbolic Logic 56 (3):1092-1094.
Challenging epistemology: Interactive proofs and zero knowledge.Justin Bledin - 2008 - Journal of Applied Logic 6 (4):490-501.
Nimrod Megiddo and Avi Wigderson. On play by means of computing machines . Theoretical aspects of reasoning about knowledge, Proceedings of the 1986 conference, edited by Joseph Y. Halpern, Morgan Kaufmann Publishers, Los Altos1986, pp. 259–274. - Haim Gaifman. A theory of higher order probabilities. Theoretical aspects of reasoning about knowledge, Proceedings of the 1986 conference, edited by Joseph Y. Halpern, Morgan Kaufmann Publishers, Los Altos1986, pp. 275–292. - Silvio Micali. Knowledge and efficient computation. Theoretical aspects of reasoning about knowledge, Proceedings of the 1986 conference, edited by Joseph Y. Halpern, Morgan Kaufmann Publishers, Los Altos1986, pp. 353–362. [REVIEW]William J. Rapaport - 1988 - Journal of Symbolic Logic 53 (2):669-670.
Michael J. Beeson. Computerizing mathematics: logic and computation. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 191–225. [REVIEW]J. C. Shepherdson - 1991 - Journal of Symbolic Logic 56 (3):1090-1091.
Uwe Schöning. Complexity theory and interaction. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 561–580. [REVIEW]Steven Lindell - 1991 - Journal of Symbolic Logic 56 (3):1091-1092.
Review: Jeanne Ferrante, Charles W. Rackoff, The Computational Complexity of Logical Theories. [REVIEW]Dirk Siefkes - 1984 - Journal of Symbolic Logic 49 (2):670-671.
Interactive and probabilistic proof-checking.Luca Trevisan - 2000 - Annals of Pure and Applied Logic 104 (1-3):325-342.
Andrew Hodges. Alan Turing and the Turing machine. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 3–15. - Stephen C. Kleene. Turing's analysis of computahility, and major applications of it. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 17–54. - Robin Gandy. The confluence of ideas in 1936. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 55–111. - Solomon Feferman. Turing in the land of O. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 113–147. - Martin Davis. Mathematica. [REVIEW]John N. Crossley - 1991 - Journal of Symbolic Logic 56 (3):1089-1090.
Interactive proof-search for equational reasoning.Favio E. Miranda-Perea, Lourdes del Carmen González Huesca & P. Selene Linares-Arévalo - forthcoming - Logic Journal of the IGPL.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.

Analytics

Added to PP
2010-09-12

Downloads
58 (#283,787)

6 months
10 (#308,797)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references