Are PCPs inherent in efficient arguments?

DOI10.1007/S00037-010-0291-3zbMath1217.68098OpenAlexW2179708474MaRDI QIDQ626678

Guy N. Rothblum, Salil P. Vadhan

Publication date: 18 February 2011

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4854423

zbMATH Keywords

cryptographyprobabilistically checkable proofs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (3)

Sumcheck arguments and their applications ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Constructing tree decompositions of graphs with bounded gonality

This page was built for publication: Are PCPs inherent in efficient arguments?