Published in: LIPIcs, Volume 267, 4th Conference on Information-Theoretic Cryptography (ITC 2023)
Justin Holmgren and Ruta Jawale. Locally Covert Learning. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 14:1-14:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{holmgren_et_al:LIPIcs.ITC.2023.14, author = {Holmgren, Justin and Jawale, Ruta}, title = {{Locally Covert Learning}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {14:1--14:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.14}, URN = {urn:nbn:de:0030-drops-183421}, doi = {10.4230/LIPIcs.ITC.2023.14}, annote = {Keywords: learning theory, adversarial machine learning, zero knowledge, Fourier analysis of boolean functions, Goldreich-Levin algorithm, Kushilevitz-Mansour algorithm} }
Published in: LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)
Uma Girish, Kunal Mittal, Ran Raz, and Wei Zhan. Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 245, pp. 6:1-6:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{girish_et_al:LIPIcs.APPROX/RANDOM.2022.6, author = {Girish, Uma and Mittal, Kunal and Raz, Ran and Zhan, Wei}, title = {{Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)}, pages = {6:1--6:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-249-5}, ISSN = {1868-8969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.6}, URN = {urn:nbn:de:0030-drops-171286}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.6}, annote = {Keywords: Parallel repetition, Multi-prover games, Fourier analysis} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Justin Holmgren, Andrea Lincoln, and Ron D. Rothblum. Delegation for Search Problems. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 73:1-73:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{holmgren_et_al:LIPIcs.ICALP.2022.73, author = {Holmgren, Justin and Lincoln, Andrea and Rothblum, Ron D.}, title = {{Delegation for Search Problems}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {73:1--73:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.73}, URN = {urn:nbn:de:0030-drops-164146}, doi = {10.4230/LIPIcs.ICALP.2022.73}, annote = {Keywords: Interactive Proofs, Fine-Grained Complexity, Delegation} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Liron Bronfman and Ron D. Rothblum. PCPs and Instance Compression from a Cryptographic Lens. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 30:1-30:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bronfman_et_al:LIPIcs.ITCS.2022.30, author = {Bronfman, Liron and Rothblum, Ron D.}, title = {{PCPs and Instance Compression from a Cryptographic Lens}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {30:1--30:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.30}, URN = {urn:nbn:de:0030-drops-156269}, doi = {10.4230/LIPIcs.ITCS.2022.30}, annote = {Keywords: PCP, Succinct Arguments, Instance Compression} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, and Wei Zhan. Parallel Repetition for the GHZ Game: A Simpler Proof. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 62:1-62:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{girish_et_al:LIPIcs.APPROX/RANDOM.2021.62, author = {Girish, Uma and Holmgren, Justin and Mittal, Kunal and Raz, Ran and Zhan, Wei}, title = {{Parallel Repetition for the GHZ Game: A Simpler Proof}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {62:1--62:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.62}, URN = {urn:nbn:de:0030-drops-147551}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.62}, annote = {Keywords: Parallel Repetition, GHZ, Polynomial, Multi-player} }
Published in: LIPIcs, Volume 185, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
Ofer Grossman and Justin Holmgren. Error Correcting Codes for Uncompressed Messages. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 185, pp. 43:1-43:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{grossman_et_al:LIPIcs.ITCS.2021.43, author = {Grossman, Ofer and Holmgren, Justin}, title = {{Error Correcting Codes for Uncompressed Messages}}, booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)}, pages = {43:1--43:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-177-1}, ISSN = {1868-8969}, year = {2021}, volume = {185}, editor = {Lee, James R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.43}, URN = {urn:nbn:de:0030-drops-135828}, doi = {10.4230/LIPIcs.ITCS.2021.43}, annote = {Keywords: Coding Theory, List Decoding} }
Published in: LIPIcs, Volume 185, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
Justin Holmgren and Alexander S. Wein. Counterexamples to the Low-Degree Conjecture. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 185, pp. 75:1-75:9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{holmgren_et_al:LIPIcs.ITCS.2021.75, author = {Holmgren, Justin and Wein, Alexander S.}, title = {{Counterexamples to the Low-Degree Conjecture}}, booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)}, pages = {75:1--75:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-177-1}, ISSN = {1868-8969}, year = {2021}, volume = {185}, editor = {Lee, James R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.75}, URN = {urn:nbn:de:0030-drops-136148}, doi = {10.4230/LIPIcs.ITCS.2021.75}, annote = {Keywords: Low-degree likelihood ratio, error-correcting codes} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, and Tal Malkin. On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 86:1-86:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{ball_et_al:LIPIcs.ITCS.2020.86, author = {Ball, Marshall and Holmgren, Justin and Ishai, Yuval and Liu, Tianren and Malkin, Tal}, title = {{On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {86:1--86:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.86}, URN = {urn:nbn:de:0030-drops-117714}, doi = {10.4230/LIPIcs.ITCS.2020.86}, annote = {Keywords: Randomized Encoding, Private Simultaneous Messages} }
Feedback for Dagstuhl Publishing