{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T00:26:48Z","timestamp":1790555208592,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T00:00:00Z","timestamp":1623369600000},"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":[[2021,6,11]]},"DOI":"10.1145\/3450569.3463572","type":"proceedings-article","created":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T04:06:33Z","timestamp":1623470793000},"page":"115-124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Secure Aggregation Against Malicious Users"],"prefix":"10.1145","author":[{"given":"Ferhat","family":"Karako\u00e7","sequence":"first","affiliation":[{"name":"Ericsson Research, Istanbul, Turkey"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Melek","family":"\u00d6nen","sequence":"additional","affiliation":[{"name":"EURECOM, Sophia-Antipolis, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zeki","family":"Bilgin","sequence":"additional","affiliation":[{"name":"Ar\u00e7elik Research, Istanbul, Turkey"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"How To Backdoor Federated Learning. CoRR","author":"Bagdasaryan Eugene","year":"2018","unstructured":"Eugene Bagdasaryan, Andreas Veit, Yiqing Hua, Deborah Estrin, and Vitaly Shmatikov. 2018. How To Backdoor Federated Learning. CoRR, Vol. abs\/1807.00459 (2018). arxiv: 1807.00459 http:\/\/arxiv.org\/abs\/1807.00459"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_22"},{"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\/978--3--319--98113-0_25"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"Michael J. Freedman Yuval Ishai Benny Pinkas and Omer Reingold. 2005. Keyword Search and Oblivious Pseudorandom Functions. In TCC. 303--324. https:\/\/doi.org\/10.1007\/978--3--540--30576--7_17","DOI":"10.1007\/978--3--540--30576--7_17"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Yuval Ishai Joe Kilian Kobbi Nissim and Erez Petrank. 2003. Extending Oblivious Transfers Efficiently. In CRYPTO. 145--161. https:\/\/doi.org\/10.1007\/978--3--540--45146--4_9","DOI":"10.1007\/978--3--540--45146--4_9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"M. Joye and Libert B. 2013. A scalable scheme for privacy-preserving aggregation of time-series data. In Financial Cryptography.","DOI":"10.1007\/978-3-642-39884-1_10"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3339252.3339264"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN49398.2020.9209670"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"Vladimir Kolesnikov Naor Matania Benny Pinkas Mike Rosulek and Ni Trieu. 2017. Practical Multi-party Private Set Intersection from Symmetric-Key Techniques. In ACM CCS. 1257--1272. https:\/\/doi.org\/10.1145\/3133956.3134065","DOI":"10.1145\/3133956.3134065"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"I. Leontiadis K. Elkhiyaoui and R. Molva. 2014. Private and Dynamic Time-Series Data Aggregationwith Trust Relaxation. In CANS.","DOI":"10.1007\/978-3-319-12280-9_20"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--26823--1_1"},{"key":"e_1_3_2_1_13_1","volume-title":"How to simulate it - A tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography. CoRR","author":"Lindell Yehuda","year":"2017","unstructured":"Yehuda Lindell. 2017. How to simulate it - A tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography. CoRR (2017)."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017, 20--22","volume":"54","author":"McMahan Brendan","year":"2017","unstructured":"Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Ag\u00fc era 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 (Proceedings of Machine Learning Research), Aarti Singh and Xiaojin (Jerry) Zhu (Eds.), Vol. 54. PMLR, 1273--1282. http:\/\/proceedings.mlr.press\/v54\/mcmahan17a.html"},{"key":"e_1_3_2_1_15_1","volume-title":"Hossein Fereidooni, Samuel Marchal, Markus Miettinen, Azalia Mirhoseini, Ahmad-Reza Sadeghi, Thomas Schneider, and Shaza Zeitouni.","author":"Nguyen Thien Duc","year":"2021","unstructured":"Thien Duc Nguyen, Phillip Rieger, Hossein Yalame, Helen M\u00f6 llering, Hossein Fereidooni, Samuel Marchal, Markus Miettinen, Azalia Mirhoseini, Ahmad-Reza Sadeghi, Thomas Schneider, and Shaza Zeitouni. 2021. FLGUARD: Secure and Private Federated Learning. IACR Cryptol. ePrint Arch., Vol. 2021 (2021), 25. https:\/\/eprint.iacr.org\/2021\/025"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the Network and Distributed System Security Symposium, NDSS 2011","author":"Shi Elaine","year":"2011","unstructured":"Elaine Shi, T.-H. Hubert Chan, Eleanor G. Rieffel, Richard Chow, and Dawn Song. 2011. Privacy-Preserving Aggregation of Time-Series Data. In Proceedings of the Network and Distributed System Security Symposium, NDSS 2011, San Diego, California, USA, 6th February - 9th February 2011. The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2011\/privacy-preserving-aggregation-of-time-series-data"},{"key":"e_1_3_2_1_18_1","volume-title":"Helen: Maliciously Secure Coopetitive Learning for Linear Models","author":"Zheng W.","year":"2019","unstructured":"W. Zheng, R. A. Popa, J. E. Gonzalez, and I. Stoica. 2019. Helen: Maliciously Secure Coopetitive Learning for Linear Models. In IEEE Security and Privacy (S&P)."}],"event":{"name":"SACMAT '21: The 26th ACM Symposium on Access Control Models and Technologies","location":"Virtual Event Spain","acronym":"SACMAT '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 26th ACM Symposium on Access Control Models and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3450569.3463572","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3450569.3463572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:50Z","timestamp":1750193270000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3450569.3463572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,11]]},"references-count":17,"alternative-id":["10.1145\/3450569.3463572","10.1145\/3450569"],"URL":"https:\/\/doi.org\/10.1145\/3450569.3463572","relation":{},"subject":[],"published":{"date-parts":[[2021,6,11]]},"assertion":[{"value":"2021-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}