- 1 BABAI, L. Trading group theory for randomness. In Proceedings of the 17th A CM Symposium on the Theory of Computing (Providence, R.I., May 6-8). ACM, New York, 1985, pp. 421-429. Google Scholar
- 2 BEN-OR, M., GOLDWASSER, S., AND WIGDERSON, A. Completeness theorems for non-crytographic fault-tolerant distributed computation. In Proceedings of the 20th A CM Symposium on the Theory of Computing (Chicago, Ill., May 2-4). ACM, New York, 1988, pp. 1-10. Google Scholar
- 3 BRASSARD, G., AND CREPEAU, C Nontransitive transfer of confidence: A perfect-zero knowledge protocol for SAT and beyond. In Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science (Oct.). IEEE, New York, 1986, 188-195.Google Scholar
- 4 CHANDRA, A. K., KOZEN, D. C., AND STOCKMEYER, L. J. Alternaoon. J. A CM. 28, 1 (Jan. 1981), 114-133. Google Scholar
- 5 CHAUM, D., CREPEAU, C., AND DAMGARD, I. Multiparty unconditionally secure protocols. In Proceedings of the 20th A CM Symposium on the Theory of Computing (Chicago, Ill., May 2-4), ACM, New York, 1988, 11-19. Google Scholar
- 6 CONDON, A. :Space bounded probabllistic game automata. In Conference on Structure in Complexity Theory (June). IEEE, New York, 1988, pp. 162-174.Google Scholar
- 7 CONDON, A.The complexity of stochastic games. Tech. Rep. 863. Univ. Wisconsin-Madison, Madison, Wis., 1989.Google Scholar
- 8 CONDON, A. Computational Models of Games. MIT Press, Cambridge, Mass., 1989.Google Scholar
- 9 CONDON, A, AND LADNER, R. Probabilistic game automata. J. Comput. Syst. Sci. 36, 3 (June 1988), 452-489. Google Scholar
- 10 CONDON, A., AND LIPTON, R. J. On the complexity of space bounded interactive proof systems. In Proceedings of the 30th IEEE Symposium on the Foundauons of Computer Science (Oct.). IEEE, New York, 1989, pp. 462-467.Google Scholar
- 11 DWORK, C. AND STOCKMEYER, L. Interacnve proof systems with finite state verifiers. Res. Rep. RJ 6262 (61659). IBM Almaden Research Center, San Jose, Calif., 1988.Google Scholar
- 12 FEIGE, U., FIAT, A., AND SHAMIR, A. Zero knowledge proofs of identity. In Proceedings of the 19th ACM Symposium on the Theory of Computing (New York, N.Y., May 25-27). ACM, New York, 1987, pp. 210-217. Google Scholar
- 13 FORTNOW, L. Complexity-theoretic aspects of interactive proof systems. Tech. Rep. MIT/LCS/TR-447. MIT, Cambridge, Mass., 1989.Google Scholar
- 14 FORTNOW, L., AND SIPSER, M. Interactive proof systems with a log space verifier. Manuscript. MIT, Cambridge, Mass., 1988.Google Scholar
- 15 GAREY. M. R., AND JOHNSON, D. S. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979. Google Scholar
- 16 GOLDREICH, 0., MICALI, S., AND WIGDERSON, A Proofs that yield nothing but their validity and a methodology of cryptographic design. In Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science (Oct.). IEEE, New York, 1986, pp. 174-187.Google Scholar
- 17 GOLDWASSER, S., AND MICALI, S. Probabflistic encryption and how to play mental poker keeping secret all partial information. In Proceedings of the 14th A CM Symposium on the Theory of Computing (San Francisco, Cahf., May 5-7). ACM, New York, 1982, pp. 365-377. Google Scholar
- 18 GOLDWASSER, S., MICALI, S., AND RACKOFF, C. The knowledge complexity of interactive proof systems. In Proceedings of the 17th A CM Symposium on the Theory of Computing (Providence, R.I., May 6-8). ACM, New York, 1985, pp. 291-304. Google Scholar
- 19 GOLDWASSER, S., AND SIPSER, M. Private coins versus pubhc coins in interactive proof systems. In Proceedings of the 18th ACM Symposium on the Theory of Computing (Berkeley, Calif., May 28-30). ACM, New York, 1986, pp. 59-68. Google Scholar
- 20 KILLIAN, J. Zero knowledge with log-space verifiers. In Proceedings of the 29th IEEE Symposium on the Foundations of Computer Science (Oct.). IEEE, New York, 1988, pp. 25-35.Google Scholar
- 21 PAPADIMITRIOU, C. H. Games against nature. J Comput. Syst. Sct. 31 (1985), 288-301 Google Scholar
- 22 PETERSON, G. L., AND REIF, J. H. Multiple person alternation. In Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science. IEEE, New York, 1979, pp. 348-363.Google Scholar
- 23 REIF, J H. The complexity of two-player games of incomplete reformation J. Comput. Syst. Sci. 29, 2 (1984), 274-301Google Scholar
- 24 Ruzzo, W. L., SIMON, J., AND TOMPA, M. Space-bounded hierarchies and probabflistlc computatlons. J. Comput. Sys. Scl. 28, 2 (Apr. 1984), 216-230.Google Scholar
- 25 SHAPLEY, L. S. Stochastic games. In Proceedings of the National Academy of Sciences, U.S.A. Vol, 39. 1953, pp. 1095-1100.Google Scholar
- 26 TOMPA, M., AND WOLL, H Random self-reducibility and zero-knowledge interactive proofs of possession of informaUon. In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science (Oct.). IEEE, New York, 1987, pp. 472-482.Google Scholar
- 27 VRIEZE, 0. J. Stochastic games with finite state and action spaces, CWI Tract 33. Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, I987.Google Scholar
Index Terms
Space-bounded probabilistic game automata
Recommendations
Finite state verifiers I: the power of interaction
An investigation of interactive proof systems (IPSs) where the verifier is a 2-way probabilistic finite state automaton (2pfa) is initiated. In this model, it is shown:
- (1) IPSs in which the verifier uses private randomization are strictly more powerful ...
Affine Automata Verifiers
Unconventional Computation and Natural ComputationAbstractWe initiate the study of the verification power of Affine finite automata (AfA) as a part of Arthur-Merlin (AM) proof systems. We show that every unary language is verified by a real-valued AfA verifier. Then, we focus on the verifiers restricted ...
Generalized quantum arthur-merlin games
CCC '15: Proceedings of the 30th Conference on Computational ComplexityThis paper investigates the role of interaction and coins in quantum Arthur-Merlin games(also called public-coin quantum interactive proof systems). While the existing model restricts the messages from the verifier to be classical even in the quantum ...
Comments