Zvika Brakerski

Tight Post-Quantum Parallel Repetition for Private-Coin Arguments

We show that assuming the existence of homomorphic encryption, parallel repetition of all interactive arguments (after being run under homomorphic encryption) reduces the soundness error at a tight exponential rate even in the post-quantum setting. Moreover, we generalize this result to hold for threshold verifiers, wh...