Computer Science and Discrete Mathematics (CSDM)

A Zero-Knowledge PCP Theorem

Nicholas Spooner

Two central results in modern complexity theory can be summed up as follows:

Everything provable is provable in zero knowledge (NP ⊆ CZK); and

Everything provable is locally checkable (NP = PCP[log n, 1]).

In a pair of recent works, we show how to...