Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience

ePrint Report: Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience

Mor Weiss

Probabilistically Checkable Proofs (PCPs) allow a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form ``$x\in\mathcal{L}$'' by querying only few proof
bits. Zero-Knowledge PCPs (ZK-PCPs) enhance standard PCPs to additionally guarantee that the view of any (possibly malicious) verifier querying a bounded number of proof bits can be efficiently simulated up to a small statistical distance.


The first …

eprint report resilience