Zero-Knowledge With Finite State Verifiers

(Extended Abstract)
  • Cynthia Dwork
  • Larry Stockmeyer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 403)


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. 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. 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.



Error Probability Turing Machine Proof System Interactive Proof Interactive Proof System 
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.


  1. [1]
    L. Babai, Trading group theory for randomness, Proc. 17th ACM Symp. on Theory of Computing (1985), pp. 421–429.Google Scholar
  2. [2]
    A. Condon, Computational models of games, Ph.D. Thesis, Tech. Report 87-04-04, Computer Science Dept., University of Washington, Seattle, WA, 1987.Google Scholar
  3. [3]
    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.CrossRefGoogle Scholar
  4. [4]
    C. Dwork and L. Stockmeyer, Interactive proof systems with finite state verifiers (preliminary report), IBM Research Report RJ 6262 (1988).Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    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.MathSciNetCrossRefGoogle Scholar
  9. [9]
    J. Kilian, Zero-knowledge with log-space verifiers, Proc. 29th IEEE Symp. on Foundations of Computer Science (1988), to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Cynthia Dwork
    • 1
  • Larry Stockmeyer
    • 1
  1. 1.IBM Almaden Research CenterSan JoseUSA

Personalised recommendations