Counterexamples to Hardness Amplification beyond Negligible

DOI10.1007/978-3-642-28914-9_27zbMath1304.68072OpenAlexW90648621MaRDI QIDQ2891501

Daniel Wichs, Tal Moran, Yevgeniy Dodis, Abhishek Jain

Publication date: 15 June 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

A compressed \(\varSigma \)-protocol theory for lattices ⋮ One-message zero knowledge and non-malleable commitments ⋮ Maliciously-secure MrNISC in the plain model ⋮ A tight computational indistinguishability bound for product distributions ⋮ Post-quantum insecurity from LWE ⋮ Direct product hardness amplification ⋮ Incompressible encodings ⋮ A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence