Journal of the ACM Bibliography
Cynthia Dwork and Larry Stockmeyer. Finite
state verifiers II: Zero knowledge. Journal of the ACM,
39(4):829-858, October 1992.
[BibTeX entry]
Selected papers that cite this one
Selected references
- Michael Ben-Or, Shafi Goldwasser, Joe Kilian, and Avi Wigderson. Multi-prover
interactive proofs: How to remove intractability assumptions. In
Proceedings of the Twentieth Annual ACM Symposium on Theory of
Computing, pages 113-131, Chicago, Illinois, 2-4 May 1988.
- Cynthia Dwork and Larry Stockmeyer. Finite state verifiers I: The power
of interaction. Journal of the ACM, 39(4):800-828,
October 1992.
- Uriel Feige, Amos Fiat, and Adi Shamir. Zero knowledge proofs of
identity. In Proceedings of the Nineteenth Annual ACM
Symposium on Theory of Computing, pages 210-217, New York City,
25-27 May 1987.
- Zvi Galil, Stuart Haber, and Moti Yung. A private interactive test
of a Boolean predicate and minimum-knowledge public-key cryptosystems
(extended abstract). In 26th Annual Symposium on Foundations
of Computer Science, pages 360-371, Portland, Oregon, 21-23
October 1985. IEEE.
- 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.
- Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental
game or a completeness theorem for protocols with honest majority.
In Proceedings of the Nineteenth Annual ACM Symposium on Theory of
Computing, pages 218-229, New York City, 25-27 May 1987.
- 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.
- Martin Tompa and Heather Woll. Random self-reducibility and
zero knowledge interactive proofs of possession of information. In
28th Annual Symposium on Foundations of Computer Science,
pages 472-482, Los Angeles, California, 12-14 October 1987. IEEE.
Shortcuts: