Finite State Verifiers I: The Power of Interaction

Journal of the ACM (JACM)

Volumn 39, Issue 4, 1992, Pages 800-828

  Dwork, Cynthia ^a   Stockmeyer, Larry ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Arthur Merlin games; complexity theory; finite state automata; interactive proof systems; probabilistic automata

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; INTERACTIVE COMPUTER SYSTEMS;

COMPLEXITY CLASSES; COMPUTATIONAL MODELS; PROBABILISTIC COMPUTATION;

FINITE AUTOMATA;

EID: 0026930507     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/146585.146599     Document Type: Article

References (24)

1. BABAI, L. Trading group theory for randomness. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing (Providence, R.I., May 6-8). ACM, New York, 1985, pp. 421-429.
2. BRODER, A. Generating random spanning trees. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science. IEEE, New York, 1989, pp. 442-447.
3. CHANDRA, A. K., KOZEN, D. C., AND STOCKMEYER, L. J. Alternation. J. ACM 28, 1 (Jan. 1981), 114-133.
4. CONDON, A. Computational models of games. Ph.D. dissertation, Tech. Rep. 87-04-04. Computer Science Dept., Univ. Washington, Seattle, Wash., 1987.
5. CONDON, A., AND LADNER, R. Probabilistic game automata. J. Comput. Syst. Sci. 36 (1988), 452-489.
6. CONDON, A., AND LIPTON, R. J. On the complexity of space bounded interactive proofs (extended abstract). In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science. IEEE, New York, 1989, pp. 462-467.
7. DWORK, C., AND STOCKMEYER, L. Finite state verifiers II: Zero knowledge. J. ACM 39, 4 (Oct. 1992), 829-858.
8. DWORK, C., AND STOCKMEYER, L. A time complexity gap for two-way probabilistic finite-state automata. SIAM J. Comput. 19 (1990), 1011-1023.
9. FREIVALDS, R. Probabilistic two-way machines. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 118. Springer-Verlag, New York, 1981, pp. 33-45.
10. GOLDREICH, O., MICALI, S., AND WIGDERSON, A. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science. IEEE, New York, 1986, pp. 174-187.
11. GOLDWASSER, S., MICALI, S., AND RACKOFF, C. The knowledge complexity of interactive proof systems. SIAM I. Comput. 18 (1989), 186-208.
12. GOLDWASSER, S., AND SIPSER, M. Private coins versus public coins in interactive proof systems. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing (Berkeley, Calif., May 28-30). ACM, New York, 1986, pp. 59-68.
13. GREENBERG, A. G., AND WEISS, A. A lower bound for probabilistic algorithms for finite state machines. J. Comput. Syst. Sci. 33 (1986), 88-105.
14. HOPCROFT, J. E., AND ULLMAN, J. D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass., 1979.
15. KANEPS, J., AND FREIVALDS, R. Running time to recognize nonregular languages by 2-way probabilistic automata. In Proceedings of the 18th International Colloquium on Automata. Languages, and Programming. Springer-Verlag, New York, 1991, pp. 174-185.
16. KILIAN, J. Zero-knowledge with log-space verifiers. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science. IEEE, New York, 1988, pp. 25-35.
17. LEIGHTON, F. T., AND RIVEST, R. L. The Markov chain tree theorem. Rep. MIT/LCS/TM-249. Laboratory for Computer Science. MIT. Cambridge, Mass., 1983.
18. LEIGHTON, F. T., AND RIVEST, R. L. Estimating a probability using finite memory. IEEE Trans. Inf. Theory IT-32 (1986), 733-742.
19. LIPTON, R. J. Recursively enumerable languages have finite state interactive proofs. Rep. CS-TR-213-89, Computer Science Dept., Princeton Univ., Princeton, N.J., 1989.
20. LUND, C., FORTNOW, L., KARLOFF, H., AND NISAN, N. Algebraic methods for interactive proof systems. In Proceedings of the 31th IEEE Symposium on Foundations of Computer Science. IEEE, New York, 1990, pp. 2-10.
21. RABIN, M. O. Probabilistic automata. Inf. Contr. 6 (1963), 230-245.
22. REIF, J. The complexity of two-player games of incomplete information. J. Comput. Syst. Sci. 29 (1984), 274-301.
23. SENETA, E. Non-Negative Matrices and Markov Chains. 2nd Ed. Springer-Verlag, New York, 1981.
24. SHAMIR, A. IP = PSPACE. In Proceedings of the 31th IEEE Symposium on Foundations of Computer Science. IEEE, New York, 1990, pp. 11-15.