Parallel Repetition for Post-Quantum Arguments
- LRM

Main:40 Pages
Bibliography:2 Pages
Abstract
In this work, we show that parallel repetition of public-coin interactive arguments reduces the soundness error at an exponential rate even in the post-quantum setting. Moreover, we generalize this result to hold for threshold verifiers, where the parallel repeated verifier accepts if and only if at least of the executions are accepted (for some threshold ). Prior to this work, these results were known only when the cheating prover was assumed to be classical.
View on arXiv@article{huang2025_2506.02277, title={ Parallel Repetition for Post-Quantum Arguments }, author={ Andrew Huang and Yael Tauman Kalai }, journal={arXiv preprint arXiv:2506.02277}, year={ 2025 } }
Comments on this paper