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

DOI10.1007/978-3-642-19571-6_2MaRDI QIDQ3000529zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(12)

• On Yao's XOR-lemma
• 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
• scientific article; zbMATH DE number 1500548 (Why is no real title available?)
• Magic adversaries versus individual reduction: science wins either way
• Improved direct product theorems for randomized query complexity
• Direct product hardness amplification
• Theory of Cryptography

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)