A Parallel Repetition Theorem for Any Interactive Argument
From MaRDI portal
Publication:5171180
DOI10.1109/FOCS.2009.50zbMath1292.68022OpenAlexW2110019059MaRDI QIDQ5171180
Publication date: 25 July 2014
Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/focs.2009.50
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)
Related Items (9)
Tight state-restoration soundness in the algebraic group model ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ 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 ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ An Efficient Parallel Repetition Theorem ⋮ Parallel Repetition Theorems for Interactive Arguments
This page was built for publication: A Parallel Repetition Theorem for Any Interactive Argument
