General hardness amplification of predicates and puzzles. (Extended abstract)

DOI10.1007/978-3-642-19571-6_2zbMATH Open1281.94031OpenAlexW1753012273MaRDI QIDQ3000529FDOQ3000529

Authors: 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

Recommendations

• Theory of Cryptography
• On Yao's XOR-lemma
• Security Amplification for Interactive Cryptographic Primitives
• Direct product hardness amplification
• Hardness Amplification Proofs Require Majority

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Cited In (12)

• Security Amplification for Interactive Cryptographic Primitives
• Refuting the dream XOR lemma via ideal obfuscation and resettable MPC
• On uniform amplification of hardness in NP
• Degradation and Amplification of Computational Hardness
• Simultaneous secrecy and reliability amplification for a general channel model
• Parallel repetition theorems for interactive arguments
• Title not available (Why is that?)
• Magic adversaries versus individual reduction: science wins either way
• Improved direct product theorems for randomized query complexity
• Direct product hardness amplification
• Theory of Cryptography
• On Yao's XOR-lemma

This page was built for publication: General hardness amplification of predicates and puzzles. (Extended abstract)

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