Are PCPs inherent in efficient arguments?


Rothblum, Guy, and Salil Vadhan. “Are PCPs inherent in efficient arguments?” Computational Complexity 19, no. 2 (2010): 265-304.
CC2010.pdf643 KB
ECCC2009.pdf2.48 MB
CCC2009.pdf358 KB


Version HistorySpecial Issue on CCC '09.

Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to construct very efficient argument systems (a.k.a. computationally sound proofs), for example with polylogarithmic communication complexity. Ishai et al. (CCC ‘07) raised the question of whether PCPs are inherent in efficient arguments, and if so, to what extent. We give evidence that they are, by showing how to convert any argument system whose soundness is reducible to the security of some cryptographic primitive into a PCP system whose efficiency is related to that of the argument system and the reduction (under certain complexity assumptions).

Publisher's Version

Last updated on 07/14/2020