Published in: LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)
Elette Boyle, Yuval Ishai, Pierre Meyer, Robert Robere, and Gal Yehuda. On Low-End Obfuscation and Learning. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 251, pp. 23:1-23:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{boyle_et_al:LIPIcs.ITCS.2023.23, author = {Boyle, Elette and Ishai, Yuval and Meyer, Pierre and Robere, Robert and Yehuda, Gal}, title = {{On Low-End Obfuscation and Learning}}, booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)}, pages = {23:1--23:28}, 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.23}, URN = {urn:nbn:de:0030-drops-175265}, doi = {10.4230/LIPIcs.ITCS.2023.23}, annote = {Keywords: Indistinguishability obfuscation, cryptography, learning} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Reyad Abed Elrazik, Robert Robere, Assaf Schuster, and Gal Yehuda. Pseudorandom Self-Reductions for NP-Complete Problems. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 65:1-65:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{elrazik_et_al:LIPIcs.ITCS.2022.65, author = {Elrazik, Reyad Abed and Robere, Robert and Schuster, Assaf and Yehuda, Gal}, title = {{Pseudorandom Self-Reductions for NP-Complete Problems}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {65:1--65:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.65}, URN = {urn:nbn:de:0030-drops-156615}, doi = {10.4230/LIPIcs.ITCS.2022.65}, annote = {Keywords: computational complexity, pseudorandomness, worst-case to average-case, self reductions, planted clique, hereditary graph family} }
Feedback for Dagstuhl Publishing