@InProceedings{dottling_et_al:LIPIcs.ITCS.2024.40,
author = {D\"{o}ttling, Nico and Mour, Tamer},
title = {{On the Black-Box Complexity of Correlation Intractability}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {40:1--40:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.40},
URN = {urn:nbn:de:0030-drops-195683},
doi = {10.4230/LIPIcs.ITCS.2024.40},
annote = {Keywords: Correlation Intractability, Fiat-Shamir, Black-box Complexity, Black-box Separations}
}