@InProceedings{ren_et_al:LIPIcs.CCC.2021.35,
author = {Ren, Hanlin and Santhanam, Rahul},
title = {{Hardness of KT Characterizes Parallel Cryptography}},
booktitle = {36th Computational Complexity Conference (CCC 2021)},
pages = {35:1--35:58},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-193-1},
ISSN = {1868-8969},
year = {2021},
volume = {200},
editor = {Kabanets, Valentine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.35},
URN = {urn:nbn:de:0030-drops-143091},
doi = {10.4230/LIPIcs.CCC.2021.35},
annote = {Keywords: one-way function, meta-complexity, KT complexity, parallel cryptography, randomized encodings}
}