A Parallel Repetition Theorem for Any Interactive Argument

DOI10.1109/FOCS.2009.50MaRDI QIDQ5171180zbMATH OpenOpenAlexFDO

Authors Iftach Haitner

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

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)

Cited in

(13)

• A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
• Parallel repetition of computationally sound protocols revisited
• Tight state-restoration soundness in the algebraic group model
• Fiat-Shamir for highly sound protocols is instantiable
• Fiat-Shamir for highly sound protocols is instantiable
• Simultaneous secrecy and reliability amplification for a general channel model
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• An efficient parallel repetition theorem
• Parallel repetition theorems for interactive arguments
• Amplification of non-interactive zero knowledge, revisited
• scientific article; zbMATH DE number 1263221 (Why is no real title available?)
• Constant-round arguments for batch-verification and bounded-space computations from one-way functions
• Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs

This page was built for publication: A Parallel Repetition Theorem for Any Interactive Argument

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171180)