Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

FOCS

2009

IEEE

2009

IEEE

— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an exponential rate) the error in interactive proofs and (at a weak exponential rate) in special cases of interactive arguments (e.g., 3-message protocols — Bellare, Impagliazzo and Naor [FOCS ’97], and public-coin protocols — H˚astad, Pass, Pietrzak and Wikstr¨om [Manuscript ’08]), Bellare et al. gave an example of interactive arguments for which parallel repetition does not reduce the soundness error at all. We show that by slightly modifying any interactive argument, in a way that preserves its completeness and only slightly deteriorates its soundness, we get a protocol for which parallel repetition does reduce the error at a weak exponential rate. In this modiﬁed version, the veriﬁer ﬂips at the beginning of each round an (1 − 1 4m , 1 4m ) biased coin (i.e., 1 is tossed with probability 1/4m...

Related Content

Added |
20 May 2010 |

Updated |
20 May 2010 |

Type |
Conference |

Year |
2009 |

Where |
FOCS |

Authors |
Iftach Haitner |

Comments (0)