{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:40:29Z","timestamp":1755823229847,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623215","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"2292-2305","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Amplification by Shuffling without Shuffling"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-8726-2803","authenticated-orcid":false,"given":"Borja","family":"Balle","sequence":"first","affiliation":[{"name":"Google Deepmind, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4493-4297","authenticated-orcid":false,"given":"James","family":"Bell","sequence":"additional","affiliation":[{"name":"Google, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1807-8311","authenticated-orcid":false,"given":"Adri\u00e0","family":"Gasc\u00f3n","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2207.05047"},{"key":"e_1_3_2_1_2_1","unstructured":"Bar Alon Moni Naor Eran Omri and Uri Stemmer. 2022. MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. IACR Cryptol. ePrint Arch. (2022) 902."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITC.2020.1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1"},{"key":"e_1_3_2_1_5_1","unstructured":"Borja Balle Gilles Barthe and Marco Gaboardi. 2018. Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergences. In NeurIPS."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_22"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417242"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Borja Balle James Bell Adri\u00e0 Gasc\u00f3n and Kobbi Nissim. 2020. Private Summation in the Multi-Message Shuffle Model. In CCS.","DOI":"10.1145\/3372297.3417242"},{"key":"e_1_3_2_1_10_1","volume-title":"Om Dipakbhai Thakkar, and Abhradeep Thakurta","author":"Balle Borja","year":"2020","unstructured":"Borja Balle, Peter Kairouz, Brendan McMahan, Om Dipakbhai Thakkar, and Abhradeep Thakurta. 2020. Privacy Amplification via Random Check-Ins. In NeurIPS."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"e_1_3_2_1_12_1","volume-title":"ACORN: Input Validation for Secure Aggregation. IACR Cryptol. ePrint Arch.","author":"Bell James","year":"2022","unstructured":"James Bell, Adri\u00e0 Gasc\u00f3n, Tancr\u00e8de Lepoint, Baiyu Li, Sarah Meiklejohn, Mariana Raykova, and Cathie Yun. 2022. ACORN: Input Validation for Secure Aggregation. IACR Cryptol. ePrint Arch. (2022), 1461."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417885"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132769"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"e_1_3_2_1_16_1","unstructured":"Benedikt B\u00fcnz Yuncong Hu Shin'ichiro Matsuo and Elaine Shi. 2021. Non-Interactive Differentially Anonymous Router. IACR Cryptol. ePrint Arch. (2021) 1242. https:\/\/eprint.iacr.org\/2021\/1242"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.17760\/D20409473"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-"},{"key":"e_1_3_2_1_20_1","volume-title":"Differentially Private Histograms in the Shuffle Model from Fake Users. CoRR abs\/2104.02739","author":"Cheu Albert","year":"2021","unstructured":"Albert Cheu and Maxim Zhilyaev. 2021. Differentially Private Histograms in the Shuffle Model from Fake Users. CoRR abs\/2104.02739 (2021). arXiv:2104.02739 https:\/\/arxiv.org\/abs\/2104.02739"},{"key":"e_1_3_2_1_21_1","volume-title":"Analyze Privacy Revisited: Formalizations and Empirical Evaluation. CoRR abs\/2001.03618","author":"Erlingsson \u00dalfar","year":"2020","unstructured":"\u00dalfar Erlingsson, Vitaly Feldman, Ilya Mironov, Ananth Raghunathan, Shuang Song, Kunal Talwar, and Abhradeep Thakurta. 2020. Encode, Shuffle, Analyze Privacy Revisited: Formalizations and Empirical Evaluation. CoRR abs\/2001.03618 (2020)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.151"},{"volume-title":"A Practical Scheme for Non-interactive Verifiable Secret Sharing","author":"Feldman Paul","key":"e_1_3_2_1_23_1","unstructured":"Paul Feldman. 1987. A Practical Scheme for Non-interactive Verifiable Secret Sharing. In FOCS. IEEE Computer Society, 427--437."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00096"},{"key":"e_1_3_2_1_25_1","volume-title":"Stronger Privacy Amplification by Shuffling for R\u00e9nyi and Approximate Differential Privacy. CoRR abs\/2208.04591","author":"Feldman Vitaly","year":"2022","unstructured":"Vitaly Feldman, Audra McMillan, and Kunal Talwar. 2022. Stronger Privacy Amplification by Shuffling for R\u00e9nyi and Approximate Differential Privacy. CoRR abs\/2208.04591 (2022)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITC.2020.15"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77883-5_16"},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18--24","volume":"3701","author":"Ghazi Badih","year":"2021","unstructured":"Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, and Amer Sinha. 2021. Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message. In Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18--24 July 2021, Virtual Event (Proceedings of Machine Learning Research, Vol. 139), Marina Meila and Tong Zhang (Eds.). PMLR, 3692--3701. http:\/\/proceedings.mlr.press\/v139\/ghazi21a.html"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_27"},{"key":"e_1_3_2_1_30_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"},{"volume-title":"The Foundations of Cryptography - Volume 2: Basic Appli-cations","author":"Goldreich Oded","key":"e_1_3_2_1_31_1","unstructured":"Oded Goldreich. 2004. The Foundations of Cryptography - Volume 2: Basic Appli-cations. Cambridge University Press."},{"key":"e_1_3_2_1_32_1","volume-title":"Goodrich and Michael Mitzenmacher","author":"Michael","year":"2011","unstructured":"Michael T. Goodrich and Michael Mitzenmacher. 2011. Invertible bloom lookup tables. In Allerton. IEEE, 792--799."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-09234-"},{"key":"e_1_3_2_1_34_1","unstructured":"Yue Guo Antigoni Polychroniadou Elaine Shi David Byrd and Tucker Balch. 2022. MicroFedML: Privacy Preserving Federated Learning for Small Weights. IACR Cryptol. ePrint Arch. (2022) 714."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20131"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.25"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2685505"},{"key":"e_1_3_2_1_39_1","volume-title":"Numerical Ac- counting in the Shuffle Model of Differential Privacy. Transactions on Machine Learning Research","author":"Koskela Antti","year":"2023","unstructured":"Antti Koskela, Mikko A. Heikkil\u00e4, and Antti Honkela. 2023. Numerical Ac- counting in the Shuffle Model of Differential Privacy. Transactions on Machine Learning Research (2023). https:\/\/openreview.net\/forum?id=11osftjEbF Featured Certification."},{"volume-title":"Tutorials on the Foundations of Cryptography","author":"Lindell Yehuda","key":"e_1_3_2_1_40_1","unstructured":"Yehuda Lindell. 2017. How to Simulate It - A Tutorial on the Simulation Proof Technique. In Tutorials on the Foundations of Cryptography. Springer International Publishing, 277--346."},{"key":"e_1_3_2_1_41_1","unstructured":"Isis Agora Lovecruft and Henry de Valence. 2023. Efficient Bulletproofs in Rust. https:\/\/github.com\/dalek-cryptography\/curve25519-dalek"},{"key":"e_1_3_2_1_42_1","unstructured":"Yiping Ma Jess Woods Sebastian Angel Antigoni Polychroniadou and Tal Rabin. 2023. Flamingo: Multi-Round Single-Server Secure Aggregation with Applications to Private Federated Learning. Cryptology ePrint Archive Paper 2023\/486. https:\/\/eprint.iacr.org\/2023\/486 https:\/\/eprint.iacr.org\/2023\/486."},{"volume-title":"Efficient Private Statistics with Succinct Sketches","author":"Melis Luca","key":"e_1_3_2_1_43_1","unstructured":"Luca Melis, George Danezis, and Emiliano De Cristofaro. 2016. Efficient Private Statistics with Succinct Sketches. In NDSS. The Internet Society."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25258-2_32"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209022"},{"key":"e_1_3_2_1_46_1","volume-title":"Richard Chow, and Dawn Song.","author":"Shi Elaine","year":"2011","unstructured":"Elaine Shi, T.-H. Hubert Chan, Eleanor Gilbert Rieffel, Richard Chow, and Dawn Song. 2011. Privacy-Preserving Aggregation of Time-Series Data. In NDSS. The Internet Society."},{"key":"e_1_3_2_1_47_1","unstructured":"Mingxun Zhou Elaine Shi T.-H. Hubert Chan and Shir Maimon. 2022. A Theory of Composition for Differential Obliviousness. IACR Cryptol. ePrint Arch. (2022) 1357. https:\/\/eprint.iacr.org\/2022\/1357"}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Copenhagen Denmark","acronym":"CCS '23"},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623215","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:46:00Z","timestamp":1755740760000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":47,"alternative-id":["10.1145\/3576915.3623215","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623215","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}