A parallel repetition theorem for any interactive argument

DOI10.1137/100810630MaRDI QIDQ5408774zbMATH OpenOpenAlexFDO

Authors 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

computationally sound proofshardness amplificationinteractive argumentsparallel repetition

Mathematics Subject Classification ID

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

Recommendations

• Parallel repetition of computationally sound protocols revisited
• Parallel repetition theorems for interactive arguments
• Parallel Repetition of Computationally Sound Protocols Revisited
• An efficient parallel repetition theorem
• A Parallel Repetition Theorem

Cited in

(10)

• A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
• Channels of small log-ratio leakage and characterization of two-party differentially private computation
• A parallel repetition theorem for constant-round Arthur-Merlin proofs
• Parallel repetition theorems for interactive arguments
• Parallel repetition of computationally sound protocols revisited
• scientific article; zbMATH DE number 1263221 (Why is no real title available?)
• Predictable arguments of knowledge
• Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
• On witness encryption and laconic zero-knowledge arguments
• A tight lower bound on adaptively secure full-information coin flip

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 Q5408774)