@inproceedings{2aba120817334ce89ce8c5d080e55501,
title = "On interactive proofs with a laconic prover (extended abstract)",
abstract = "We continue the investigation of interactive proofs with bounded communication, as initiated by Goldreich and H{\aa}stad (IPL 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 NPcomplete 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}.",
keywords = "Arthur-Merlin games, Gme theory, Iteractive proofs, Satistical zero knowledge, Smpling proto-cols",
author = "Oded Goldreich and Salil Vadhan and Avi Wigderson",
year = "2001",
doi = "10.1007/3-540-48224-5_28",
language = "אנגלית",
isbn = "3540422870",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "334--345",
editor = "Fernando Orejas and Spirakis, {Paul G.} and {van Leeuwen}, Jan",
booktitle = "Automata, Languages and Programming - 28th International Colloquium, ICALP 2001, Proceedings",
address = "גרמניה",
note = "28th International Colloquium on Automata, Languages and Programming, ICALP 2001 ; Conference date: 08-07-2001 Through 12-07-2001",
}