{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:54:10Z","timestamp":1781078050370,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":65,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ISF-NSFC","award":["3127\/23"],"award-info":[{"award-number":["3127\/23"]}]},{"DOI":"10.13039\/501100006374","name":"European Commission","doi-asserted-by":"publisher","award":["742754"],"award-info":[{"award-number":["742754"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2022370"],"award-info":[{"award-number":["2022370"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2774\/20"],"award-info":[{"award-number":["2774\/20"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670391","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"4122-4136","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Computationally Secure Aggregation and Private Information Retrieval in the Shuffle Model"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1807-8311","authenticated-orcid":false,"given":"Adri\u00e0","family":"Gasc\u00f3n","sequence":"first","affiliation":[{"name":"Google, New York, NY, 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"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4268-4681","authenticated-orcid":false,"given":"Mahimna","family":"Kelkar","sequence":"additional","affiliation":[{"name":"Cornell University, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1088-9328","authenticated-orcid":false,"given":"Baiyu","family":"Li","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3183-9402","authenticated-orcid":false,"given":"Yiping","family":"Ma","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1744-4025","authenticated-orcid":false,"given":"Mariana","family":"Raykova","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Prio: Privacy Preserving Aggregate Statistics via Boolean Shares. In SCN. 516--539.","author":"Addanki Surya","year":"2022","unstructured":"Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, and Antigoni Polychroniadou. 2022. Prio: Privacy Preserving Aggregate Statistics via Boolean Shares. In SCN. 516--539."},{"key":"e_1_3_2_1_2_1","unstructured":"Apple. 2021. iCloud Private Relay Overview. https:\/\/www.apple.com\/icloud\/docs\/iCloud_Private_Relay_Overview_Dec2021.pdf."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--74143--5_6"},{"key":"e_1_3_2_1_4_1","unstructured":"Daniel Augot Matthieu Finiasz and Nicolas Sendrier. 2003. A Fast Provably Secure Cryptographic Hash Function. Cryptology ePrint Archive Paper 2003\/230. https:\/\/eprint.iacr.org\/2003\/230 https:\/\/eprint.iacr.org\/2003\/230."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--26951--7_22"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417242"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--44598--6_4"},{"key":"e_1_3_2_1_8_1","volume-title":"ACORN: Input Validation for Secure Aggregation. In 32nd USENIX Security Symposium (USENIX Security 23)","author":"Bell James","year":"2023","unstructured":"James Bell, Adri\u00e0 Gasc\u00f3n, Tancr\u00e8de Lepoint, Baiyu Li, Sarah Meiklejohn, Mariana Raykova, and Cathie Yun. 2023. ACORN: Input Validation for Secure Aggregation. In 32nd USENIX Security Symposium (USENIX Security 23)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"James Henry Bell Kallista A. Bonawitz Adri\u00e0 Gasc\u00f3n Tancr\u00e8de Lepoint and Mariana Raykova. 2020. Secure Single-Server Aggregation with (Poly)Logarithmic Overhead. In CCS. ACM 1253--1269.","DOI":"10.1145\/3372297.3417885"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132769"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--48329--2_24"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Kallista A. Bonawitz Vladimir Ivanov Ben Kreuter Antonio Marcedone H. Brendan McMahan Sarvar Patel Daniel Ramage Aaron Segal and Karn Seth. 2017. Practical Secure Aggregation for Privacy-Preserving Machine Learning. In CCS. ACM 1175--1191.","DOI":"10.1145\/3133956.3133982"},{"key":"e_1_3_2_1_14_1","volume-title":"Lightweight Techniques for Private Heavy Hitters. In 2021 IEEE Symposium on Security and Privacy (SP).","author":"Boneh Dan","year":"2021","unstructured":"Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, and Yuval Ishai. 2021. Lightweight Techniques for Private Heavy Hitters. In 2021 IEEE Symposium on Security and Privacy (SP)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--30589--4_14"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_11"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00206326"},{"key":"e_1_3_2_1_20_1","volume-title":"Differential Privacy in the Shuffle Model: A Survey of Separations. CoRR","author":"Cheu Albert","year":"1839","unstructured":"Albert Cheu. 2021. Differential Privacy in the Shuffle Model: A Survey of Separations. CoRR, Vol. abs\/2107.11839 (2021). showeprint[arXiv]2107.11839 https:\/\/arxiv.org\/abs\/2107.11839"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--17653--2_13"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833614"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"e_1_3_2_1_24_1","unstructured":"Google Chrome. 2023. IP Protection. https:\/\/github.com\/GoogleChrome\/ip-protection."},{"key":"e_1_3_2_1_25_1","unstructured":"Cloudflare. 2022. Privacy Gateway. https:\/\/blog.cloudflare.com\/building-privacy-into-internet-standards-and-how-to-make-your-app-more-private-today."},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation (NSDI'17)","author":"Corrigan-Gibbs Henry","year":"2017","unstructured":"Henry Corrigan-Gibbs and Dan Boneh. 2017. Prio: private, robust, and scalable computation of aggregate statistics. In Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation (NSDI'17)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.56553\/POPETS-2023-0022"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory","author":"Dumer Ilya","year":"1991","unstructured":"Ilya Dumer. 1991. On minimum distance decoding of linear codes. In Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory. Moscow, 50--52."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.151"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--97121--2_5"},{"key":"e_1_3_2_1_32_1","unstructured":"Andre Esser Javier Verbel Floyd Zweydinger and Emanuele Bellini. 2023. textttCryptographicEstimators: a Software Library for Cryptographic Hardness Estimation. Cryptology ePrint Archive Paper 2023\/589. https:\/\/eprint.iacr.org\/2023\/589 https:\/\/eprint.iacr.org\/2023\/589."},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS '02)","author":"Michael","unstructured":"Michael J. Freedman and Robert Morris. 2002. Tarzan: a peer-to-peer anonymizing network layer. In Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS '02)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Adri\u00e0 Gasc\u00f3n Yuval Ishai Mahimna Kelkar Baiyu Li Yiping Ma and Mariana Raykova. 2024. Computationally Secure Aggregation and Private Information Retrieval in the Shuffle Model. Cryptology ePrint Archive Paper 2024\/870. https:\/\/eprint.iacr.org\/2024\/870 https:\/\/eprint.iacr.org\/2024\/870.","DOI":"10.1145\/3658644.3670391"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--45724--2_27"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/293411.293443"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--24676--3_27"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/525423.830456"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--38557--5_7"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-022-09423--5"},{"key":"e_1_3_2_1_41_1","volume-title":"One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval. In 32nd USENIX Security Symposium, USENIX Security 2023","author":"Henzinger Alexandra","year":"2023","unstructured":"Alexandra Henzinger, Matthew M. Hong, Henry Corrigan-Gibbs, Sarah Meiklejohn, and Vinod Vaikuntanathan. 2023. One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval. In 32nd USENIX Security Symposium, USENIX Security 2023, Anaheim, CA, USA, August 9--11, 2023,, Joseph A. Calandrino and Carmela Troncoso (Eds.)."},{"key":"e_1_3_2_1_42_1","volume-title":"Information-Theoretic Single-Server PIR in the Shuffle Model. In ITC 2024","author":"Ishai Yuval","year":"2024","unstructured":"Yuval Ishai, Mahimna Kelkar, Daniel Lee, and Yiping Ma. 2024. Information-Theoretic Single-Server PIR in the Shuffle Model. In ITC 2024. https:\/\/eprint.iacr.org\/2024\/930."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.25"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010--9061--2"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646125"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--45961--8_25"},{"key":"e_1_3_2_1_47_1","volume-title":"Hintless Single-Server Private Information Retrieval. In CRYPTO 2024","author":"Li Baiyu","year":"2024","unstructured":"Baiyu Li, Daniele Micciancio, Mariana Raykova, and Mark Schultz-Wu. 2024. Hintless Single-Server Private Information Retrieval. In CRYPTO 2024. https:\/\/eprint.iacr.org\/2023\/1733."},{"key":"e_1_3_2_1_48_1","volume-title":"LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking. In ASIACRYPT (1) (Lecture Notes in Computer Science","author":"Li Hanjun","year":"2023","unstructured":"Hanjun Li, Huijia Lin, Antigoni Polychroniadou, and Stefano Tessaro. 2023. LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking. In ASIACRYPT (1) (Lecture Notes in Computer Science, Vol. 14438). Springer, 302--334."},{"key":"e_1_3_2_1_49_1","unstructured":"Hanlin Liu Xiao Wang Kang Yang and Yu Yu. 2022. The Hardness of LPN over Any Integer Ring and Field for PCG Applications. IACR Cryptol. ePrint Arch. (2022) 712."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179434"},{"key":"e_1_3_2_1_51_1","unstructured":"Robert J. McEliece. 1978. A public key cryptosystem based on algebraic coding theory. In The Deep Space Network Progress Report. https:\/\/api.semanticscholar.org\/CorpusID:56502909"},{"key":"e_1_3_2_1_52_1","volume-title":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017, 20--22","author":"McMahan Brendan","year":"2017","unstructured":"Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Ag\u00fcera y Arcas. 2017. Communication-Efficient Learning of Deep Networks from Decentralized Data. In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017, 20--22 April 2017, Fort Lauderdale, FL, USA,, Aarti Singh and Xiaojin (Jerry) Zhu (Eds.)."},{"key":"e_1_3_2_1_53_1","volume-title":"2022 IEEE Symposium on Security and Privacy (SP).","author":"Menon Samir Jordan","unstructured":"Samir Jordan Menon and David J. Wu. 2022. SPIRAL: Fast, High-Rate Single-Server PIR via FHE Composition. In 2022 IEEE Symposium on Security and Privacy (SP)."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--22792--9_26"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--78381--9_1"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502000"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243821"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27660-6_9"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_4"},{"key":"e_1_3_2_1_62_1","volume-title":"Coding Theory and Applications (Lecture Notes in Computer Science","volume":"113","author":"Stern Jacques","year":"1988","unstructured":"Jacques Stern. 1988. A method for finding codewords of small weight. In Coding Theory and Applications (Lecture Notes in Computer Science, Vol. 388). Springer, 106--113."},{"key":"e_1_3_2_1_63_1","volume-title":"PQCrypto (Lecture Notes in Computer Science","volume":"161","author":"Torres Rodolfo Canto","year":"2016","unstructured":"Rodolfo Canto Torres and Nicolas Sendrier. 2016. Analysis of Information Set Decoding for a Sub-linear Error Weight. In PQCrypto (Lecture Notes in Computer Science, Vol. 9606). Springer, 144--161."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560651"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP54263.2024.00055"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670391","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:01:15Z","timestamp":1755842475000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":65,"alternative-id":["10.1145\/3658644.3670391","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670391","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}