Date:
Monday, 5 February, 2024 - 14:00 to 15:00
Speaker:
Ziyi Guan (EPFL)
Venue:
Computer Laboratory, William Gates Building, FW11
Parallel repetition has been widely used for interactive proofs (IPs) and multi-prover interactive proofs (MIPs). We initiate the systematic study of parallel repetition for probabilistically checkable proofs (PCPs).
We uncover a surprising result: canonical parallel repetition of a PCP increases soundness error and brings the limit of the soundness error to one. This failure turns out to be rather common and we characterize the cause for it. Finally we propose a simple variant of parallel repetition for PCPs that works as expected.
Based on https://eprint.iacr.org/2023/1714, joint work with Alessandro Chiesa and Burcu Yıldız.
Seminar series:
Algorithms and Complexity Seminar
