A lower bound for probabilistic algorithms for finite state machines
Journal of Computer and System Sciences
Proc. of the conference on Structure in complexity theory
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Probabilistic Two-Way Machines
Proceedings on Mathematical Foundations of Computer Science
Computational models of games
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Zero-knowledge with log-space verifiers
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
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.