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

DOI10.1007/978-3-662-46497-7_9MaRDI QIDQ5261678zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Parallel repetition theorems for interactive arguments
• An efficient parallel repetition theorem
• A parallel repetition theorem for constant-round Arthur-Merlin proofs
• scientific article; zbMATH DE number 1263221
• A Parallel Repetition Theorem

Cited in

(9)

• Fiat-Shamir for highly sound protocols is instantiable
• Parallel repetition theorems for interactive arguments
• A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
• Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
• Predictable arguments of knowledge
• Simultaneous secrecy and reliability amplification for a general channel model
• A compressed \(\varSigma \)-protocol theory for lattices
• A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
• Constant-round arguments for batch-verification and bounded-space computations from one-way functions

This page was built for publication: Tight parallel repetition theorems for public-coin arguments using KL-divergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261678)