A Parallel Repetition Theorem for Any Interactive Argument

DOI10.1137/100810630zbMath1285.68010OpenAlexW2146278030MaRDI QIDQ5408774

Iftach Haitner

Publication date: 11 April 2014

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100810630

zbMATH Keywords

hardness amplificationparallel repetitioncomputationally sound proofsinteractive arguments

Mathematics Subject Classification ID

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

Related Items (3)

Channels of small log-ratio leakage and characterization of two-party differentially private computation ⋮ Predictable Arguments of Knowledge ⋮ A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence

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