A Zero-Knowledge PCP Theorem

Tom Gur; Jack O'Connor; Nicholas Spooner

Paper 2024/1854 Original: eprint.iacr.org/2024/1854 ↗

A Zero-Knowledge PCP Theorem

Tom Gur

Jack O'Connor

Nicholas Spooner

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).

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
History: 2024-11-12: last updated; 2024-11-12: published
Short URL: https://ia.cr/2024/1854
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2024/1854,
      author = {Tom Gur and Jack O'Connor and Nicholas Spooner},
      title = {A Zero-Knowledge PCP Theorem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1854},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1854}
}