Perfect Zero-Knowledge PCPs for #P
<|reference_start|>Perfect Zero-Knowledge PCPs for #P: We construct perfect zero-knowledge probabilistically checkable proofs (PZK-PCPs) for every language in #P. This is the first construction of a PZK-PCP for any language outside BPP. Furthermore, unlike previous constructions of (statistical) zero-knowledge PCPs, our construction simultaneously achieves non-adaptivity and zero knowledge against arbitrary (adaptive) polynomial-time malicious verifiers.   Our construction consists of a novel masked sumcheck PCP, which uses the combinatorial nullstellensatz to obtain antisymmetric structure within the hypercube and randomness outside of it. To prove zero knowledge, we introduce the notion of locally simulatable encodings: randomised encodings in which every local view of the encoding can be efficiently sampled given a local view of the message. We show that the code arising from the sumcheck protocol (the Reed-Muller code augmented with subcube sums) admits a locally simulatable encoding. This reduces the algebraic problem of simulating our masked sumcheck to a combinatorial property of antisymmetric functions.<|reference_end|>
@article{gur2024perfect,
    title={Perfect Zero-Knowledge PCPs for #P},
    author={Tom Gur, Jack O'Connor and Nicholas Spooner},
    journal={arXiv preprint arXiv:2403.11941},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.11941},
    primaryClass={cs.CC cs.CR cs.DS}
}