{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:58:19Z","timestamp":1781218699567,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":56,"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"}],"funder":[{"name":"National Science Foundation","award":["DGE-2039655"],"award-info":[{"award-number":["DGE-2039655"]}]},{"name":"Israel Science Foundation","award":["2774\/20"],"award-info":[{"award-number":["2774\/20"]}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["3527\/24"],"award-info":[{"award-number":["3527\/24"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Israel Science Foundation \u2013 National Natural Science Foundation of China","award":["3127\/23"],"award-info":[{"award-number":["3127\/23"]}]},{"name":"U.S.-Israel Binational Science Foundation","award":["2022370"],"award-info":[{"award-number":["2022370"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800890","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1836-1846","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Shuffling Is Universal: Statistical Additive Randomized Encodings for All Functions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8361-6035","authenticated-orcid":false,"given":"Nir","family":"Bitansky","sequence":"first","affiliation":[{"name":"New York University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6003-7134","authenticated-orcid":false,"given":"Saroja","family":"Erabelli","sequence":"additional","affiliation":[{"name":"New York University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4410-785X","authenticated-orcid":false,"given":"Rachit","family":"Garg","sequence":"additional","affiliation":[{"name":"New York University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4096-6305","authenticated-orcid":false,"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"},{"name":"AWS, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17656-3_14"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1272044"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446950"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-016-9244-6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.142"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2020.86"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_22"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Borja Balle James Bell Adri\u00e0 Gasc\u00f3n and Kobbi Nissim. 2020. Private Summation in the Multi-Message Shuffle Model. In CCS. https:\/\/doi.org\/10.1145\/3372297. 3417242 10.1145\/3372297.3417242","DOI":"10.1145\/3372297"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_18"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00145-010-"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_22"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64378-2_24"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382279"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_17"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68397-8_4"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-022-09428-0"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132769"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_31"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2203.03761"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.17760\/d20409473"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_13"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_21"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195408"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1996.0147"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03807-6_5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_16"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670391"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Badih Ghazi Pasin Manurangsi Rasmus Pagh and Ameya Velingker. 2020. Private Aggregation from Fewer Anonymous Messages. In EUROCRYPT.","DOI":"10.1007\/978-3-030-45724-2_27"},{"key":"e_1_3_2_1_36_1","volume-title":"Suhas Diggavi, and Ananda Theertha Suresh.","author":"Girgis Antonious M.","year":"2021","unstructured":"Antonious M. Girgis, Deepesh Data, Suhas Diggavi, and Ananda Theertha Suresh. 2021. On the R\u00e9nyi Differential Privacy of the Shuffle Model. arXiv preprint arXiv:2105.05180 (2021). https:\/\/arxiv.org\/abs\/2105.05180"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3335741"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","unstructured":"Shai Halevi Yuval Ishai Abhishek Jain Ilan Komargodski Amit Sahai and Eylon Yogev. 2017. Non-Interactive Multiparty Computation without Correlated Randomness. IACR Cryptol. ePrint Arch. (2017) 871. https:\/\/doi.org\/10.1007\/978- 3-319-70700-6_7 10.1007\/978-3-319-70700-6_7","DOI":"10.1007\/978-"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03810-6_10"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38557-5_7"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_22"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-95764-2_6"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-61499-169-4-222"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITC.2024.6"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892118"},{"key":"e_1_3_2_1_47_1","volume-title":"31st Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011, Proceedings (Lecture Notes in Computer Science","volume":"684","author":"Ishai Yuval","year":"2011","unstructured":"Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, and J\u00fcrg Wullschleger. 2011. Constant-Rate Oblivious Transfer from Noisy Channels. In Advances in Cryptology -CRYPTO 2011, 31st Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011, Proceedings (Lecture Notes in Computer Science, Vol. 6841). Springer, 667-684."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.25"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.56"},{"key":"e_1_3_2_1_50_1","first-page":"5201","volume-title":"Proceedings of the 38th International Conference on Machine Learning, ICML 2021","author":"Kairouz Peter","year":"2021","unstructured":"Peter Kairouz, Ziyu Liu, and Thomas Steinke. 2021. The Distributed Discrete Gaussian Mechanism for Federated Learning with Secure Aggregation. In Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event (Proceedings of Machine Learning Research), Marina Meila and Tong Zhang (Eds.). PMLR, 5201-5212. http:\/\/proceedings.mlr.press\/ v139\/kairouz21a.html"},{"key":"e_1_3_2_1_51_1","unstructured":"Antti Koskela Antti Honkela et al. 2021. Tight Accounting in the Shuffle Model of Differential Privacy. arXiv preprint arXiv:2106.00477 (2021). https:\/\/arxiv.org\/ abs\/2106.00477"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64381-2_8"},{"key":"e_1_3_2_1_53_1","volume-title":"27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings (Lecture Notes in Computer Science","volume":"149","author":"Maurer Ueli M.","year":"2007","unstructured":"Ueli M. Maurer, Krzyszf Z. Pietrzak, and Renato Renner. 2007. Indistinguishability Amplification. In Advances in Cryptology -CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings (Lecture Notes in Computer Science, Vol. 4622), Alfred Menezes (Ed.). Springer-Verlag, 130-149."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053419"},{"key":"e_1_3_2_1_55_1","volume-title":"Applying the Shuffle Model of Differential Privacy to Vector Aggregation. arXiv preprint arXiv:2112.05464","author":"Scott Mary","year":"2022","unstructured":"Mary Scott, Graham Cormode, and Carsten Maple. 2022. Applying the Shuffle Model of Differential Privacy to Vector Aggregation. arXiv preprint arXiv:2112.05464 (2022). https:\/\/arxiv.org\/abs\/2112.05464"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"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.3800890","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:34:28Z","timestamp":1781217268000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":56,"alternative-id":["10.1145\/3798129.3800890","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800890","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"}}]}}