Thumbnail
Access Restriction
Subscribed

Author Dwork, Cynthia ♦ Stockmeyer, Larry
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1992
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Arthur-Merlin games ♦ Complexity theory ♦ Finite state automata ♦ Interactive proof systems ♦ Probabilistic automata
Abstract An investigation of interactive proof systems (IPSs) where the verifier is a 2-way probabilistic finite state automaton (2pfa) is initiated. In this model, it is shown:(1) IPSs in which the verifier uses private randomization are strictly more powerful than IPSs in which the random choices of the verifier are made public to the prover.(2) IPSs in which the verifier uses public randomization are strictly more powerful than 2pfa's alone, that is, without a prover.(3) Every language which can be accepted by some deterministic Turing machine in exponential time can be accepted by some IPS.Additional results concern two other classes of verifiers: 2pfa's that halt in polynomial expected time, and 2-way probabilistic pushdown automata that halt in polynomial time. In particular, IPSs with verifiers in the latter class are as powerful as IPSs where verifiers are polynomial-time probabilistic Turing machines. In a companion paper [7], zero knowledge IPSs with 2pfa verifiers are investigated.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1992-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 39
Issue Number 4
Page Count 29
Starting Page 800
Ending Page 828


Open content in new tab

   Open content in new tab
Source: ACM Digital Library