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

Kai Min Chung, Rafael Pass

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationTheory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings
EditorsYevgeniy Dodis, Jesper Buus Nielsen
PublisherSpringer Verlag
Pages229-246
Number of pages18
ISBN (Electronic)9783662464960
DOIs
StatePublished - 2015
Externally publishedYes
Event12th Theory of Cryptography Conference, TCC 2015 - Warsaw, Poland
Duration: 23 Mar 201525 Mar 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9015
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th Theory of Cryptography Conference, TCC 2015
Country/TerritoryPoland
CityWarsaw
Period23/03/1525/03/15

Funding

FundersFunder number
Air Force Research LaboratoryFA8750-11-2-0211
Defense Advanced Research Projects Agency
National Science FoundationCCF-1214844, CCF-0746990, CNS-1217821

    Fingerprint

    Dive into the research topics of 'Tight parallel repetition theorems for public-coin arguments using kl-divergence'. Together they form a unique fingerprint.

    Cite this