Hanlin Ren, Rahul Santhanam. Hardness of KT Characterizes Parallel Cryptography. In Valentine Kabanets, editor, 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference). Volume 200 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{RenS21-2, title = {Hardness of KT Characterizes Parallel Cryptography}, author = {Hanlin Ren and Rahul Santhanam}, year = {2021}, doi = {10.4230/LIPIcs.CCC.2021.35}, url = {https://doi.org/10.4230/LIPIcs.CCC.2021.35}, researchr = {https://researchr.org/publication/RenS21-2}, cites = {0}, citedby = {0}, booktitle = {36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)}, editor = {Valentine Kabanets}, volume = {200}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, isbn = {978-3-95977-193-1}, }