{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:30:02Z","timestamp":1766449802536,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":92,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T00:00:00Z","timestamp":1722297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["236615297, 251805230"],"award-info":[{"award-number":["236615297, 251805230"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["850990"],"award-info":[{"award-number":["850990"]}],"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,7,30]]},"DOI":"10.1145\/3664476.3664490","type":"proceedings-article","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T12:35:50Z","timestamp":1721910950000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Secure Noise Sampling for DP in MPC with Finite Precision"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4461-7067","authenticated-orcid":false,"given":"Hannah","family":"Keller","sequence":"first","affiliation":[{"name":"Aarhus University, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9371-3592","authenticated-orcid":false,"given":"Helen","family":"M\u00f6llering","sequence":"additional","affiliation":[{"name":"McKinsey &amp; Company, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8090-1316","authenticated-orcid":false,"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[{"name":"Technical University of Darmstadt, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9232-6902","authenticated-orcid":false,"given":"Oleksandr","family":"Tkachenko","sequence":"additional","affiliation":[{"name":"DFINITY Foundation, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0838-7161","authenticated-orcid":false,"given":"Liang","family":"Zhao","sequence":"additional","affiliation":[{"name":"Technical University of Darmstadt, Germany"}]}],"member":"320","published-online":{"date-parts":[[2024,7,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Mart\u00edn Abadi Andy Chu Ian Goodfellow H.\u00a0Brendan McMahan Ilya Mironov Kunal Talwar and Li Zhang. 2016. Deep Learning with Differential Privacy. In CCS.","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Abbas Acar Berkay Celik Hidayet Aksu Selcuk Uluagac and Patrick McDaniel. 2017. Achieving Secure and Differentially Private Computations in Multiparty Settings. In PAC.","DOI":"10.1109\/PAC.2017.12"},{"key":"e_1_3_2_2_3_1","unstructured":"Gergely \u00c1cs and Claude Castelluccia. 2011. I Have a DREAM! (DiffeRentially privatE smArt Metering). In Information Hiding (IH)."},{"key":"e_1_3_2_2_4_1","unstructured":"Mehrdad Aliasgari Marina Blanton Yihua Zhang and Aaron Steele. 2013. Secure Computation on Floating Point Numbers. In NDSS."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Toshinori Araki Jun Furukawa Yehuda Lindell Ariel Nof and Kazuma Ohara. 2016. High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. In CCS.","DOI":"10.1145\/2976749.2978331"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"David Archer Shahla Atapoor and Nigel Smart. 2021. The Cost of IEEE Arithmetic in Secure Computation. In LATINCRYPT.","DOI":"10.1007\/978-3-030-88238-9_21"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Shai Halevi Yehuda Lindell and Tal Rabin. 2018. Privacy-Preserving Search of Similar Patients in Genomic Data. In PETS.","DOI":"10.1515\/popets-2018-0034"},{"volume-title":"Measure theory and probability theory","author":"Athreya Krishna","key":"e_1_3_2_2_8_1","unstructured":"Krishna Athreya and Soumendra Lahiri. 2006. Measure theory and probability theory. Springer Texts in Statistics."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNI.2017.8123782"},{"key":"e_1_3_2_2_10_1","unstructured":"Borja Balle and Yu-Xiang Wang. 2018. Improving the Gaussian Mechanism for Differential Privacy: Analytical Calibration and Optimal Denoising. In ICML."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Elaine Barker and John Kelsey. 2015. Recommendation for Random Number Generation Using Deterministic Random Bit Generators. Special Publication NIST.","DOI":"10.6028\/NIST.SP.800-90Ar1"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_25"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"James Bell Kallista Bonawitz Adri\u00e0 Gasc\u00f3n Tancr\u00e8de Lepoint and Mariana Raykova. 2020. Secure Single-Server Aggregation with (Poly)Logarithmic Overhead. In CCS.","DOI":"10.1145\/3372297.3417885"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Aner Ben-Efraim Yehuda Lindell and Eran Omri. 2016. Optimizing Semi-Honest Secure Multiparty Computation for the Internet. In CCS.","DOI":"10.1145\/2976749.2978347"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Igor Bilogrevic Julien Freudiger Emiliano\u00a0De Cristofaro and Ersin Uzun. 2014. What\u2019s the Gist? Privacy-Preserving Aggregation of User Profiles. In ESORICS.","DOI":"10.1007\/978-3-319-11212-1_8"},{"key":"e_1_3_2_2_16_1","volume-title":"SPIKE: secure and private investigation of the kidney exchange problem. BMC Medical Informatics Decision Making","author":"Birka Timm","year":"2022","unstructured":"Timm Birka, Kay Hamacher, Tobias Kussel, Helen M\u00f6llering, and Thomas Schneider. 2022. SPIKE: secure and private investigation of the kidney exchange problem. BMC Medical Informatics Decision Making (2022)."},{"key":"e_1_3_2_2_17_1","volume-title":"Sharemind: A Framework for Fast Privacy-Preserving Computations. In ESORICS.","author":"Bogdanov Dan","year":"2008","unstructured":"Dan Bogdanov, Sven Laur, and Jan Willemson. 2008. Sharemind: A Framework for Fast Privacy-Preserving Computations. In ESORICS."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Jonas B\u00f6hler and Florian Kerschbaum. 2021. Secure Multi-party Computation of Differentially Private Heavy Hitters. In CCS.","DOI":"10.1145\/3460120.3484557"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Lennart Braun Daniel Demmler Thomas Schneider and Oleksandr Tkachenko. 2022. MOTION\u2013A Framework for Mixed-Protocol Multi-Party Computation. In TOPS.","DOI":"10.1145\/3490390"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Niklas B\u00fcscher Daniel Demmler Stefan Katzenbeisser David Kretzmer and Thomas Schneider. 2018. HyCC: Compilation of Hybrid Protocols for Practical Secure Computation. In CCS.","DOI":"10.1145\/3243734.3243786"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Niklas B\u00fcscher Andreas Holzer Alina Weber and Stefan Katzenbeisser. 2016. Compiling Low Depth Circuits for Practical Secure Computation. In ESORICS.","DOI":"10.1007\/978-3-319-45741-3_5"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"David Byrd and Antigoni Polychroniadou. 2020. Differentially private secure multi-party computation for federated learning in financial applications. In ICAIF.","DOI":"10.1145\/3383455.3422562"},{"key":"e_1_3_2_2_23_1","unstructured":"Cl\u00e9ment Canonne Gautam Kamath and Thomas Steinke. 2020. The Discrete Gaussian for Differential Privacy. In NeurIPS."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"S\u00edlvia Casacuberta Michael Shoemate Salil Vadhan and Connor Wagaman. 2022. Widespread Underestimation of Sensitivity in Differentially Private Libraries and How to Fix It. In CCS.","DOI":"10.1145\/3548606.3560708"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Octavian Catrina and Amitabh Saxena. 2010. Secure Computation with Fixed-Point Numbers. In FC.","DOI":"10.1007\/978-3-642-14577-3_6"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Berkay Celik David Lopez-Paz and Patrick McDaniel. 2017. Patient-Driven Privacy Control through Generalized Distillation. In PAC.","DOI":"10.1109\/PAC.2017.13"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Jeffrey Champion Abhi Shelat and Jonathan\u00a0R. Ullman. 2019. Securely Sampling Biased Coins with Applications to Differential Privacy. In CCS.","DOI":"10.1145\/3319535.3354256"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Hubert Chan Elaine Shi and Dawn Song. 2012. Privacy-Preserving Stream Aggregation with Fault Tolerance. In FC.","DOI":"10.1007\/978-3-642-32946-3_15"},{"key":"e_1_3_2_2_29_1","unstructured":"Melissa Chase Ran Gilad-Bachrach Kim Laine Kristin\u00a0E. Lauter and Peter Rindal. 2017. Private Collaborative Neural Network Learning. Cryptology ePrint Archive Paper 2017\/762 https:\/\/eprint.iacr.org\/2017\/762."},{"key":"e_1_3_2_2_30_1","unstructured":"Albert Cheu and Chao Yan. 2022. Necessary Conditions in Multi-Server Differential Privacy. In ITCS."},{"key":"e_1_3_2_2_31_1","unstructured":"Christopher\u00a0A. Choquette-Choo Natalie Dullerud Adam Dziedzic Yunxiang Zhang Somesh Jha Nicolas Papernot and Xiao Wang. 2021. CaPC Learning: Confidential and Private Collaborative Learning. In ICLR."},{"key":"e_1_3_2_2_32_1","unstructured":"Christian Covington. 2019. Snapping Mechanism Notes. https:\/\/github.com\/ctcovington\/floating_point\/blob\/master\/snapping_mechanism\/notes\/snapping_implementation_notes.pdf Accessed 2022-09-29."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Ronald Cramer Ivan Damg\u00e5rd Daniel Escudero Peter Scholl and Chaoping Xing. 2018. SPDMath 295: Efficient MPC mod 2k for Dishonest Majority. In CRYPTO.","DOI":"10.1007\/978-3-319-96881-0_26"},{"key":"e_1_3_2_2_34_1","volume-title":"The modernization of statistical disclosure limitation at the U","author":"Dajani Aref","year":"2017","unstructured":"Aref Dajani, Amy Lauger, Phyllis Singer, Daniel Kifer, Jerome Reiter, Ashwin Machanavajjhala, Simson Garfinkel, Scot Dahl, Matthew Graham, Vishesh Karwa, Hang Kim, Philip Leclerc, Ian Schmutte, William Sexton, Lars Vilhuber, and John Abowd. 2020. The modernization of statistical disclosure limitation at the U.S. Census Bureau. U.S. Census Bureau. https:\/\/www2.census.gov\/cac\/sac\/meetings\/2017-09\/statistical-disclosure-limitation.pdf"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Daniel Demmler Ghada Dessouky Farinaz Koushanfar Ahmad-Reza Sadeghi Thomas Schneider and Shaza Zeitouni. 2015. Automated Synthesis of Optimized Circuits for Secure Computation. In CCS.","DOI":"10.1145\/2810103.2813678"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Daniel Demmler Thomas Schneider and Michael Zohner. 2015. ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In NDSS.","DOI":"10.14722\/ndss.2015.23113"},{"volume-title":"Non-Uniform Random Variate Generation","author":"Devroye Luc","key":"e_1_3_2_2_37_1","unstructured":"Luc Devroye. 1986. Non-Uniform Random Variate Generation. Springer Book Archive."},{"volume-title":"Our Data","author":"Dwork Cynthia","key":"e_1_3_2_2_38_1","unstructured":"Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, and Moni Naor. 2006. Our Data, Ourselves: Privacy Via Distributed Noise Generation. In CRYPTO."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Frank McSherry Kobbi Nissim and Adam\u00a0D. Smith. 2006. Calibrating Noise to Sensitivity in Private Data Analysis. In TCC.","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_2_40_1","volume-title":"The Algorithmic Foundations of Differential Privacy. Foundations and Trends in Theoretical Computer Science","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork and Aaron Roth. 2014. The Algorithmic Foundations of Differential Privacy. Foundations and Trends in Theoretical Computer Science (2014)."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Fabienne Eigner Matteo Maffei Ivan Pryvalov Francesca Pampaloni and Aniket Kate. 2014. Differentially private data aggregation with optimal utility. In ACSAC.","DOI":"10.1145\/2664243.2664263"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Reo Eriguchi Atsunori Ichikawa Noboru Kunihiro and Koji Nuida. 2021. Efficient Noise Generation to Achieve Differential Privacy with Applications to Secure Multiparty Computation. In FC.","DOI":"10.1007\/978-3-662-64322-8_13"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Daniel Escudero Satrajit Ghosh Marcel Keller Rahul Rachuri and Peter Scholl. 2020. Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. In CRYPTO.","DOI":"10.1007\/978-3-030-56880-1_29"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Vivian Fang Lloyd Brown William Lin Wenting Zheng Aurojit Panda and Raluca\u00a0Ada Popa. 2022. CostCO: An automatic cost modeling framework for secure multi-party computation. In IEEE EuroS&P.","DOI":"10.1109\/EuroSP53844.2022.00017"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Matt Fredrikson Somesh Jha and Thomas Ristenpart. 2015. Model Inversion Attacks That Exploit Confidence Information and Basic Countermeasures. In CCS.","DOI":"10.1145\/2810103.2813677"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.117.1"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2425831"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Arpita Ghosh Tim Roughgarden and Mukund Sundararajan. 2009. Universally utility-maximizing privacy mechanisms. In STOC.","DOI":"10.1145\/1536414.1536464"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC.","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_50_1","volume-title":"Privacy-enhanced multi-party deep learning. Neural Networks","author":"Gong Maoguo","year":"2020","unstructured":"Maoguo Gong, Jialun Feng, and Yu Xie. 2020. Privacy-enhanced multi-party deep learning. Neural Networks (2020)."},{"key":"e_1_3_2_2_51_1","unstructured":"Google. 2020. Secure noise generation. https:\/\/github.com\/google\/differential-privacy\/blob\/main\/common_docs\/Secure_Noise_Generation.pdf Accessed 2022-09-29."},{"key":"e_1_3_2_2_52_1","unstructured":"Google. 2022. Google\u2019s differential privacy libraries. https:\/\/github.com\/google\/differential-privacy.git Accessed 2022-09-29."},{"key":"e_1_3_2_2_53_1","volume-title":"Precision-based attacks and interval refining: how to break, then fix, differential privacy on finite computers. Journal of Privacy and Confidentiality","author":"Haney Samuel","year":"2022","unstructured":"Samuel Haney, Damien Desfontaines, Luke Hartman, Ruchit Shrestha, and Michael Hay. 2022. Precision-based attacks and interval refining: how to break, then fix, differential privacy on finite computers. Journal of Privacy and Confidentiality (2022)."},{"key":"e_1_3_2_2_54_1","volume-title":"LOGAN: Membership Inference Attacks Against Generative Models. In PETS.","author":"Hayes Jamie","year":"2019","unstructured":"Jamie Hayes, Luca Melis, George Danezis, and Emiliano De Cristofaro. 2019. LOGAN: Membership Inference Attacks Against Generative Models. In PETS."},{"key":"e_1_3_2_2_55_1","unstructured":"Mikko Heikkil\u00e4 Eemil Lagerspetz Samuel Kaski Kana Shimizu Sasu Tarkoma and Antti Honkela. 2017. Differentially private Bayesian learning on distributed data. In NeurIPS."},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Muhammad Ishaq Ana\u00a0L. Milanova and Vassilis Zikas. 2019. Efficient MPC via Program Analysis: A Framework for Efficient Optimal Mixing. In CCS.","DOI":"10.1145\/3319535.3339818"},{"key":"e_1_3_2_2_57_1","unstructured":"Matthew Jagielski Jonathan Ullman and Alina Oprea. 2020. Auditing Differentially Private Machine Learning: How Private is Private SGD?. In NeurIPS."},{"key":"e_1_3_2_2_58_1","unstructured":"Bargav Jayaraman Lingxiao Wang David Evans and Quanquan Gu. 2018. Distributed Learning without Distress: Privacy-Preserving Empirical Risk Minimization. In NeurIPS."},{"volume-title":"Are We There Yet? Timing and Floating-Point Attacks on Differential Privacy Systems","author":"Jin Jiankai","key":"e_1_3_2_2_59_1","unstructured":"Jiankai Jin, Eleanor McMurtry, Benjamin Rubinstein, and Olga Ohrimenko. 2022. Are We There Yet? Timing and Floating-Point Attacks on Differential Privacy Systems. In IEEE S&P."},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Marc Joye and Beno\u00eet Libert. 2013. A Scalable Scheme for Privacy-Preserving Aggregation of Time-Series Data. In FC.","DOI":"10.1007\/978-3-642-39884-1_10"},{"key":"e_1_3_2_2_61_1","unstructured":"Peter Kairouz Ziyu Liu and Thomas Steinke. 2021. The Distributed Discrete Gaussian Mechanism for Federated Learning with Secure Aggregation. In ICML."},{"key":"e_1_3_2_2_62_1","volume-title":"IBM Workshop on Cryptography and Security in Clouds.","author":"Kamara Seny","year":"2011","unstructured":"Seny Kamara and Mariana Raykova. 2011. Secure outsourced computation in a multi-tenant cloud. In IBM Workshop on Cryptography and Security in Clouds."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"crossref","unstructured":"Shiva\u00a0Prasad Kasiviswanathan Homin\u00a0K. 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_2_64_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller. 2020. MP-SPDZ: A versatile framework for multi-party computation. In CCS.","DOI":"10.1145\/3372297.3417872"},{"key":"e_1_3_2_2_65_1","unstructured":"Brian Knott Shobha Venkataraman Awni\u00a0Y. Hannun Shubho Sengupta Mark Ibrahim and Laurens van\u00a0der Maaten. 2021. CrypTen: Secure Multi-Party Computation Meets Machine Learning. In NeurIPS."},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.81"},{"key":"e_1_3_2_2_67_1","unstructured":"Peter\u00a0W. Markstein. 2008. The New IEEE-754 Standard for Floating Point Arithmetic. In Numerical Validation in Current Hardware Architectures."},{"key":"e_1_3_2_2_68_1","series-title":"SIAM Review.","volume-title":"A convenient method for generating normal variables","author":"Marsaglia George","unstructured":"George Marsaglia and Thomas\u00a0A Bray. 1964. A convenient method for generating normal variables. In SIAM Review."},{"key":"e_1_3_2_2_69_1","volume-title":"The ziggurat method for generating random variables. Journal of statistical software","author":"Marsaglia George","year":"2000","unstructured":"George Marsaglia and Wai\u00a0Wan Tsang. 2000. The ziggurat method for generating random variables. Journal of statistical software (2000)."},{"key":"e_1_3_2_2_70_1","unstructured":"Brendan McMahan Galen Andrew Ulfar Erlingsson Steve Chien Ilya Mironov Nicolas Papernot and Peter Kairouz. 2018. A General Approach to Adding Differential Privacy to Iterative Training Procedures. arXiv http:\/\/arxiv.org\/abs\/1812.06210."},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"crossref","unstructured":"Ilya Mironov. 2012. On significance of the least significant bits for differential privacy. In CCS.","DOI":"10.1145\/2382196.2382264"},{"key":"e_1_3_2_2_72_1","unstructured":"Payman Mohassel and Peter Rindal. 2018. ABY3: A Mixed Protocol Framework for Machine Learning. In CCS."},{"volume-title":"SecureML: A System for Scalable Privacy-Preserving Machine Learning","author":"Mohassel Payman","key":"e_1_3_2_2_73_1","unstructured":"Payman Mohassel and Yupeng Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In IEEE S&P."},{"volume-title":"Robust De-anonymization of Large Sparse Datasets","author":"Narayanan Arvind","key":"e_1_3_2_2_74_1","unstructured":"Arvind Narayanan and Vitaly Shmatikov. 2008. Robust De-anonymization of Large Sparse Datasets. In IEEE S&P."},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"crossref","unstructured":"Arpita Patra Thomas Schneider Ajith Suresh and Hossein Yalame. 2021. SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation. In HOST.","DOI":"10.1109\/HOST49136.2021.9702293"},{"key":"e_1_3_2_2_76_1","doi-asserted-by":"crossref","unstructured":"Martin Pettai and Peeter Laud. 2015. Combining Differential Privacy and Secure Multiparty Computation. In CCS.","DOI":"10.1145\/2818000.2818027"},{"key":"e_1_3_2_2_77_1","doi-asserted-by":"crossref","unstructured":"Vibhor Rastogi and Suman Nath. 2010. Differentially private aggregation of distributed time-series with transformation and encryption. In SIGMOD.","DOI":"10.1145\/1807167.1807247"},{"key":"e_1_3_2_2_78_1","doi-asserted-by":"crossref","unstructured":"Mike Rosulek and Lawrence Roy. 2021. Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits. In CRYPTO.","DOI":"10.1007\/978-3-030-84242-0_5"},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"crossref","unstructured":"Thomas Schneider and Michael Zohner. 2013. GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits. In FC.","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"e_1_3_2_2_80_1","volume-title":"How to Share a Secret. Commun. ACM","author":"Shamir Adi","year":"1979","unstructured":"Adi Shamir. 1979. How to Share a Secret. Commun. ACM (1979)."},{"key":"e_1_3_2_2_81_1","unstructured":"Elaine Shi T.-H.\u00a0Hubert Chan Eleanor\u00a0Gilbert Rieffel Richard Chow and Dawn Song. 2011. Privacy-Preserving Aggregation of Time-Series Data. In NDSS."},{"key":"e_1_3_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3146549"},{"key":"e_1_3_2_2_83_1","doi-asserted-by":"crossref","unstructured":"Reza Shokri and Vitaly Shmatikov. 2015. Privacy-preserving Deep Learning. In CCS.","DOI":"10.1109\/ALLERTON.2015.7447103"},{"key":"e_1_3_2_2_84_1","volume-title":"Medicine & Ethics","author":"Sweeney Latanya","year":"1997","unstructured":"Latanya Sweeney. 1997. Weaving Technology and Policy Together to Maintain Confidentiality. The Journal of Law, Medicine & Ethics (1997)."},{"key":"e_1_3_2_2_85_1","unstructured":"Jun Tang Aleksandra Korolova Xiaolong Bai Xueqiang Wang and Xiaofeng Wang. 2017. Privacy Loss in Apple\u2019s Implementation of Differential Privacy on MacOS 10.12. arXiv http:\/\/arxiv.org\/abs\/1709.02753."},{"key":"e_1_3_2_2_86_1","doi-asserted-by":"crossref","unstructured":"Stacey Truex Nathalie Baracaldo Ali Anwar Thomas Steinke Heiko Ludwig Rui Zhang and Yi Zhou. 2019. A Hybrid Approach to Privacy-Preserving Federated Learning. In CCS.","DOI":"10.1145\/3338501.3357370"},{"volume-title":"Tutorials on the Foundations of Cryptography","author":"Vadhan Salil","key":"e_1_3_2_2_87_1","unstructured":"Salil Vadhan. 2017. The Complexity of Differential Privacy. In Tutorials on the Foundations of Cryptography. Springer International Publishing, 347\u2013450."},{"key":"e_1_3_2_2_88_1","doi-asserted-by":"crossref","unstructured":"Royce Wilson Celia\u00a0Yuxin Zhang William Lam Damien Desfontaines Daniel Simmons-Marengo and Bryant Gipson. 2020. Differentially Private SQL with Bounded User Contribution. In PETS.","DOI":"10.2478\/popets-2020-0025"},{"volume-title":"Inherit Differential Privacy in Distributed Setting: Multiparty Randomized Function Computation","author":"Wu Genqiang","key":"e_1_3_2_2_89_1","unstructured":"Genqiang Wu, Yeping He, JingZheng Wu, and Xianyao Xia. 2016. Inherit Differential Privacy in Distributed Setting: Multiparty Randomized Function Computation. In IEEE Trustcom\/BigDataSE\/ISPA."},{"key":"e_1_3_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338501.3357371"},{"key":"e_1_3_2_2_91_1","unstructured":"Andrew\u00a0Chi-Chih Yao. 1986. How to Generate and Exchange Secrets. In FOCS."},{"key":"e_1_3_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3074185"}],"event":{"name":"ARES 2024: The 19th International Conference on Availability, Reliability and Security","acronym":"ARES 2024","location":"Vienna Austria"},"container-title":["Proceedings of the 19th International Conference on Availability, Reliability and Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664476.3664490","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3664476.3664490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:51:48Z","timestamp":1755881508000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664476.3664490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,30]]},"references-count":92,"alternative-id":["10.1145\/3664476.3664490","10.1145\/3664476"],"URL":"https:\/\/doi.org\/10.1145\/3664476.3664490","relation":{},"subject":[],"published":{"date-parts":[[2024,7,30]]},"assertion":[{"value":"2024-07-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}