Published in: LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)
Lijie Chen, Ryan Williams, and Tianqi Yang. Black-Box Constructive Proofs Are Unavoidable. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 251, pp. 35:1-35:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{chen_et_al:LIPIcs.ITCS.2023.35, author = {Chen, Lijie and Williams, Ryan and Yang, Tianqi}, title = {{Black-Box Constructive Proofs Are Unavoidable}}, booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)}, pages = {35:1--35:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-263-1}, ISSN = {1868-8969}, year = {2023}, volume = {251}, editor = {Tauman Kalai, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.35}, URN = {urn:nbn:de:0030-drops-175380}, doi = {10.4230/LIPIcs.ITCS.2023.35}, annote = {Keywords: Circuit lower bounds, natural proofs, probabilistic checkable proofs} }
Published in: LIPIcs, Volume 234, 37th Computational Complexity Conference (CCC 2022)
Lijie Chen, Jiatu Li, and Tianqi Yang. Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. In 37th Computational Complexity Conference (CCC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 234, pp. 23:1-23:37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chen_et_al:LIPIcs.CCC.2022.23, author = {Chen, Lijie and Li, Jiatu and Yang, Tianqi}, title = {{Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs}}, booktitle = {37th Computational Complexity Conference (CCC 2022)}, pages = {23:1--23:37}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-241-9}, ISSN = {1868-8969}, year = {2022}, volume = {234}, editor = {Lovett, Shachar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.23}, URN = {urn:nbn:de:0030-drops-165852}, doi = {10.4230/LIPIcs.CCC.2022.23}, annote = {Keywords: Almost universal hash functions, hardness magnification, pseudorandom functions} }
Feedback for Dagstuhl Publishing