{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:09Z","timestamp":1750220169530,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T00:00:00Z","timestamp":1666742400000},"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":[[2022,11,2]]},"DOI":"10.1145\/3533271.3561776","type":"proceedings-article","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T22:20:22Z","timestamp":1666304422000},"page":"192-198","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Addressing Extreme Market Responses Using Secure Aggregation"],"prefix":"10.1145","author":[{"given":"Sahar","family":"Mazloom","sequence":"first","affiliation":[{"name":"J.P. Morgan AI Research, US"}]},{"given":"Antigoni","family":"Polychroniadou","sequence":"additional","affiliation":[{"name":"J.P. Morgan AI Research, US"}]},{"given":"Tucker","family":"Balch","sequence":"additional","affiliation":[{"name":"J.P. Morgan AI Research, US"}]}],"member":"320","published-online":{"date-parts":[[2022,10,26]]},"reference":[{"volume-title":"Secure Single-Server Aggregation with (Poly)Logarithmic Overhead","author":"Bell James\u00a0Henry","key":"e_1_3_2_1_1_1","unstructured":"James\u00a0Henry Bell , Kallista\u00a0 A. Bonawitz , Adri\u00e0 Gasc\u00f3n , Tancr\u00e8de Lepoint , and Mariana Raykova . 2020. Secure Single-Server Aggregation with (Poly)Logarithmic Overhead . Association for Computing Machinery , New York, NY, USA , 1253\u20131269. https:\/\/doi.org\/10.1145\/3372297.3417885 10.1145\/3372297.3417885 James\u00a0Henry Bell, Kallista\u00a0A. Bonawitz, Adri\u00e0 Gasc\u00f3n, Tancr\u00e8de Lepoint, and Mariana Raykova. 2020. Secure Single-Server Aggregation with (Poly)Logarithmic Overhead. Association for Computing Machinery, New York, NY, USA, 1253\u20131269. https:\/\/doi.org\/10.1145\/3372297.3417885"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_5_1","volume-title":"A Conference on the Theory and Applications of Cryptographic Techniques","author":"Chaum David","year":"1987","unstructured":"David Chaum , Claude Cr\u00e9peau , and Ivan Damg\u00e5rd . 1987 . Multiparty Unconditionally Secure Protocols (Abstract). In Advances in Cryptology - CRYPTO \u201987 , A Conference on the Theory and Applications of Cryptographic Techniques , Santa Barbara, California, USA , August 16-20, 1987, Proceedings. 462. https:\/\/doi.org\/10.1007\/3-540-48184-2_43 10.1007\/3-540-48184-2_43 David Chaum, Claude Cr\u00e9peau, and Ivan Damg\u00e5rd. 1987. Multiparty Unconditionally Secure Protocols (Abstract). In Advances in Cryptology - CRYPTO \u201987, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, California, USA, August 16-20, 1987, Proceedings. 462. https:\/\/doi.org\/10.1007\/3-540-48184-2_43"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Aaron Roth 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science 9 3\u20134(2014) 211\u2013407.  Cynthia Dwork Aaron Roth 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science 9 3\u20134(2014) 211\u2013407.","DOI":"10.1561\/0400000042"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_5"},{"volume-title":"The Foundations of Cryptography - Volume 2: Basic Applications","author":"Goldreich Oded","key":"e_1_3_2_1_9_1","unstructured":"Oded Goldreich . 2004. The Foundations of Cryptography - Volume 2: Basic Applications . Cambridge University Press . https:\/\/doi.org\/10.1017\/CBO9780511721656 10.1017\/CBO9780511721656 Oded Goldreich. 2004. The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press. https:\/\/doi.org\/10.1017\/CBO9780511721656"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"Goldreich Oded","year":"1987","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 Proceedings of the 19th Annual ACM Symposium on Theory of Computing , 1987, New York, New York, USA. 218\u2013229. https:\/\/doi.org\/10.1145\/28395.28420 10.1145\/28395.28420 Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA. 218\u2013229. https:\/\/doi.org\/10.1145\/28395.28420"},{"key":"e_1_3_2_1_11_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. https:\/\/eprint.iacr.org\/2022\/714  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. https:\/\/eprint.iacr.org\/2022\/714"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_24"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_6"},{"key":"e_1_3_2_1_14_1","volume-title":"23rd Annual Symposium on Foundations of Computer Science","author":"Yao Chi-Chih","year":"1982","unstructured":"Andrew\u00a0 Chi-Chih Yao . 1982 . Protocols for Secure Computations (Extended Abstract) . In 23rd Annual Symposium on Foundations of Computer Science , Chicago, Illinois, USA , 3-5 November 1982. IEEE Computer Society, 160\u2013164. Andrew\u00a0Chi-Chih Yao. 1982. Protocols for Secure Computations (Extended Abstract). In 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982. IEEE Computer Society, 160\u2013164."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"ICAIF '22: 3rd ACM International Conference on AI in Finance","sponsor":["ACM Association for Computing Machinery"],"location":"New York NY USA","acronym":"ICAIF '22"},"container-title":["Proceedings of the Third ACM International Conference on AI in Finance"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3533271.3561776","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3533271.3561776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:39Z","timestamp":1750186839000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3533271.3561776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,26]]},"references-count":15,"alternative-id":["10.1145\/3533271.3561776","10.1145\/3533271"],"URL":"https:\/\/doi.org\/10.1145\/3533271.3561776","relation":{},"subject":[],"published":{"date-parts":[[2022,10,26]]},"assertion":[{"value":"2022-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}