Parallel Repetition Theorems for Interactive Arguments
From MaRDI portal
Publication:3408185
DOI10.1007/978-3-642-11799-2_2zbMath1274.94052OpenAlexW1569530622MaRDI QIDQ3408185
Publication date: 24 February 2010
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_2
Related Items (9)
A compressed \(\varSigma \)-protocol theory for lattices ⋮ Tight state-restoration soundness in the algebraic group model ⋮ Simultaneous Secrecy and Reliability Amplification for a General Channel Model ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ Parallel repetition of computationally sound protocols revisited ⋮ Predictable Arguments of Knowledge ⋮ Interactive Coding for Interactive Proofs ⋮ An Efficient Parallel Repetition Theorem ⋮ A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
Cites Work
- Unnamed Item
- Chernoff-type direct product theorems
- General Hardness Amplification of Predicates and Puzzles
- An Efficient Parallel Repetition Theorem
- Parallel Repetition of Computationally Sound Protocols Revisited
- A Parallel Repetition Theorem
- A Parallel Repetition Theorem for Any Interactive Argument
- Fully homomorphic encryption using ideal lattices
- Theory of Cryptography
This page was built for publication: Parallel Repetition Theorems for Interactive Arguments