Parallel Repetition of Computationally Sound Protocols Revisited
From MaRDI portal
Recommendations
- Parallel repetition of computationally sound protocols revisited
- Derandomized parallel repetition via structured PCPs
- On the correctness of parallel algorithms
- Non-Signaling Parallel Repetition Using de Finetti Reductions
- A no-go theorem for derandomized parallel repetition: beyond Feige-Kilian
- scientific article; zbMATH DE number 4117855
- An efficient parallel repetition theorem
- scientific article; zbMATH DE number 4133475
- Parallel-algorithm communication operations generated by uniform dependences
- Verification of correctness of parallel algorithms in practice
Cited in
(14)- Chernoff-type direct product theorems
- A compressed \(\varSigma \)-protocol theory for lattices
- Two prover protocols, low error at affordable rates
- Simultaneous secrecy and reliability amplification for a general channel model
- An efficient parallel repetition theorem
- Parallel repetition theorems for interactive arguments
- Parallel repetition of computationally sound protocols revisited
- scientific article; zbMATH DE number 1254029 (Why is no real title available?)
- scientific article; zbMATH DE number 2038705 (Why is no real title available?)
- Distinguishing distributions using Chernoff information
- A parallel repetition theorem for any interactive argument
- Degradation and Amplification of Computational Hardness
- Theory of Cryptography
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
This page was built for publication: Parallel Repetition of Computationally Sound Protocols Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596374)
