Capturing one-way functions via NP-hardness of meta-complexity

Cites Work

A Pseudorandom Generator from any One-way Function
An Unconditional Study of Computational Zero Knowledge
Bit commitment using pseudorandomness
Foundations of Cryptography
Title not available (Why is that?)
Designing programs that check their work
Randomness vs time: Derandomization under a uniform assumption
Pseudorandomness and average-case complexity via uniform reductions
If NP languages are hard on the worst-case, then it is easy to find their hard instances
Worst-Case to Average-Case Reductions Revisited
On basing one-way functions on NP-hardness
On the Cryptographic Applications of Random Functions (Extended Abstract)
Random-Self-Reducibility of Complete Sets
The Shrinkage Exponent of de Morgan Formulas is 2
On Worst‐Case to Average‐Case Reductions for NP Problems
Title not available (Why is that?)
Average Case Complete Problems
Computational depth: Concept and applications
Conditional complexity and codes
Circuit minimization problem
Super-logarithmic depth lower bounds via the direct sum in communication complexity
On the Complexity of Learning Minimum Time-Bounded Turing Machines
Limitations of Hardness vs. Randomness under Uniform Reductions
Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity
Title not available (Why is that?)
Title not available (Why is that?)
On Basing Size-Verifiable One-Way Functions on NP-Hardness
Cryptography from Information Loss.
On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets
Theory of Cryptography
Title not available (Why is that?)
Circuit lower bounds from NP-hardness of MCSP under turing reductions
Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization
Title not available (Why is that?)
Average-case hardness of NP from exponential worst-case hardness assumptions

This page was built for publication: Capturing one-way functions via NP-hardness of meta-complexity

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