General Hardness Amplification of Predicates and Puzzles
From MaRDI portal
Publication:3000529
DOI10.1007/978-3-642-19571-6_2zbMath1281.94031OpenAlexW1753012273MaRDI QIDQ3000529
Thomas Holenstein, Grant Schoenebeck
Publication date: 19 May 2011
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_2
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (5)
Simultaneous Secrecy and Reliability Amplification for a General Channel Model ⋮ Direct product hardness amplification ⋮ Improved direct product theorems for randomized query complexity ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Parallel Repetition Theorems for Interactive Arguments
This page was built for publication: General Hardness Amplification of Predicates and Puzzles
