ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR09-089 | 26th September 2009 05:57

Are PCPs Inherent in Efficient Arguments?

RSS-Feed




TR09-089
Authors: Guy Rothblum, Salil Vadhan
Publication: 3rd October 2009 14:10
Downloads: 995
Keywords: 


Abstract:

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 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).



ISSN 1433-8092 | Imprint