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 QIDQ2102080
Eliad Tsfadia, Itay Berman, Iftach Haitner
Publication date: 7 December 2022
Full work available at URL: https://arxiv.org/abs/2105.00801
Related Items (2)
Tight state-restoration soundness in the algebraic group model ⋮ A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
Cites Work
- Unnamed Item
- Parallel repetition of computationally sound protocols revisited
- Modern cryptography, probabilistic proofs and pseudo-randomness
- On the power of multi-prover interactive protocols
- Error reduction by parallel repetition - a negative result
- Connected components in random graphs with given expected degree sequences
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
- Counterexamples to Hardness Amplification beyond Negligible
- A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
- Parallel Repetition in Projection Games and a Concentration Bound
- An Efficient Parallel Repetition Theorem
- Parallel Repetition Theorems for Interactive Arguments
- Asymptotic evaluation of certain markov process expectations for large time. IV
- A Parallel Repetition Theorem
- Analytical approach to parallel repetition
- Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence
- A Parallel Repetition Theorem for Any Interactive Argument
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- The Randomness Complexity of Parallel Repetition
- Theory of Cryptography
This page was built for publication: A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
