@inproceedings{c6e0521f3c214aa58b76144606cf91fb,
title = "Tight parallel repetition theorems for public-coin arguments using kl-divergence",
abstract = "We present a new and conceptually simpler proof of a tight parallel-repetition theorem for public-coin arguments [Pass-Venkitasubramaniam, STOC{\textquoteright}07], [H˚astad et al, TCC{\textquoteright}10], [Chung-Liu, TCC{\textquoteright}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.",
author = "Chung, {Kai Min} and Rafael Pass",
note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2015.; 12th Theory of Cryptography Conference, TCC 2015 ; Conference date: 23-03-2015 Through 25-03-2015",
year = "2015",
doi = "10.1007/978-3-662-46497-7_9",
language = "الإنجليزيّة",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "229--246",
editor = "Yevgeniy Dodis and Nielsen, {Jesper Buus}",
booktitle = "Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings",
address = "ألمانيا",
}