{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:19:06Z","timestamp":1778807946898,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":79,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3559383","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"307-321","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Distributed, Private, Sparse Histograms in the Two-Server Model"],"prefix":"10.1145","author":[{"given":"James","family":"Bell","sequence":"first","affiliation":[{"name":"Google, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adri\u00e0","family":"Gasc\u00f3n","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Badih","family":"Ghazi","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Kumar","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pasin","family":"Manurangsi","sequence":"additional","affiliation":[{"name":"Google, Bangkok, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariana","family":"Raykova","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phillipp","family":"Schoppmann","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Mikl\u00f3s Ajtai J\u00e1nos Koml\u00f3s and Endre Szemer\u00e9 di. 1983. An O(n log n) Sorting Network. In STOC. 1--9.  Mikl\u00f3s Ajtai J\u00e1nos Koml\u00f3s and Endre Szemer\u00e9 di. 1983. An O(n log n) Sorting Network. In STOC. 1--9.","DOI":"10.1007\/BF02579338"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.09.001"},{"key":"e_1_3_2_1_3_1","volume-title":"Smart, and Tim Wood","author":"Aly Abdelrahaman","year":"2019","unstructured":"Abdelrahaman Aly , Emmanuela Orsini , Dragos Rotaru , Nigel P. Smart, and Tim Wood . 2019 . Zaphod : Efficiently Combining LSSS and Garbled Circuits in SCALE. In WAHC. Abdelrahaman Aly, Emmanuela Orsini, Dragos Rotaru, Nigel P. Smart, and Tim Wood. 2019. Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE. In WAHC."},{"key":"e_1_3_2_1_4_1","unstructured":"Apple and Google. 2021. Exposure Notifications Private Analytics. https:\/\/github.com\/google\/exposure-notifications-android\/blob\/master\/doc\/ENPA.pdf.  Apple and Google. 2021. Exposure Notifications Private Analytics. https:\/\/github.com\/google\/exposure-notifications-android\/blob\/master\/doc\/ENPA.pdf."},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"Separating Local & Shuffled Differential Privacy via Histograms","volume":"1","author":"Balcer Victor","year":"2020","unstructured":"Victor Balcer and Albert Cheu . 2020 . Separating Local & Shuffled Differential Privacy via Histograms . In ITC. 1 : 1 -- 1 :14. Victor Balcer and Albert Cheu. 2020. Separating Local & Shuffled Differential Privacy via Histograms. In ITC. 1:1--1:14.","journal-title":"ITC."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Borja Balle James Bell Adri\u00e0 Gasc\u00f3n and Kobbi Nissim. 2019. The Privacy Blanket of the Shuffle Model. In CRYPTO. 638--667.  Borja Balle James Bell Adri\u00e0 Gasc\u00f3n and Kobbi Nissim. 2019. The Privacy Blanket of the Shuffle Model. In CRYPTO. 638--667.","DOI":"10.1007\/978-3-030-26951-7_22"},{"key":"e_1_3_2_1_7_1","volume-title":"Sorting Networks and Their Applications. In AFIPS Spring Joint Computing Conference. 307--314","author":"Batcher Kenneth E.","year":"1968","unstructured":"Kenneth E. Batcher . 1968 . Sorting Networks and Their Applications. In AFIPS Spring Joint Computing Conference. 307--314 . Kenneth E. Batcher. 1968. Sorting Networks and Their Applications. In AFIPS Spring Joint Computing Conference. 307--314."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Amos Beimel Kobbi Nissim and Eran Omri. 2008. Distributed private data analysis: Simultaneously solving how and what. In CRYPTO. 451--468.  Amos Beimel Kobbi Nissim and Eran Omri. 2008. Distributed private data analysis: Simultaneously solving how and what. In CRYPTO. 451--468.","DOI":"10.1007\/978-3-540-85174-5_25"},{"key":"e_1_3_2_1_9_1","volume-title":"private, sparse histograms in the two-server model. Cryptology ePrint Archive","author":"Bell James","year":"2022","unstructured":"James Bell , Adria Gascon , Badih Ghazi , Ravi Kumar , Pasin Manurangsi , Mariana Raykova , and Phillipp Schoppmann . 2022. Distributed , private, sparse histograms in the two-server model. Cryptology ePrint Archive ( 2022 ). https:\/\/eprint.iacr.org\/2022\/920 James Bell, Adria Gascon, Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Mariana Raykova, and Phillipp Schoppmann. 2022. Distributed, private, sparse histograms in the two-server model. Cryptology ePrint Archive (2022). https:\/\/eprint.iacr.org\/2022\/920"},{"key":"e_1_3_2_1_10_1","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.  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."},{"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":"crossref","unstructured":"Jeremiah Blocki Anupam Datta and Joseph Bonneau. 2016. Differentially Private Password Frequency Lists. In NDSS.  Jeremiah Blocki Anupam Datta and Joseph Bonneau. 2016. Differentially Private Password Frequency Lists. In NDSS.","DOI":"10.14722\/ndss.2016.23328"},{"key":"e_1_3_2_1_13_1","volume-title":"Sander Siim, and Meril Vaht.","author":"Bogdanov Dan","year":"2016","unstructured":"Dan Bogdanov , Marko J oemets , Sander Siim, and Meril Vaht. 2016 . Privacy-preserving tax fraud detection in the cloud with realistic data volumes. Cybernetica Research, Report , https:\/\/cyber.ee\/research\/reports\/T-4-24-Privacy-preserving-tax-fraud-detection-in-the-cloud-with-realistic-data-volumes.pdf. Dan Bogdanov, Marko J oemets, Sander Siim, and Meril Vaht. 2016. Privacy-preserving tax fraud detection in the cloud with realistic data volumes. Cybernetica Research, Report, https:\/\/cyber.ee\/research\/reports\/T-4-24-Privacy-preserving-tax-fraud-detection-in-the-cloud-with-realistic-data-volumes.pdf."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Jonas B\u00f6hler and Florian Kerschbaum. 2021. Secure Multi-party Computation of Differentially Private Heavy Hitters. In CCS. 2361--2377.  Jonas B\u00f6hler and Florian Kerschbaum. 2021. Secure Multi-party Computation of Differentially Private Heavy Hitters. In CCS. 2361--2377.","DOI":"10.1145\/3460120.3484557"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Keith 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.  Keith 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.","DOI":"10.1145\/3133956.3133982"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh Elette Boyle Henry Corrigan-Gibbs Niv Gilboa and Yuval Ishai. 2021. Lightweight Techniques for Private Heavy Hitters. In SP. 762--776.  Dan Boneh Elette Boyle Henry Corrigan-Gibbs Niv Gilboa and Yuval Ishai. 2021. Lightweight Techniques for Private Heavy Hitters. In SP. 762--776.","DOI":"10.1109\/SP40001.2021.00048"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa and Yuval Ishai. 2016. Function Secret Sharing: Improvements and Extensions. In CCS. 1292--1303.  Elette Boyle Niv Gilboa and Yuval Ishai. 2016. Function Secret Sharing: Improvements and Extensions. In CCS. 1292--1303.","DOI":"10.1145\/2976749.2978429"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490390"},{"key":"e_1_3_2_1_19_1","volume-title":"JMLR","volume":"20","author":"Bun Mark","year":"2019","unstructured":"Mark Bun , Kobbi Nissim , and Uri Stemmer . 2019 . Simultaneous Private Learning of Multiple Concepts . JMLR , Vol. 20 (2019), 94:1--94:34. Mark Bun, Kobbi Nissim, and Uri Stemmer. 2019. Simultaneous Private Learning of Multiple Concepts. JMLR, Vol. 20 (2019), 94:1--94:34."},{"key":"e_1_3_2_1_20_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. In SP.","author":"B\u00fcnz Benedikt","year":"2018","unstructured":"Benedikt B\u00fcnz , Jonathan Bootle , Dan Boneh , Andrew Poelstra , Pieter Wuille , and Greg Maxwell . 2018 . Bulletproofs: Short Proofs for Confidential Transactions and More. In SP. Benedikt B\u00fcnz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Greg Maxwell. 2018. Bulletproofs: Short Proofs for Confidential Transactions and More. In SP."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"T.-H. Hubert Chan Elaine Shi and Dawn Song. 2012. Optimal Lower Bound for Differentially Private Multi-party Aggregation. In ESA. 277--288.  T.-H. Hubert Chan Elaine Shi and Dawn Song. 2012. Optimal Lower Bound for Differentially Private Multi-party Aggregation. In ESA. 277--288.","DOI":"10.1007\/978-3-642-33090-2_25"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Panagiotis Chatzigiannis Konstantinos Chalkias and Valeria Nikolaenko. 2021. Homomorphic decryption in blockchains via compressed discrete-log lookup tables. In DPM\/CBT@ESORICS. 328--339.  Panagiotis Chatzigiannis Konstantinos Chalkias and Valeria Nikolaenko. 2021. Homomorphic decryption in blockchains via compressed discrete-log lookup tables. In DPM\/CBT@ESORICS. 328--339.","DOI":"10.1007\/978-3-030-93944-1_23"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Albert Cheu Adam D. Smith Jonathan R. Ullman David Zeber and Maxim Zhilyaev. 2019. Distributed Differential Privacy via Shuffling. In EUROCRYPT. 375--403.  Albert Cheu Adam D. Smith Jonathan R. Ullman David Zeber and Maxim Zhilyaev. 2019. Distributed Differential Privacy via Shuffling. In EUROCRYPT. 375--403.","DOI":"10.1007\/978-3-030-17653-2_13"},{"key":"e_1_3_2_1_24_1","volume-title":"Differentially Private Histograms in the Shuffle Model from Fake Users. CoRR","author":"Cheu Albert","year":"2021","unstructured":"Albert Cheu and Maxim Zhilyaev . 2021. Differentially Private Histograms in the Shuffle Model from Fake Users. CoRR , Vol. abs\/ 2104 .02739 ( 2021 ). Albert Cheu and Maxim Zhilyaev. 2021. Differentially Private Histograms in the Shuffle Model from Fake Users. CoRR, Vol. abs\/2104.02739 (2021)."},{"key":"e_1_3_2_1_25_1","volume-title":"Tran","author":"Cormode Graham","year":"2012","unstructured":"Graham Cormode , Cecilia Procopiuc , Divesh Srivastava , and Thanh T. L . Tran . 2012 . Differentially Private Summaries for Sparse Data. In ICDT. Graham Cormode, Cecilia Procopiuc, Divesh Srivastava, and Thanh T. L. Tran. 2012. Differentially Private Summaries for Sparse Data. In ICDT."},{"key":"e_1_3_2_1_26_1","volume-title":"Prio: Private, Robust, and Scalable Computation of Aggregate Statistics. In NSDI.","author":"Corrigan-Gibbs Henry","year":"2017","unstructured":"Henry Corrigan-Gibbs and Dan Boneh . 2017 . Prio: Private, Robust, and Scalable Computation of Aggregate Statistics. In NSDI. Henry Corrigan-Gibbs and Dan Boneh. 2017. Prio: Private, Robust, and Scalable Computation of Aggregate Statistics. In NSDI."},{"key":"e_1_3_2_1_27_1","unstructured":"Henry Corrigan-Gibbs Dan Boneh Gary Chen Steven Englehardt Robert Helmer Chris Hutten-Czapski Anthony Miyaguchi Eric Rescorla and Peter Saint-Andre. 2020. Privacy-preserving Firefox telemetry with Prio. https:\/\/rwc.iacr.org\/2020\/slides\/Gibbs.pdf.  Henry Corrigan-Gibbs Dan Boneh Gary Chen Steven Englehardt Robert Helmer Chris Hutten-Czapski Anthony Miyaguchi Eric Rescorla and Peter Saint-Andre. 2020. Privacy-preserving Firefox telemetry with Prio. https:\/\/rwc.iacr.org\/2020\/slides\/Gibbs.pdf."},{"key":"e_1_3_2_1_28_1","first-page":"103","article-title":"A Secure and Optimally Efficient Multi-Authority Election Scheme","volume":"1233","author":"Cramer Ronald","year":"1997","unstructured":"Ronald Cramer , Rosario Gennaro , and Berry Schoenmakers . 1997 . A Secure and Optimally Efficient Multi-Authority Election Scheme . In EUROCRYPT , Vol. 1233. 103 -- 118 . Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers. 1997. A Secure and Optimally Efficient Multi-Authority Election Scheme. In EUROCRYPT, Vol. 1233. 103--118.","journal-title":"EUROCRYPT"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_9"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0017"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Krishnaram Kenthapadi Frank McSherry Ilya Mironov and Moni Naor. 2006 a. Our data ourselves: Privacy via distributed noise generation. In EUROCRYPT. 486--503.  Cynthia Dwork Krishnaram Kenthapadi Frank McSherry Ilya Mironov and Moni Naor. 2006 a. Our data ourselves: Privacy via distributed noise generation. In EUROCRYPT. 486--503.","DOI":"10.1007\/11761679_29"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Frank McSherry Kobbi Nissim and Adam Smith. 2006 b. Calibrating Noise to Sensitivity in Private Data Analysis. In TCC.  Cynthia Dwork Frank McSherry Kobbi Nissim and Adam Smith. 2006 b. Calibrating Noise to Sensitivity in Private Data Analysis. In TCC.","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"\u00dalfar Erlingsson Vitaly Feldman Ilya Mironov Ananth Raghunathan Kunal Talwar and Abhradeep Thakurta. 2019. Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity. In SODA. 2468--2479.  \u00dalfar Erlingsson Vitaly Feldman Ilya Mironov Ananth Raghunathan Kunal Talwar and Abhradeep Thakurta. 2019. Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity. In SODA. 2468--2479.","DOI":"10.1137\/1.9781611975482.151"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Alexandre Evfimievski Johannes Gehrke and Ramakrishnan Srikant. 2003. Limiting privacy breaches in privacy preserving data mining. In PODS. 211--222.  Alexandre Evfimievski Johannes Gehrke and Ramakrishnan Srikant. 2003. Limiting privacy breaches in privacy preserving data mining. In PODS. 211--222.","DOI":"10.1145\/773153.773174"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Vitaly Feldman Audra McMillan and Kunal Talwar. 2021. Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shuffling. In FOCS. 954--964.  Vitaly Feldman Audra McMillan and Kunal Talwar. 2021. Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shuffling. In FOCS. 954--964.","DOI":"10.1109\/FOCS52979.2021.00096"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2017038"},{"key":"e_1_3_2_1_38_1","first-page":"10","article-title":"A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms","volume":"196","author":"Gamal Taher El","year":"1984","unstructured":"Taher El Gamal . 1984 . A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms . In CRYPTO , Vol. 196. 10 -- 18 . Taher El Gamal. 1984. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In CRYPTO, Vol. 196. 10--18.","journal-title":"CRYPTO"},{"key":"e_1_3_2_1_39_1","first-page":"1","article-title":"Pure Differentially Private Summation from Anonymous Messages","volume":"15","author":"Ghazi Badih","year":"2020","unstructured":"Badih Ghazi , Noah Golowich , Ravi Kumar , Pasin Manurangsi , Rasmus Pagh , and Ameya Velingker . 2020 a. Pure Differentially Private Summation from Anonymous Messages . In ITC. 15 : 1 - 15 :23. Badih Ghazi, Noah Golowich, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, and Ameya Velingker. 2020a. Pure Differentially Private Summation from Anonymous Messages. In ITC. 15:1-15:23.","journal-title":"ITC."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Badih Ghazi Noah Golowich Ravi Kumar Rasmus Pagh and Ameya Velingker. 2021a. On the Power of Multiple Anonymous Messages: Frequency Estimation and Selection in the Shuffle Model of Differential Privacy. In EUROCRYPT. 463--488.  Badih Ghazi Noah Golowich Ravi Kumar Rasmus Pagh and Ameya Velingker. 2021a. On the Power of Multiple Anonymous Messages: Frequency Estimation and Selection in the Shuffle Model of Differential Privacy. In EUROCRYPT. 463--488.","DOI":"10.1007\/978-3-030-77883-5_16"},{"key":"e_1_3_2_1_41_1","first-page":"373","article-title":"Multiparty Reach and Frequency Histogram","volume":"2022","author":"Ghazi Badih","year":"2022","unstructured":"Badih Ghazi , Ben Kreuter , Ravi Kumar , Pasin Manurangsi , Jiayu Peng , Evgeny Skvortsov , Yao Wang , and Craig Wright . 2022 . Multiparty Reach and Frequency Histogram : Private, Secure, and Practical. PoPETS , Vol. 2022 , 1 (2022), 373 -- 395 . Badih Ghazi, Ben Kreuter, Ravi Kumar, Pasin Manurangsi, Jiayu Peng, Evgeny Skvortsov, Yao Wang, and Craig Wright. 2022. Multiparty Reach and Frequency Histogram: Private, Secure, and Practical. PoPETS, Vol. 2022, 1 (2022), 373--395.","journal-title":"Private, Secure, and Practical. PoPETS"},{"key":"e_1_3_2_1_42_1","unstructured":"Badih Ghazi Ravi Kumar and Pasin Manurangsi. 2021b. User-Level Differentially Private Learning via Correlated Sampling. In NeurIPS.  Badih Ghazi Ravi Kumar and Pasin Manurangsi. 2021b. User-Level Differentially Private Learning via Correlated Sampling. In NeurIPS."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Badih Ghazi Ravi Kumar Pasin Manurangsi and Rasmus Pagh. 2020b. Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead. In ICML. 3505--3514.  Badih Ghazi Ravi Kumar Pasin Manurangsi and Rasmus Pagh. 2020b. Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead. In ICML. 3505--3514.","DOI":"10.1007\/978-3-030-45724-2_27"},{"key":"e_1_3_2_1_44_1","volume-title":"Foundations of Cryptography","author":"Goldreich Oded","unstructured":"Oded Goldreich . 2006. Foundations of Cryptography : Volume 1 . Cambridge University Press , USA. Oded Goldreich. 2006. Foundations of Cryptography: Volume 1. Cambridge University Press, USA."},{"key":"e_1_3_2_1_45_1","volume-title":"Foundations of Cryptography","author":"Goldreich Oded","unstructured":"Oded Goldreich . 2009. Foundations of Cryptography : Volume 2 , Basic Applications. Cambridge University Press . Oded Goldreich. 2009. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to play any mental game. In STOC. 218--229.  Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to play any mental game. In STOC. 218--229.","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"S Goldwasser S Micali and C Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems. In STOC.  S Goldwasser S Micali and C Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems. In STOC.","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_1_48_1","unstructured":"Google. 2019. Private Join and Compute. https:\/\/github.com\/google\/private-join-and-compute\/.  Google. 2019. Private Join and Compute. https:\/\/github.com\/google\/private-join-and-compute\/."},{"key":"e_1_3_2_1_49_1","volume-title":"Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. In USENIX. 519--535.","author":"Grassi Lorenzo","year":"2021","unstructured":"Lorenzo Grassi , Dmitry Khovratovich , Christian Rechberger , Arnab Roy , and Markus Schofnegger . 2021 . Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. In USENIX. 519--535. Lorenzo Grassi, Dmitry Khovratovich, Christian Rechberger, Arnab Roy, and Markus Schofnegger. 2021. Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. In USENIX. 519--535."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0034"},{"key":"e_1_3_2_1_51_1","volume-title":"Jensen","author":"Hay Michael","year":"2009","unstructured":"Michael Hay , Chao Li , Gerome Miklau , and David D . Jensen . 2009 . Accurate Estimation of the Degree Distribution of Private Networks. In ICDM. 169--178. Michael Hay, Chao Li, Gerome Miklau, and David D. Jensen. 2009. Accurate Estimation of the Degree Distribution of Private Networks. In ICDM. 169--178."},{"key":"e_1_3_2_1_52_1","first-page":"1021","article-title":"Boosting the Accuracy of Differentially Private Histograms Through Consistency","volume":"3","author":"Hay Michael","year":"2010","unstructured":"Michael Hay , Vibhor Rastogi , Gerome Miklau , and Dan Suciu . 2010 . Boosting the Accuracy of Differentially Private Histograms Through Consistency . VLDB , Vol. 3 , 1 (2010), 1021 -- 1032 . Michael Hay, Vibhor Rastogi, Gerome Miklau, and Dan Suciu. 2010. Boosting the Accuracy of Differentially Private Histograms Through Consistency. VLDB, Vol. 3, 1 (2010), 1021--1032.","journal-title":"VLDB"},{"key":"e_1_3_2_1_53_1","unstructured":"Yan Huang David Evans and Jonathan Katz. 2012. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?. In NDSS.  Yan Huang David Evans and Jonathan Katz. 2012. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?. In NDSS."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Stanislaw Jarecki and Xiaomin Liu. 2010. Fast Secure Computation of Set Intersection. In SCN.  Stanislaw Jarecki and Xiaomin Liu. 2010. Fast Secure Computation of Set Intersection. In SCN.","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Shiva Prasad Kasiviswanathan Homin K. Lee Kobbi Nissim Sofya Raskhodnikova and Adam Smith. 2008. What Can We Learn Privately?. In FOCS.  Shiva Prasad Kasiviswanathan Homin K. Lee Kobbi Nissim Sofya Raskhodnikova and Adam Smith. 2008. What Can We Learn Privately?. In FOCS.","DOI":"10.1109\/FOCS.2008.27"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller. 2020. MP-SPDZ: A Versatile Framework for Multi-Party Computation. In CCS.  Marcel Keller. 2020. MP-SPDZ: A Versatile Framework for Multi-Party Computation. In CCS.","DOI":"10.1145\/3372297.3417872"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Aleksandra Korolova Krishnaram Kenthapadi Nina Mishra and Alexandros Ntoulas. 2009. Releasing Search Queries and Clicks Privately. In WWW.  Aleksandra Korolova Krishnaram Kenthapadi Nina Mishra and Alexandros Ntoulas. 2009. Releasing Search Queries and Clicks Privately. In WWW.","DOI":"10.1145\/1526709.1526733"},{"key":"e_1_3_2_1_58_1","volume-title":"Advances in nowcasting influenza-like illness rates using search query logs. Scientific Reports 12760","author":"Lampos Vasileios","year":"2015","unstructured":"Vasileios Lampos , Andrew C Miller , Steve Crossan , and Christian Stefansen . 2015. Advances in nowcasting influenza-like illness rates using search query logs. Scientific Reports 12760 ( 2015 ). Issue 5. Vasileios Lampos, Andrew C Miller, Steve Crossan, and Christian Stefansen. 2015. Advances in nowcasting influenza-like illness rates using search query logs. Scientific Reports 12760 (2015). Issue 5."},{"key":"e_1_3_2_1_59_1","volume-title":"Tutorials on the Foundations of Cryptography","author":"Lindell Yehuda","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. 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_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387108"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"crossref","unstructured":"Pasin Manurangsi. 2022. Tight Bounds for Differentially Private Anonymized Histograms. In SOSA. 203--213.  Pasin Manurangsi. 2022. Tight Bounds for Differentially Private Anonymized Histograms. In SOSA. 203--213.","DOI":"10.1137\/1.9781611977066.14"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Sahar Mazloom and S. Dov Gordon. 2018. Secure Computation with Differentially Private Access Patterns. In CCS. 490--507.  Sahar Mazloom and S. Dov Gordon. 2018. Secure Computation with Differentially Private Access Patterns. In CCS. 490--507.","DOI":"10.1145\/3243734.3243851"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851199"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"crossref","unstructured":"Catherine A. Meadows. 1986. A More Efficient Cryptographic Matchmaking Protocol for Use in the Absence of a Continuously Available Third Party. In SP. 134--137.  Catherine A. Meadows. 1986. A More Efficient Cryptographic Matchmaking Protocol for Use in the Absence of a Continuously Available Third Party. In SP. 134--137.","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"crossref","unstructured":"Ilya Mironov Omkant Pandey Omer Reingold and Salil Vadhan. 2009. Computational Differential Privacy. In CRYPTO.  Ilya Mironov Omkant Pandey Omer Reingold and Salil Vadhan. 2009. Computational Differential Privacy. In CRYPTO.","DOI":"10.1007\/978-3-642-03356-8_8"},{"key":"e_1_3_2_1_66_1","first-page":"223","article-title":"Public-Key Cryptosystems Based on Composite Degree Residuosity Classes","volume":"1592","author":"Paillier Pascal","year":"1999","unstructured":"Pascal Paillier . 1999 . Public-Key Cryptosystems Based on Composite Degree Residuosity Classes . In EUROCRYPT , Vol. 1592. 223 -- 238 . Pascal Paillier. 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT, Vol. 1592. 223--238.","journal-title":"EUROCRYPT"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556576"},{"key":"e_1_3_2_1_68_1","volume-title":"Brett Hemenway Falk, and Andreas Haeberlen","author":"Roth Edo","year":"2019","unstructured":"Edo Roth , Daniel Noble , Brett Hemenway Falk, and Andreas Haeberlen . 2019 . Honeycrisp : Large-Scale Differentially Private Aggregation without a Trusted Core. In SOSP. Edo Roth, Daniel Noble, Brett Hemenway Falk, and Andreas Haeberlen. 2019. Honeycrisp: Large-Scale Differentially Private Aggregation without a Trusted Core. In SOSP."},{"key":"e_1_3_2_1_69_1","volume-title":"Pierce","author":"Roth Edo","year":"2020","unstructured":"Edo Roth , Hengchu Zhang , Andreas Haeberlen , and Benjamin C . Pierce . 2020 . Orchard : Differentially Private Analytics at Scale. In OSDI. Edo Roth, Hengchu Zhang, Andreas Haeberlen, and Benjamin C. Pierce. 2020. Orchard: Differentially Private Analytics at Scale. In OSDI."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2020-0024"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"e_1_3_2_1_72_1","unstructured":"Ananda Theertha Suresh. 2019. Differentially Private Anonymized Histograms. In NeurIPS. 7969--7979.  Ananda Theertha Suresh. 2019. Differentially Private Anonymized Histograms. In NeurIPS. 7969--7979."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3418290"},{"key":"e_1_3_2_1_74_1","unstructured":"Tianhao Wang Jeremiah Blocki Ninghui Li and Somesh Jha. 2017a. Locally Differentially Private Protocols for Frequency Estimation. In USENIX.  Tianhao Wang Jeremiah Blocki Ninghui Li and Somesh Jha. 2017a. Locally Differentially Private Protocols for Frequency Estimation. In USENIX."},{"key":"e_1_3_2_1_75_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit.  Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017b. Global-Scale Secure Multiparty Computation. In CCS.  Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017b. Global-Scale Secure Multiparty Computation. In CCS.","DOI":"10.1145\/3133956.3133979"},{"key":"e_1_3_2_1_77_1","unstructured":"Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In FOCS. 162--167.  Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In FOCS. 162--167."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"crossref","unstructured":"Jun Zhang Xiaokui Xiao and Xing Xie. 2016. PrivTree: A Differentially Private Algorithm for Hierarchical Decompositions. In SIGMOD. 155--170.  Jun Zhang Xiaokui Xiao and Xing Xie. 2016. PrivTree: A Differentially Private Algorithm for Hierarchical Decompositions. In SIGMOD. 155--170.","DOI":"10.1145\/2882903.2882928"},{"key":"e_1_3_2_1_79_1","unstructured":"Wennan Zhu Peter Kairouz Brendan McMahan Haicheng Sun and Wei Li. 2020. Federated Heavy Hitters Discovery with Differential Privacy. In AISTATS. 3837--3847.  Wennan Zhu Peter Kairouz Brendan McMahan Haicheng Sun and Wei Li. 2020. Federated Heavy Hitters Discovery with Differential Privacy. In AISTATS. 3837--3847."}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3559383","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3559383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:50:57Z","timestamp":1750182657000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3559383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":79,"alternative-id":["10.1145\/3548606.3559383","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3559383","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}