Direct product hardness amplification

DOI10.1007/978-3-030-90453-1_21MaRDI QIDQ2697877zbMATH OpenOpenAlexFDO

Authors David Lanzenberger, Ueli M. Maurer

Publication date 13 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90453-1_21

zbMATH Keywords

cryptographic gameshardness amplification

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Counterexamples to hardness amplification beyond negligible
• Security Amplification for Interactive Cryptographic Primitives
• General hardness amplification of predicates and puzzles. (Extended abstract)
• Hardness Amplification Proofs Require Majority
• Uniform direct product theorems: simplified, optimized, and derandomized

Cites work

• Almost optimal bounds for direct product threshold theorem
• Amplifying Collision Resistance: A Complexity-Theoretic Treatment
• Chernoff-type direct product theorems
• Counterexamples to hardness amplification beyond negligible
• Foundations of Cryptography
• General hardness amplification of predicates and puzzles. (Extended abstract)
• Security Amplification for Interactive Cryptographic Primitives
• Theory of Cryptography

Cited in

(5)

• Counterexamples to hardness amplification beyond negligible
• General hardness amplification of predicates and puzzles. (Extended abstract)
• Security Amplification for Interactive Cryptographic Primitives
• Bit-security preserving hardness amplification
• Improved hardness amplification in NP

This page was built for publication: Direct product hardness amplification

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