A Zero-Knowledge PCP Theorem
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917834988191744 |
|---|---|
| author | Gur, Tom O'Connor, Jack Spooner, Nicholas |
| author_facet | Gur, Tom O'Connor, Jack Spooner, Nicholas |
| contents | 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). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_07972 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Zero-Knowledge PCP Theorem Gur, Tom O'Connor, Jack Spooner, Nicholas Computational Complexity Cryptography and Security 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). |
| title | A Zero-Knowledge PCP Theorem |
| topic | Computational Complexity Cryptography and Security |
| url | https://arxiv.org/abs/2411.07972 |