{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:00Z","timestamp":1759335960452,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"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":[[2023,11,26]]},"DOI":"10.1145\/3605759.3625261","type":"proceedings-article","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T22:55:48Z","timestamp":1700693748000},"page":"11-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Falkor: Federated Learning Secure Aggregation Powered by AESCTR GPU Implementation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-6764-1136","authenticated-orcid":false,"given":"Mariya","family":"Georgieva Belorgey","sequence":"first","affiliation":[{"name":"Inpher, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9518-5987","authenticated-orcid":false,"given":"Sofia","family":"Dandjee","sequence":"additional","affiliation":[{"name":"Netlight, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7308-9171","authenticated-orcid":false,"given":"Nicolas","family":"Gama","sequence":"additional","affiliation":[{"name":"SandboxAQ, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1374-5138","authenticated-orcid":false,"given":"Dimitar","family":"Jetchev","sequence":"additional","affiliation":[{"name":"Inpher, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8008-5152","authenticated-orcid":false,"given":"Dmitry","family":"Mikushin","sequence":"additional","affiliation":[{"name":"University of Lausanne, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,11,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SAI"},{"key":"e_1_3_2_1_3_1","volume-title":"Highly Efficient Implementation of Block Ciphers on Graphic Processing Units for Massively Large Data. Applied Sciences 10, 11","author":"An S.-W.","year":"2020","unstructured":"S.-W. An and S.-C. Seo. 2020. Highly Efficient Implementation of Block Ciphers on Graphic Processing Units for Massively Large Data. Applied Sciences 10, 11 (2020)."},{"key":"e_1_3_2_1_4_1","unstructured":"C. Beguier M. Andreux and E. Tramel. 2021. Efficient Sparse Secure Aggregation for Federated Learning. https:\/\/arxiv.org\/pdf\/2007.14861.pdf."},{"key":"e_1_3_2_1_5_1","volume-title":"Secure Single-Server Aggregation with (Poly)Logarithmic Overhead. In CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","author":"Bell J. H.","year":"2020","unstructured":"J. H. Bell, K. A. Bonawitz, A. Gasc\u00f3n, T. Lepoint, and M. Raykova. 2020. Secure Single-Server Aggregation with (Poly)Logarithmic Overhead. In CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA, November 9--13, 2020, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM, 1253--1269."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646128"},{"key":"e_1_3_2_1_7_1","volume-title":"Flower: A Friendly Federated Learning Research Framework. CoRR abs\/2007.14390","author":"Beutel D.","year":"2020","unstructured":"D. Beutel, T. Topal, A. Mathur, X. Qiu, T. Parcollet, and N. Lane. 2020. Flower: A Friendly Federated Learning Research Framework. CoRR abs\/2007.14390 (2020). arXiv:2007.14390 https:\/\/arxiv.org\/abs\/2007.14390"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"e_1_3_2_1_9_1","volume-title":"SEPIA: PrivacyPreserving Aggregation of Multi-Domain Network Events and Statistics. In 19th USENIX Security Symposium","author":"Burkhart M.","year":"2010","unstructured":"M. Burkhart, M. Strasser, D. Many, and X. Dimitropoulos. 2010. SEPIA: PrivacyPreserving Aggregation of Multi-Domain Network Events and Statistics. In 19th USENIX Security Symposium, Washington, DC, USA, August 11--13, 2010, Proceedings. USENIX Association, 223--240. http:\/\/www.usenix.org\/events\/sec10\/tech\/ full_papers\/Burkhart.pdf"},{"key":"e_1_3_2_1_10_1","volume-title":"Peter Wu, Tian Li, Jakub Konen\u00fd, H. Brendan McMahan, Virginia Smith, and Ameet Talwalkar.","author":"Caldas Sebastian","year":"2019","unstructured":"Sebastian Caldas, Sai Meher Karthik Duddu, Peter Wu, Tian Li, Jakub Konen\u00fd, H. Brendan McMahan, Virginia Smith, and Ameet Talwalkar. 2019. LEAF: A Benchmark for Federated Settings. arXiv:1812.01097 [cs.LG]"},{"key":"e_1_3_2_1_11_1","volume-title":"Manticore: Efficient Framework for Scalable Secure Multiparty Computation Protocols. Cryptology ePrint Archive, Report 2021\/200. https:\/\/eprint.iacr.org\/2021\/200.","author":"Carpov S.","year":"2021","unstructured":"S. Carpov, K. Deforth, N. Gama, M. Georgieva, D. Jetchev, J. Katz, I. Leontiadis, M. Mohammadi, A. Sae-Tang, and M. Vuille. 2021. Manticore: Efficient Framework for Scalable Secure Multiparty Computation Protocols. Cryptology ePrint Archive, Report 2021\/200. https:\/\/eprint.iacr.org\/2021\/200."},{"volume-title":"14th USENIX 2017, Aditya Akella and Jon Howell (Eds.). USENIX Association, 259--282. https:\/\/www.usenix.org\/ conference\/nsdi17\/technical-sessions\/presentation\/corrigan-gibbs","author":"Corrigan-Gibbs H.","key":"e_1_3_2_1_12_1","unstructured":"H. Corrigan-Gibbs and D. Boneh. 2017. Prio: Private, Robust, and Scalable Computation of Aggregate Statistics. In 14th USENIX 2017, Aditya Akella and Jon Howell (Eds.). USENIX Association, 259--282. https:\/\/www.usenix.org\/ conference\/nsdi17\/technical-sessions\/presentation\/corrigan-gibbs"},{"key":"e_1_3_2_1_13_1","volume-title":"cuRAND: The API reference guide for cuRAND, the CUDA random number generation library. https:\/\/docs.nvidia.com\/cuda\/curand\/index.html","author":"RAND.","year":"2015","unstructured":"cuRAND. 2015. cuRAND: The API reference guide for cuRAND, the CUDA random number generation library. https:\/\/docs.nvidia.com\/cuda\/curand\/index.html (2015)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3423211.3425685"},{"key":"e_1_3_2_1_15_1","unstructured":"J. Geiping H. Bauermeister H. Dr\u00f6ge and M. Moeller. 2020. Inverting Gradients - How easy is it to break privacy in federated learning?. In Proceding of NeurIPS 2020 Hugo Larochelle Marc'Aurelio Ranzato Raia Hadsell Maria-Florina Balcan and Hsuan-Tien Lin (Eds.). https:\/\/proceedings.neurips.cc\/paper\/2020\/ hash\/c4ede56bbd98819ae6112b20ac6bf145-Abstract.html"},{"key":"e_1_3_2_1_16_1","volume-title":"Twitter sentiment classification using distant supervision. Processing 150 (01","author":"Go Alec","year":"2009","unstructured":"Alec Go, Richa Bhayani, and Lei Huang. 2009. Twitter sentiment classification using distant supervision. Processing 150 (01 2009)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.2.1_131"},{"key":"e_1_3_2_1_18_1","unstructured":"S. Kadhe N. Rajaraman O. Koyluoglu and K. Ramchandran. 2020. FastSecAgg: Scalable Secure Aggregation for Privacy-Preserving Federated Learning. CoRR abs\/2009.11248 (2020). arXiv:2009.11248 https:\/\/arxiv.org\/abs\/2009.11248"},{"key":"e_1_3_2_1_19_1","volume-title":"Advances and Open Problems in Federated Learning. CoRR abs\/1912.04977","author":"Kairouz Peter","year":"2019","unstructured":"Peter Kairouz, H. Brendan McMahan, and al. 2019. Advances and Open Problems in Federated Learning. CoRR abs\/1912.04977 (2019)."},{"key":"e_1_3_2_1_20_1","volume-title":"Federated Optimization: Distributed Machine Learning for On-Device Intelligence. CoRR abs\/1610.02527","author":"Konecn\u00fd J.","year":"2016","unstructured":"J. Konecn\u00fd, H. B. McMahan, D. Ramage, and P. Richt\u00e1rik. 2016. Federated Optimization: Distributed Machine Learning for On-Device Intelligence. CoRR abs\/1610.02527 (2016). arXiv:1610.02527 http:\/\/arxiv.org\/abs\/1610.02527"},{"key":"e_1_3_2_1_21_1","volume-title":"MLMI 2019 (LNCS","volume":"141","author":"Li W.","unstructured":"W. Li, F. Milletar\u00ec, D. Xu, N. Rieke, J. Hancox, W. Zhu, M. Baust, Y. Cheng, S. Ourselin, M. J. Cardoso, and A. Feng. 2019. Privacy-Preserving Federated Brain Tumour Segmentation. In Machine Learning in Medical Imaging - 10th International Workshop, MLMI 2019 (LNCS, Vol. 11861), Heung-Il Suk, Mingxia Liu, Pingkun Yan, and Chunfeng Lian (Eds.). Springer, 133--141. https:\/\/doi.org\/10. 1007\/978--3-030--32692-0_16"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3102980.3102996"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3300053.3319415"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSPC.2007.4728256"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the 20th AISTATS, Aarti Singh and Xiaojin (Jerry) Zhu (Eds.)","volume":"54","author":"McMahan B.","year":"2017","unstructured":"B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. Ag\u00fcera y Arcas. 2017. Communication-Efficient Learning of Deep Networks from Decentralized Data. In Proceedings of the 20th AISTATS, 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_26_1","unstructured":"H. Brendan McMahan Eider Moore Daniel Ramage Seth Hampson and Blaise Ag\u00fcera y Arcas. 2017. Communication-Efficient Learning of Deep Networks from Decentralized Data. arXiv:1602.05629 [cs.LG]"},{"key":"e_1_3_2_1_27_1","volume-title":"Advanced Encryption Standard. NIST FIPS PUB 197","author":"National Institute of Standards and Technology. 2001.","year":"2001","unstructured":"National Institute of Standards and Technology. 2001. Advanced Encryption Standard. NIST FIPS PUB 197 (2001)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"volume-title":"CSPRNG: Cryptographically secure pseudorandom number generators for PyTorch. https:\/\/github.com\/pytorch\/csprng","year":"2020","key":"e_1_3_2_1_29_1","unstructured":"PyTorch. 2020. CSPRNG: Cryptographically secure pseudorandom number generators for PyTorch. https:\/\/github.com\/pytorch\/csprng (2020)."},{"key":"e_1_3_2_1_30_1","volume-title":"Adaptive Federated Optimization. In 9th International Conference on Learning Representations, ICLR 2021","author":"Reddi S. J.","year":"2021","unstructured":"S. J. Reddi, Z. Charles, M. Zaheer, Z. Garrett, K. Rush, J. Konen\u00fd, S. Kumar, and H. Brendan McMahan. 2021. Adaptive Federated Optimization. In 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, May 3--7, 2021. OpenReview.net."},{"key":"e_1_3_2_1_31_1","volume-title":"RAND library for HIP programming language. https:\/\/github. com\/ROCmSoftwarePlatform\/rocRAND","author":"RAND.","year":"2017","unstructured":"rocRAND. 2017. RAND library for HIP programming language. https:\/\/github. com\/ROCmSoftwarePlatform\/rocRAND (2017)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063405"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2019.8852172"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813687"},{"key":"e_1_3_2_1_35_1","first-page":"167","article-title":"Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning","volume":"2020","author":"So J.","year":"2020","unstructured":"J. So, B. Guler, and A. Avestimehr. 2020. Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning. IACR Cryptol. ePrint Arch. 2020 (2020), 167. https:\/\/eprint.iacr.org\/2020\/167","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_36_1","volume-title":"Wu","author":"Tan Sijun","year":"2021","unstructured":"Sijun Tan, Brian Knott, Yuan Tian, and David J. Wu. 2021. CryptGPU: Fast Privacy-Preserving Machine Learning on the GPU. CoRR abs\/2104.10949 (2021). arXiv:2104.10949 https:\/\/arxiv.org\/abs\/2104.10949"},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15","volume":"6165","author":"Tang Hanlin","year":"2019","unstructured":"Hanlin Tang, Chen Yu, Xiangru Lian, Tong Zhang, and Ji Liu. 2019. DoubleSqueeze: Parallel Stochastic Gradient Descent with Double-pass ErrorCompensated Compression. In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15 June 2019, Long Beach, California, USA (Proceedings of Machine Learning Research, Vol. 97), Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.). PMLR, 6155--6165."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3077551"},{"key":"e_1_3_2_1_39_1","volume-title":"Small portable AES128\/192\/256 in C. https:\/\/github.com\/kokke\/ tiny-AES-c","author":"AES.","year":"2020","unstructured":"tinyAES. 2020. Small portable AES128\/192\/256 in C. https:\/\/github.com\/kokke\/ tiny-AES-c (2020)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737416"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-"}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Copenhagen Denmark","acronym":"CCS '23"},"container-title":["Proceedings of the 11th Workshop on Encrypted Computing & Applied Homomorphic Cryptography"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605759.3625261","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3605759.3625261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T18:31:45Z","timestamp":1755973905000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605759.3625261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,26]]},"references-count":41,"alternative-id":["10.1145\/3605759.3625261","10.1145\/3605759"],"URL":"https:\/\/doi.org\/10.1145\/3605759.3625261","relation":{},"subject":[],"published":{"date-parts":[[2023,11,26]]},"assertion":[{"value":"2023-11-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}