A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence

DOI10.1007/978-3-030-56877-1_19MaRDI QIDQ2102080zbMATH OpenOpenAlexFDO

Authors Itay Berman, Iftach Haitner, Eliad Tsfadia

Publication date 7 December 2022

Full work available at URL https://arxiv.org/abs/2105.00801

zbMATH Keywords

parallel repetitioninteractive argumentpartially simulatablesmooth KL-divergence

Mathematics Subject Classification ID

Computer security (68M25)

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

• A Parallel Repetition Theorem
• A parallel repetition theorem for any interactive argument
• A parallel repetition theorem for constant-round Arthur-Merlin proofs
• A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
• An efficient parallel repetition theorem
• Analytical approach to parallel repetition
• Asymptotic evaluation of certain markov process expectations for large time. IV
• Connected components in random graphs with given expected degree sequences
• Counterexamples to hardness amplification beyond negligible
• Efficient fully homomorphic encryption from (standard) LWE
• Error reduction by parallel repetition - a negative result
• Modern cryptography, probabilistic proofs and pseudo-randomness
• On the power of multi-prover interactive protocols
• Parallel repetition in projection games and a concentration bound
• Parallel repetition of computationally sound protocols revisited
• Parallel repetition theorems for interactive arguments
• Parallel repetition: simplification and the no-signaling case
• The Randomness Complexity of Parallel Repetition
• Theory of Cryptography
• Tight parallel repetition theorems for public-coin arguments using KL-divergence

Cited in

(2)

• Tight state-restoration soundness in the algebraic group model
• A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence

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)