Abstract
We describe a model in which a computationally bounded verifier consults with a computationally unbounded oracle, in the presence of malicious faults on the communication lines. We require a fairness condition which in essence says that some of the oracle’s messages arrive uncorrupted. We show that a deterministic polynomial time verifier can test membership in any language in P-space, but cannot test membership in languages not in P-space, even if he is allowed to toss random coins in private. We discuss the zero knowledge aspects of our model, and demonstrate zero knowledge tests of membership for any language in P-space.
Chapter PDF
Similar content being viewed by others
Keywords
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
M. Ben-or, S. Goldwasser, J. Killian, A. Wigderson, Multi Prover Interactive Proofs: How to Remove Intractability Proc. of 20th STOC 1988, pp. 113–131.
A. Condon, R. Ladner, Probabilistic Game Automata Proc. Structure in Complexity, 1986, pp. 144–162.
C. Dwork, L. Stockmeyer, Zero-Knowledge with Finite State Verifiers these proceedings.
U. Feige, A. Shamir, Multi Oracle Interactive Protocols with Space Bounded Verifiers in preperation.
M. Garey, D. Johnson, Computers and intractability, A guide to theory of NP-Completeness Freeman 1979.
O. Goldreich, S. Micali, A. Wigderson, Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design Proc. 27th FOCS, 1986, pp. 174–187.
S. Goldwasser, S. Micali, C. Rackoff, The Knowledge Complexity of Interactive Proofs Proc. of 17th STOC, 1985, pp. 291–304.
S. Goldwasser, M. Sipser, Arthur Merlin Games versus Interactive proof systems 18th STOC, 1986, pp. 59–68.
J. Y. Halpern, Y. Moses, Knowledge and common knowledge in a distributed environment Proceedings of the Fourth PODC, 1985, pp. 224–236.
J. Kilian, Zero-Knowledge with Log-Space Verifiers to be presented at FOCS 1988.
G. L. Peterson and J. H. Reif, Multiple-Person Alternation Proceedings of 20th FOCS, 1979, pp. 348–363.
J. H. Reif, The complexity of two-player games of incomplete information JCSS 29, 1984, pp 274–301.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feige, U., Shamir, A., Tennenholtz, M. (1990). The Noisy Oracle Problem. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_22
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_22
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive