On derandomizing Yao's weak-to-strong OWF construction

DOI10.1007/978-3-030-90453-1_15OpenAlexW3214173227MaRDI QIDQ2697871

Chris Brzuska, Geoffroy Couteau, Pihla Karanko, Felix Rohrbach

Publication date: 13 April 2023

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomness in distribution protocols
• Non-deterministic exponential time has two-prover interactive protocols
• \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
• The complexity of constructing pseudorandom generators from hard functions
• Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
• Trapdoor hash functions and their applications
• Notions of Black-Box Reductions, Revisited
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• Correlated Product Security from Any One-Way Function
• Barriers in cryptography with weak, correlated and leaky sources
• Correlated-Input Secure Hash Functions
• Using nondeterminism to amplify hardness
• Lower bounds on the efficiency of encryption and digital signature schemes
• On uniform amplification of hardness in NP
• One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
• Chosen-Ciphertext Security via Correlated Products
• Amplifying Collision Resistance: A Complexity-Theoretic Treatment
• On the Security Loss in Cryptographic Reductions
• A Pseudorandom Generator from any One-way Function
• Advances in Cryptology – CRYPTO 2004
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Pseudorandom generators without the XOR lemma

This page was built for publication: On derandomizing Yao's weak-to-strong OWF construction