TY - GEN

T1 - Tight parallel repetition theorems for public-coin arguments using kl-divergence

AU - Chung, Kai Min

AU - Pass, Rafael

N1 - Publisher Copyright:
© International Association for Cryptologic Research 2015.

PY - 2015

Y1 - 2015

N2 - We present a new and conceptually simpler proof of a tight parallel-repetition theorem for public-coin arguments [Pass-Venkitasubramaniam, STOC’07], [H˚astad et al, TCC’10], [Chung-Liu, TCC’10].We follow the same proof framework as the previous non-tight parallel-repetition theorem of H˚astad et al—which relied on statistical distance to measure the distance between experiments—and show that it can be made tight (and further simplified) if instead relying on KL-divergence as the distance between the experiments. We then use this new proof to present the first tight “Chernoff-type” parallel repetition theorem for arbitrary public-coin arguments, demonstrating that parallel-repetition can be used to simultaneously decrease both the soundness and completeness error of any public-coin argument at a rate matching the standard Chernoff bound.

AB - We present a new and conceptually simpler proof of a tight parallel-repetition theorem for public-coin arguments [Pass-Venkitasubramaniam, STOC’07], [H˚astad et al, TCC’10], [Chung-Liu, TCC’10].We follow the same proof framework as the previous non-tight parallel-repetition theorem of H˚astad et al—which relied on statistical distance to measure the distance between experiments—and show that it can be made tight (and further simplified) if instead relying on KL-divergence as the distance between the experiments. We then use this new proof to present the first tight “Chernoff-type” parallel repetition theorem for arbitrary public-coin arguments, demonstrating that parallel-repetition can be used to simultaneously decrease both the soundness and completeness error of any public-coin argument at a rate matching the standard Chernoff bound.

UR - http://www.scopus.com/inward/record.url?scp=84924415602&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-46497-7_9

DO - 10.1007/978-3-662-46497-7_9

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84924415602

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 229

EP - 246

BT - Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings

A2 - Dodis, Yevgeniy

A2 - Nielsen, Jesper Buus

PB - Springer Verlag

T2 - 12th Theory of Cryptography Conference, TCC 2015

Y2 - 23 March 2015 through 25 March 2015

ER -