One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions
Yanyi Liu, Rafael Pass
2023Year
10Citations
6Top-tier citations
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 03d84640-3fd4-4bb1-a4ed-ed3980312c8aCited by top-tier papers6
- A Meta-complexity Characterization of Minimal Quantum CryptographyBruno Cavalar, Boyang Chen, Andrea Coladangelo, Matthew Gray et al.STOC 2026 · 4 citations
- Optimal Coding for Randomized Kolmogorov Complexity and Its ApplicationsShuichi Hirahara, Zhenjian Lu, Mikito NanashimaFOCS 2024 · 3 citations
- A Meta-complexity Characterization of Quantum CryptographyBruno Pasqualotto Cavalar, Eli Goldin, Matthew Gray, Peter HallEUROCRYPT 2025 · 2 citations
- NP-hardness of the Minimum Circuit Size Problem from Well-Studied AssumptionsShuichi Hirahara, Rahul IlangoFOCS 2025 · 1 citation
- Failure of Symmetry of Information for Randomized ComputationsJinqiao Hu, Yahel Manor, Igor C. OliveiraSTOC 2026
Related papers
- A Duality between One-Way Functions and Average-Case Symmetry of InformationShuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima et al.STOC 2023 · 9 citations
- Hardness Along the Boundary: Towards One-Way Functions from the Worst-Case Hardness of Time-Bounded Kolmogorov ComplexityYanyi Liu, Rafael PassCRYPTO 2025 · 1 citation
- Robustness of average-case meta-complexity via pseudorandomnessRahul Ilango, Hanlin Ren, Rahul SanthanamSTOC 2022 · 13 citations
- Capturing One-Way Functions via NP-Hardness of Meta-ComplexityShuichi HiraharaSTOC 2023 · 9 citations
- On One-way Functions and Kolmogorov ComplexityYanyi Liu, Rafael PassFOCS 2020 · 39 citations
