Journal of the ACM Bibliography
Cynthia Dwork and Larry Stockmeyer. Finite
state verifiers I: The power of interaction. Journal of the
ACM, 39(4):800-828, October 1992.
[BibTeX entry]
Selected papers that cite this one
- Anne Condon, Lisa Hellerstein, Samuel Pottle, and Avi Wigderson. On the power of finite
automata with both nondeterministic and probabilistic states
(preliminary version). In Proceedings of the Twenty-Sixth
Annual ACM Symposium on the Theory of Computing, pages 676-685,
Montréal, Québec, Canada, 23-25 May 1994.
- Anne Condon and Richard Ladner. Interactive proof
systems with polynomially bounded strategies. Journal of
Computer and System Sciences, 50(3):506-518, June 1995.
- Cynthia Dwork and Larry Stockmeyer. Finite state verifiers II: Zero
knowledge. Journal of the ACM, 39(4):829-858, October
1992.
Selected references
- László Babai. Trading group theory for
randomness. In Proceedings of the Seventeenth Annual ACM
Symposium on Theory of Computing, pages 421-429, Providence,
Rhode Island, 6-8 May 1985.
- Andrei Broder. Generating random spanning
trees. In 30th Annual Symposium on Foundations of Computer
Science, pages 442-447, Research Triangle Park, North Carolina,
30 October-1 November 1989. IEEE.
- Ashok K. Chandra, Dexter C. Kozen, and Larry J. Stockmeyer. Alternation. Journal of
the ACM, 28(1):114-133, January 1981.
- Anne Condon and Richard J. Lipton. On the complexity of space
bounded interactive proofs (extended abstract). In 30th Annual
Symposium on Foundations of Computer Science, pages 462-467,
Research Triangle Park, North Carolina, 30 October-1 November 1989.
IEEE.
- Cynthia Dwork and Larry Stockmeyer. Finite state verifiers II: Zero
knowledge. Journal of the ACM, 39(4):829-858, October
1992.
- Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield
nothing but their validity and a methodology of cryptographic protocol
design (extended abstract). In 27th Annual Symposium on
Foundations of Computer Science, pages 174-187, Toronto, Ontario,
Canada, 27-29 October 1986. IEEE.
- Shafi Goldwasser and Michael Sipser. Private coins versus
public coins in interactive proof systems. In Proceedings of
the Eighteenth Annual ACM Symposium on Theory of Computing, pages
59-68, Berkeley, California, 28-30 May 1986.
- Joe Kilian. Zero-knowledge with log-space
verifiers. In 29th Annual Symposium on Foundations of Computer
Science, pages 25-35, White Plains, New York, 24-26 October 1988.
IEEE.
- Carsten Lund, Lance Fortnow, Howard Karloff, and Noam Nisan. Algebraic methods for
interactive proof systems. In 31st Annual Symposium on
Foundations of Computer Science, volume I, pages 2-10, St. Louis,
Missouri, 22-24 October 1990. IEEE.
- Michael O. Rabin. Probabilistic automata.
Information and Control, 6(3):230-245, September 1963.
- Adi Shamir. IP =
PSPACE. In 31st Annual Symposium on Foundations of Computer
Science, volume I, pages 11-15, St. Louis, Missouri, 22-24
October 1990. IEEE.
Shortcuts: