Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence

DOI10.1007/978-3-662-46497-7_9zbMath1379.94034OpenAlexW114896957MaRDI QIDQ5261678

Kai-Min Chung, Rafael Pass

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_9

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

A compressed \(\varSigma \)-protocol theory for lattices ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Simultaneous Secrecy and Reliability Amplification for a General Channel Model ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ Predictable Arguments of Knowledge ⋮ A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence

This page was built for publication: Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence