Degradation and Amplification of Computational Hardness

DOI10.1007/978-3-540-78524-8_34zbMath1162.94365OpenAlexW2160361171MaRDI QIDQ5445529

Shai Halevi, Tal Rabin

Publication date: 5 March 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_34

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Simultaneous Secrecy and Reliability Amplification for a General Channel Model

Cites Work

• One way functions and pseudorandom generators
• On Yao’s XOR-Lemma
• Key agreement from weak bit agreement
• On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
• Oblivious-Transfer Amplification
• One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
• Theory of Cryptography

This page was built for publication: Degradation and Amplification of Computational Hardness