TY - JOUR
T1 - On interactive proofs with a laconic prover
AU - Goldreich, Oded
AU - Vadhan, Salil
AU - Wigderson, Avi
PY - 2002
Y1 - 2002
N2 - We continue the investigation of interactive proofs with bounded communication, as initiated by Goldreich & Håstad (1998). Let L be a language that has an interactive proof in which the prover sends few (say b) bits to the verifier. We prove that the complement L̄ has a constant-round interactive proof of complexity that depends only exponentially on b. This provides the first evidence that for NP-complete languages, we cannot expect interactive provers to be much more "laconic" than the standard NP proof. When the proof system is further restricted (e.g., when b = 1, or when we have perfect completeness), we get significantly better upper bounds on the complexity of L̄.
AB - We continue the investigation of interactive proofs with bounded communication, as initiated by Goldreich & Håstad (1998). Let L be a language that has an interactive proof in which the prover sends few (say b) bits to the verifier. We prove that the complement L̄ has a constant-round interactive proof of complexity that depends only exponentially on b. This provides the first evidence that for NP-complete languages, we cannot expect interactive provers to be much more "laconic" than the standard NP proof. When the proof system is further restricted (e.g., when b = 1, or when we have perfect completeness), we get significantly better upper bounds on the complexity of L̄.
KW - Arthur-Merlin games
KW - Game theory
KW - Interactive proof systems
KW - NP
KW - Sampling protocols
KW - Statistical zero-knowledge
UR - https://www.scopus.com/pages/publications/0242381728
U2 - 10.1007/s00037-002-0169-0
DO - 10.1007/s00037-002-0169-0
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0242381728
SN - 1016-3328
VL - 11
SP - 1
EP - 53
JO - Computational Complexity
JF - Computational Complexity
IS - 1-2
ER -