A Zero-Knowledge PCP Theorem
Computational Complexity
2024-11-13 v1 Cryptography and Security
Abstract
We show that for every polynomial q* there exist polynomial-size, constant-query, non-adaptive PCPs for NP which are perfect zero knowledge against (adaptive) adversaries making at most q* queries to the proof. In addition, we construct exponential-size constant-query PCPs for NEXP with perfect zero knowledge against any polynomial-time adversary. This improves upon both a recent construction of perfect zero-knowledge PCPs for #P (STOC 2024) and the seminal work of Kilian, Petrank and Tardos (STOC 1997).
Cite
@article{arxiv.2411.07972,
title = {A Zero-Knowledge PCP Theorem},
author = {Tom Gur and Jack O'Connor and Nicholas Spooner},
journal= {arXiv preprint arXiv:2411.07972},
year = {2024}
}