@InProceedings{allender_et_al:LIPIcs.ISAAC.2021.54,
author = {Allender, Eric and Gouwar, John and Hirahara, Shuichi and Robelle, Caleb},
title = {{Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {54:1--54:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.54},
URN = {urn:nbn:de:0030-drops-154875},
doi = {10.4230/LIPIcs.ISAAC.2021.54},
annote = {Keywords: Kolmogorov Complexity, Interactive Proofs, Minimum Circuit Size Problem, Worst-case to Average-case Reductions}
}