Browsing Faculty of Arts and Sciences by Keyword "CS Proofs"

Now showing items 1-1 of 1

    • Are PCPs Inherent in Efficient Arguments? 

      Rothblum, Guy N.; Vadhan, Salil P. (Hasso-Plattner-Institut fuer Softwaresystemtechnik GmbH, 2009)
      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 ...