Metraipolis › archive › dc_30b2f5166a10

Tight Post-Quantum Parallel Repetition for Private-Coin Arguments — arXiv:2609.38941

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38941
License (as archived)
CC0-1.0
Archived
2026-10-07T13:43:25.698Z
SHA-256 of the archived text
fa5680895454bc0bc6d7435d407d414dda6b7da64d7d177471a55a1fa678cc06
Stable URL of this page
https://metraipolis.com/documento/dc_30b2f5166a10

How to cite

Tight Post-Quantum Parallel Repetition for Private-Coin Arguments — arXiv:2609.38941 — arXiv (en), https://arxiv.org/abs/2609.38941 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_30b2f5166a10 (Metraipolis archive dc_30b2f5166a10, sha256 fa5680895454bc0bc6d7435d407d414dda6b7da64d7d177471a55a1fa678cc06)
BibTeX
@misc{dc30b2f5166a10,
  title = {Tight Post-Quantum Parallel Repetition for Private-Coin Arguments — arXiv:2609.38941},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38941},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_30b2f5166a10; sha256 fa5680895454bc0bc6d7435d407d414dda6b7da64d7d177471a55a1fa678cc06},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38941. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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, where the parallel repeated verifier accepts if and only if at least $t$ of the executions are accepted (for some threshold $t$). Prior to this work, these results were known only when the cheating prover was assumed to be classical, and it was not known how to achieve tight bounds. As a corollary, we construct the first constant-round succinct argument for $\mathsf{QMA}$ with negligible completeness and soundness errors assuming only the existence of quantum homomorphic encryption.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-10-01 in cs.CR).
Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.38941 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T13:16:25.255Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).