On Parallel Repetition of PCPs

Add to your list(s) Download to your calendar using vCal

• Ziyi Guan (EPFL)
• Monday 05 February 2024, 14:00-15:00
• Computer Laboratory, William Gates Building, FW11.

If you have a question about this talk, please contact Tom Gur.

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.

This talk is part of the Algorithms and Complexity Seminar series.

This talk is included in these lists:

• Algorithms and Complexity Seminar
• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory, William Gates Building, FW11
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.