A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
From MaRDI portal
Publication:2102080
DOI10.1007/978-3-030-56877-1_19OpenAlexW3048890025MaRDI QIDQ2102080FDOQ2102080
Authors: Itay Berman, Iftach Haitner, Eliad Tsfadia 
Publication date: 7 December 2022
Full work available at URL: https://arxiv.org/abs/2105.00801
Recommendations
- Parallel repetition theorems for interactive arguments
- A Parallel Repetition Theorem for Any Interactive Argument
- A parallel repetition theorem for any interactive argument
- Tight parallel repetition theorems for public-coin arguments using KL-divergence
- Strong refinements for hard problems in argumentation dynamics
- A \(k\)-provers parallel repetition theorem for a version of no-signaling model
- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
- Parallel repetition of two-prover one-round games: an exposition
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
Cites Work
- Connected components in random graphs with given expected degree sequences
- An efficient parallel repetition theorem
- Asymptotic evaluation of certain markov process expectations for large time. IV
- A Parallel Repetition Theorem
- Analytical approach to parallel repetition
- Parallel repetition: simplification and the no-signaling case
- On the power of multi-prover interactive protocols
- Error reduction by parallel repetition - a negative result
- Parallel repetition in projection games and a concentration bound
- Theory of Cryptography
- Parallel repetition theorems for interactive arguments
- Parallel repetition of computationally sound protocols revisited
- Modern cryptography, probabilistic proofs and pseudo-randomness
- Efficient fully homomorphic encryption from (standard) LWE
- Counterexamples to hardness amplification beyond negligible
- Tight parallel repetition theorems for public-coin arguments using KL-divergence
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
- A parallel repetition theorem for constant-round Arthur-Merlin proofs
- A parallel repetition theorem for any interactive argument
- The Randomness Complexity of Parallel Repetition
Cited In (2)
This page was built for publication: A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102080)
