Abstract
Recent results in interactive proof systems [12][13][1] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it is for a prover in a multiple prover interactive proof system. We show that this is not the case for a single prover in which all but a fixed polynomial of the prover’s space is erased between each round. One consequence of this is that any multiple prover interactive protocol in which the provers need only a polynomial amount of space can be easily transformed into a single prover interactive protocol where the prover has only a fixed polynomial amount of space. This result also shows that one can easily transform checkers [5] into adaptive checkers [7] under the assumption that the program being checked has space bounded by a fixed polynomial.
Supported by an NSF fellowship while at MIT.
Supported by DIMACS, NSF-STC88-09648.
Chapter PDF
Similar content being viewed by others
Keywords
- Interactive Protocol
- Interactive Proof
- Coin Toss
- Deterministic Finite State Automaton
- Interactive Proof System
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
Babai, L., Fortnow, L., Lund, C., “Non-Deterministic Exponential Time has Two-Prover Interactive Protocols”, Technical Report 90-03, University of Chicago, Dept. of Computer Science. Also in Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990.
Ben-Or, M., Goldwasser, S., Kilian, J., and Wigderson, A., “Efficient Identification Schemes Using Two Prover Interactive Proofs”, Advances in Cryptology — CRYPTO’ 89, Springer-Verlag.
Ben-Or, M., Goldwasser, S., Kilian, J., and Wigderson, A., “Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions”, Proc. 20th ACM Symposium on Theory of Computing, 1988, pp. 113–131.
Blum, M., “Designing programs to check their work”, Submitted to CACM.
Blum, M., Kannan, S., “Program correctness checking... and the design of programs that check their work”, Proc. 21st ACM Symposium on Theory of Computing, 1989.
Blum, M., Luby, M., Rubinfeld, R., “Self-Testing/Correcting Programs with Applications to Numerical Problems”, Proc. 22nd ACM Symposium on Theory of Computing, 1990.
Blum, M., Luby, M., Rubinfeld, R., “Program Result Checking against Adaptive Programs and in Cryptographic Settings”, Distributed Computing and Cryptography, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 2, 1991.
Feige, U., “NEXPTIME has Two-Provers One-Round Proof Systems With Exponentially Small Error Probability”, Manuscript.
Fortnow, L., Rompel, J., Sipser, M., “On the Power of Multi-Prover Interactive Protocols”, Proc. 3rd Structure in Complexity Theory Conference, 1998, pp. 156–161.
Gemmell, P., Lipton, R., Rubinfeld, R., Wigderson, A., “Self-Testing/Correcting for Polynomials and for Approximate Functions”, Proceedings of 23rd ACM STOC, 1991.
Goldwasser, S., Micali, S., Rackoff, C., The Knowledge Complexity of Interactive Proof Systems”, SIAM J. Comput., 18(1), 1989, pp. 186–208.
Lund, C., Fortnow, L., Karloff, H., Nisan, N., “Algebraic Methods for Interactive Proof Systems”, Proceedings of the 31st Annual Symposium on Foundations of Computer Science,, 1990.
Shamir, Adi, “IP=PSPACE”, Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kilian, J., Rubinfeld, R. (1992). Interactive Proofs with Space Bounded Provers. In: Feigenbaum, J. (eds) Advances in Cryptology — CRYPTO ’91. CRYPTO 1991. Lecture Notes in Computer Science, vol 576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46766-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-46766-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55188-1
Online ISBN: 978-3-540-46766-3
eBook Packages: Springer Book Archive