{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:05:10Z","timestamp":1781028310337,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800916","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"2130-2139","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Pseudorandom Codes from Permuted Puzzles"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9914-6391","authenticated-orcid":false,"given":"Miranda","family":"Christ","sequence":"first","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2274-7861","authenticated-orcid":false,"given":"Noah","family":"Golowich","sequence":"additional","affiliation":[{"name":"Microsoft Research, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6173-4046","authenticated-orcid":false,"given":"Sam","family":"Gunn","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7047-0495","authenticated-orcid":false,"given":"Ankur","family":"Moitra","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4981-1643","authenticated-orcid":false,"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Scott Aaronson. 2022. My AI Safety Lecture for UT Effective Altruism. https:\/\/scottaaronson.blog\/?p=6823"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718309"},{"key":"e_1_3_2_1_3_1","unstructured":"Keller Blackwell and Mary Wootters. 2021. A note on the permuted puzzles toy conjecture. arXiv preprint arXiv:2108.07885."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"e_1_3_2_1_5_1","unstructured":"Elette Boyle Justin Holmgren Fermi Ma and Mor Weiss. 2021. On the security of doubly efficient PIR. Cryptology ePrint Archive."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36033-7_18"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70503-3_22"},{"key":"e_1_3_2_1_8_1","volume-title":"Kothari","author":"Buhai Rares-Darius","year":"2025","unstructured":"Rares-Darius Buhai, Jun-Ting Hsieh, Aayush Jain, and Pravesh K. Kothari. 2025. The Quasi-Polynomial Low-Degree Conjecture is False. arxiv:2505.17360. arxiv:2505.17360"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70503-3_23"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68391-6_10"},{"key":"e_1_3_2_1_11_1","volume-title":"Undetectable Watermarks for Language Models. In The Thirty Seventh Annual Conference on Learning Theory","volume":"1139","author":"Christ Miranda","year":"2024","unstructured":"Miranda Christ, Sam Gunn, and Or Zamir. 2024. Undetectable Watermarks for Language Models. In The Thirty Seventh Annual Conference on Learning Theory, June 30 - July 3, 2023, Edmonton, Canada, Shipra Agrawal and Aaron Roth (Eds.) (Proceedings of Machine Learning Research, Vol. 247). PMLR, 1125\u20131139. https:\/\/proceedings.mlr.press\/v247\/christ24a.html"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP61157.2025.00084"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718210"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Nico D\u00f6ttling Anne M\u00fcller and Mahesh Sreekumar Rajasree. 2025. Separating Pseudorandom Codes from Local Oracles. IACR Cryptol. ePrint Arch. 1020. https:\/\/eprint.iacr.org\/2025\/1020","DOI":"10.1007\/978-3-032-12290-2_8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.62056\/AHMPDKP10"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00093"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2506.01854"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.APPROX\/RANDOM.2025.54"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.52202\/079017-0652"},{"key":"e_1_3_2_1_21_1","volume-title":"An Undetectable Watermark for Generative Image Models. In The Thirteenth International Conference on Learning Representations, ICLR 2025","author":"Gunn Sam","year":"2025","unstructured":"Sam Gunn, Xuandong Zhao, and Dawn Song. 2025. An Undetectable Watermark for Generative Image Models. In The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025. OpenReview.net. https:\/\/openreview.net\/forum?id=jlhBFm7T2J"},{"key":"e_1_3_2_1_22_1","volume-title":"Statistical Inference and the Sum of Squares Method. Ph. D. Dissertation","author":"Hopkins Samuel B.","unstructured":"Samuel B. Hopkins. 2018. Statistical Inference and the Sum of Squares Method. Ph. D. Dissertation. Cornell University. Ithaca, NY. https:\/\/www.samuelbhopkins.com\/thesis.pdf Ph.D. dissertation"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2504.16359"},{"key":"e_1_3_2_1_24_1","volume-title":"International Conference on Machine Learning, ICML 2023","volume":"17084","author":"Kirchenbauer John","year":"2023","unstructured":"John Kirchenbauer, Jonas Geiping, Yuxin Wen, Jonathan Katz, Ian Miers, and Tom Goldstein. 2023. A Watermark for Large Language Models. In International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA, Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett (Eds.) (Proceedings of Machine Learning Research, Vol. 202). PMLR, 17061\u201317084. https:\/\/proceedings.mlr.press\/v202\/kirchenbauer23a.html"},{"key":"e_1_3_2_1_25_1","unstructured":"Rohith Kuditipudi John Thickstun Tatsunori Hashimoto and Percy Liang. 2024. Robust Distortion-free Watermarks for Language Models. Transactions on Machine Learning Research issn:2835-8856 https:\/\/openreview.net\/forum?id=FpaCL1MO2C"},{"key":"e_1_3_2_1_26_1","volume-title":"Bandeira","author":"Kunisky Dmitriy","year":"2019","unstructured":"Dmitriy Kunisky, Alexander S. Wein, and Afonso S. Bandeira. 2019. Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio. arXiv preprint arXiv:1907.11636."},{"key":"e_1_3_2_1_27_1","unstructured":"Huijia Lin Kameron Shahabi and Min Jae Song. 2026. Unforgeable Watermarks for Language Models via Robust Signatures. arXiv preprint arXiv:2602.15323."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2504.15026"},{"key":"e_1_3_2_1_29_1","volume-title":"Watermarks in the Sand: Impossibility of Strong Watermarking for Language Models. In Forty-first International Conference on Machine Learning, ICML 2024","author":"Zhang Hanlin","year":"2024","unstructured":"Hanlin Zhang, Benjamin L. Edelman, Danilo Francati, Daniele Venturi, Giuseppe Ateniese, and Boaz Barak. 2024. Watermarks in the Sand: Impossibility of Strong Watermarking for Language Models. In Forty-first International Conference on Machine Learning, ICML 2024, Vienna, Austria, July 21-27, 2024. OpenReview.net. https:\/\/openreview.net\/forum?id=bM2s12t4hR"},{"key":"e_1_3_2_1_30_1","volume-title":"Provable Robust Watermarking for AI-Generated Text. In The Twelfth International Conference on Learning Representations, ICLR 2024","author":"Zhao Xuandong","year":"2024","unstructured":"Xuandong Zhao, Prabhanjan Vijendra Ananth, Lei Li, and Yu-Xiang Wang. 2024. Provable Robust Watermarking for AI-Generated Text. In The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria, May 7-11, 2024. OpenReview.net. https:\/\/openreview.net\/forum?id=SsmT8aO45L"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP61157.2025.00178"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:55:40Z","timestamp":1781027740000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":31,"alternative-id":["10.1145\/3798129.3800916","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800916","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}