{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:44:54Z","timestamp":1781077494680,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","funder":[{"name":"NSF","award":[""],"award-info":[{"award-number":[""]}]},{"name":"Google","award":[""],"award-info":[{"award-number":[""]}]},{"name":"Amazon Web Services","award":[""],"award-info":[{"award-number":[""]}]},{"name":"Simons Foundation","award":[""],"award-info":[{"award-number":[""]}]},{"name":"Saudia Arabia Cultural Mission","award":[""],"award-info":[{"award-number":[""]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718309","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T23:34:42Z","timestamp":1750030482000},"page":"1638-1647","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Ideal Pseudorandom Codes"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7062-8213","authenticated-orcid":false,"given":"Omar","family":"Alrabiah","sequence":"first","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5387-5730","authenticated-orcid":false,"given":"Prabhanjan","family":"Ananth","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, Santa Barbara, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9914-6391","authenticated-orcid":false,"given":"Miranda","family":"Christ","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1013-6318","authenticated-orcid":false,"given":"Yevgeniy","family":"Dodis","sequence":"additional","affiliation":[{"name":"New York University, 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"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68391-6_10"},{"key":"e_1_3_2_1_2_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_3_1","unstructured":"Aloni Cohen Alexander Hoover and Gabe Schoenbach. 2024. Watermarking Language Models for Many Adaptive Users. IACR Cryptol. ePrint Arch. 759. https:\/\/eprint.iacr.org\/2024\/759"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Eiichiro Fujisaki and Tatsuaki Okamoto. 1999. Secure integration of asymmetric and symmetric encryption schemes. In Annual international cryptology conference. 537\u2013554.","DOI":"10.1007\/3-540-48405-1_34"},{"key":"e_1_3_2_1_5_1","unstructured":"Surendra Ghentiyala and Venkatesan Guruswami. 2024. New constructions of pseudorandom codes. IACR Cryptol. ePrint Arch. 1425. https:\/\/eprint.iacr.org\/2024\/1425"},{"key":"e_1_3_2_1_6_1","unstructured":"Noah Golowich and Ankur Moitra. 2024. Edit Distance Robust Watermarks for Language Models. IACR Cryptol. ePrint Arch. 898. https:\/\/eprint.iacr.org\/2024\/898"},{"key":"e_1_3_2_1_7_1","unstructured":"Sam Gunn Xuandong Zhao and Dawn Song. 2024. An undetectable watermark for generative image models. Cryptology ePrint Archive Paper 2024\/1597. https:\/\/eprint.iacr.org\/2024\/1597"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_6"},{"key":"e_1_3_2_1_9_1","volume-title":"Watermark Stealing in Large Language Models. In Forty-first International Conference on Machine Learning, ICML 2024","author":"Jovanovic Nikola","year":"2024","unstructured":"Nikola Jovanovic, Robin Staab, and Martin T. Vechev. 2024. Watermark Stealing in Large 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=Wp054bnPq9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484550"},{"key":"e_1_3_2_1_11_1","first-page":"2024","volume-title":"Trans. Mach. Learn. Res.","author":"Kuditipudi Rohith","year":"2024","unstructured":"Rohith Kuditipudi, John Thickstun, Tatsunori Hashimoto, and Percy Liang. 2024. Robust Distortion-free Watermarks for Language Models. Trans. Mach. Learn. Res., 2024 (2024), https:\/\/openreview.net\/forum?id=FpaCL1MO2C"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2402.16187"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_20"},{"key":"e_1_3_2_1_14_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_15_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1115"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","location":"Prague Czechia","acronym":"STOC '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:50:24Z","timestamp":1750693824000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":15,"alternative-id":["10.1145\/3717823.3718309","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718309","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}