Parallel repetition theorems for interactive arguments

DOI10.1007/978-3-642-11799-2_2MaRDI QIDQ3408185zbMATH OpenOpenAlexFDO

Authors Kai-Min Chung, Feng-Hao Liu

Publication date 24 February 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-11799-2_2

zbMATH Keywords

Arthur-Merlindirect product theoreminteractive argumentparallel repetitionpublic-coin

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

Recommendations

• An efficient parallel repetition theorem
• A parallel repetition theorem for any interactive argument
• Tight parallel repetition theorems for public-coin arguments using KL-divergence
• Parallel repetition of computationally sound protocols revisited
• Parallel Repetition of Computationally Sound Protocols Revisited

Cites work

• A Parallel Repetition Theorem
• A Parallel Repetition Theorem for Any Interactive Argument
• An efficient parallel repetition theorem
• Chernoff-type direct product theorems
• Fully homomorphic encryption using ideal lattices
• General hardness amplification of predicates and puzzles. (Extended abstract)
• scientific article; zbMATH DE number 5485477 (Why is no real title available?)
• Parallel Repetition of Computationally Sound Protocols Revisited
• Theory of Cryptography

Cited in

(18)

• Chernoff-type direct product theorems
• A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
• A compressed \(\varSigma \)-protocol theory for lattices
• Tight state-restoration soundness in the algebraic group model
• Interactive Coding for Interactive Proofs
• A parallel repetition theorem for constant-round Arthur-Merlin proofs
• Simultaneous secrecy and reliability amplification for a general channel model
• An efficient parallel repetition theorem
• Almost optimal bounds for direct product threshold theorem
• Chernoff-Type Direct Product Theorems
• Parallel repetition of computationally sound protocols revisited
• scientific article; zbMATH DE number 1263221 (Why is no real title available?)
• Tight parallel repetition theorems for public-coin arguments using KL-divergence
• A parallel repetition theorem for any interactive argument
• Theory of Cryptography
• Predictable arguments of knowledge
• Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
• Almost-total puzzles and their applications

This page was built for publication: Parallel repetition theorems for interactive arguments

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