Abstract
We initiate an investigation of interactive proof systems (IPS’s) and zero knowledge interactive proof systems where the verifier is a 2-way probabilistic finite state automaton (2pfa). Among other results, we show:
-
1.
There is a class of 2pfa verifiers and a language L such that L has a zero knowledge IPS with respect to this class of verifiers, and L cannot be recognized by any verifier in the class on its own;
-
2.
There is a language L such that L has an IPS with 2pfa verifiers but L has no zero knowledge IPS with 2pfa verifiers.
Chapter PDF
Similar content being viewed by others
Keywords
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
L. Babai, Trading group theory for randomness, Proc. 17th ACM Symp. on Theory of Computing (1985), pp. 421–429.
A. Condon, Computational models of games, Ph.D. Thesis, Tech. Report 87-04-04, Computer Science Dept., University of Washington, Seattle, WA, 1987.
A. Condon and R. Ladner, Probabilistic game automata, Proc. Conference on Structure in Complexity Theory, Lecture Notes in Computer Science, Vol. 223, Springer-Verlag, New York, 1986, pp. 144–162.
C. Dwork and L. Stockmeyer, Interactive proof systems with finite state verifiers (preliminary report), IBM Research Report RJ 6262 (1988).
R. Freivalds, Probabilistic two-way machines, Proc. International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 118, Springer-Verlag, New York, 1981, pp. 33–45.
O. Goldreich, S. Micali, and A. Wigderson, Proofs that yield nothing but their validity and a methodology of cryptographic protocol design, Proc. 27th IEEE Symp. on Foundations of Computer Science (1986), pp. 174–187.
S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, Proc. 17th ACM Symp. on Theory of Computing (1985), pp. 291–304.
A. G. Greenberg and A. Weiss, A lower bound for probabilistic algorithms for finite state machines, J. Comput. Syst. Sci. 33 (1986), pp. 88–105.
J. Kilian, Zero-knowledge with log-space verifiers, Proc. 29th IEEE Symp. on Foundations of Computer Science (1988), to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dwork, C., Stockmeyer, L. (1990). Zero-Knowledge With Finite State Verifiers. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_6
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive