{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T12:08:01Z","timestamp":1779365281360,"version":"3.53.0"},"reference-count":49,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.comnet.2026.112350","type":"journal-article","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T00:58:33Z","timestamp":1777942713000},"page":"112350","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["FSSA: Fast secure single-server aggregation with optimal communication rounds"],"prefix":"10.1016","volume":"284","author":[{"given":"Fucai","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saif","family":"Al-Kuwari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5702-9897","authenticated-orcid":false,"given":"Haiyan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xingfu","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0463-3329","authenticated-orcid":false,"given":"Penghui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5604-1598","authenticated-orcid":false,"given":"Aiting","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.comnet.2026.112350_b1","series-title":"Federated learning: Strategies for improving communication efficiency","author":"Konecn\u00fd","year":"2016"},{"key":"10.1016\/j.comnet.2026.112350_b2","article-title":"SVFL: Efficient secure aggregation and verification for cross-silo federated learning","author":"Luo","year":"2022","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"5","key":"10.1016\/j.comnet.2026.112350_b3","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1109\/TIFS.2017.2787987","article-title":"Privacy-preserving deep learning via additively homomorphic encryption","volume":"13","author":"Phong","year":"2018","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.comnet.2026.112350_b4","series-title":"2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017","first-page":"3","article-title":"Membership inference attacks against machine learning models","author":"Shokri","year":"2017"},{"key":"10.1016\/j.comnet.2026.112350_b5","series-title":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018","first-page":"619","article-title":"Property inference attacks on fully connected neural networks using permutation invariant representations","author":"Ganju","year":"2018"},{"key":"10.1016\/j.comnet.2026.112350_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2024.110309","article-title":"Client scheduling and bandwidth slicing for multiple federated learning tasks over multiple passive optical networks","volume":"243","author":"Bi","year":"2024","journal-title":"Comput. Netw."},{"key":"10.1016\/j.comnet.2026.112350_b7","series-title":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017","first-page":"1175","article-title":"Practical secure aggregation for privacy-preserving machine learning","author":"Bonawitz","year":"2017"},{"key":"10.1016\/j.comnet.2026.112350_b8","first-page":"742","article-title":"Large-scale secure computation: Multi-party computation for (parallel) RAM programs","volume":"vol. 9216","author":"Boyle","year":"2015"},{"key":"10.1016\/j.comnet.2026.112350_b9","series-title":"Advances in Cryptology - EUROCRYPT \u201999","first-page":"223","article-title":"Public-key cryptosystems based on composite degree residuosity classes","volume":"1592","author":"Paillier","year":"1999"},{"key":"10.1016\/j.comnet.2026.112350_b10","series-title":"Advances in Cryptology - EUROCRYPT 2016","first-page":"735","article-title":"Two round multiparty computation via multi-key FHE","volume":"9666","author":"Mukherjee","year":"2016"},{"key":"10.1016\/j.comnet.2026.112350_b11","series-title":"Annual International Cryptology Conference","first-page":"597","article-title":"Multi-input functional encryption for inner products: Function-hiding realizations and constructions without pairings","author":"Abdalla","year":"2018"},{"key":"10.1016\/j.comnet.2026.112350_b12","series-title":"Communication-computation efficient secure aggregation for federated learning","author":"Choi","year":"2020"},{"issue":"1","key":"10.1016\/j.comnet.2026.112350_b13","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1109\/JSAIT.2021.3054610","article-title":"Turbo-aggregate: Breaking the quadratic aggregation barrier in secure federated learning","volume":"2","author":"So","year":"2021","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112350_b14","doi-asserted-by":"crossref","unstructured":"S. Truex, N. Baracaldo, A. Anwar, T. Steinke, H. Ludwig, R. Zhang, Y. Zhou, A hybrid approach to privacy-preserving federated learning, in: Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security, 2019, pp. 1\u201311.","DOI":"10.1145\/3338501.3357370"},{"key":"10.1016\/j.comnet.2026.112350_b15","series-title":"SAFER: Sparse secure aggregation for federated learning","author":"Beguier","year":"2020"},{"key":"10.1016\/j.comnet.2026.112350_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.cose.2020.101824","article-title":"EaSTFLy: Efficient and secure ternary federated learning","volume":"94","author":"Dong","year":"2020","journal-title":"Comput. Secur."},{"key":"10.1016\/j.comnet.2026.112350_b17","series-title":"28th Annual Network and Distributed System Security Symposium, NDSS 2021, Virtually, February 21-25, 2021","article-title":"POSEIDON: privacy-preserving federated neural network learning","author":"Sav","year":"2021"},{"key":"10.1016\/j.comnet.2026.112350_b18","series-title":"ICC 2019-2019 IEEE International Conference on Communications","first-page":"1","article-title":"Towards efficient and privacy-preserving federated deep learning","author":"Hao","year":"2019"},{"key":"10.1016\/j.comnet.2026.112350_b19","series-title":"Distributed additive encryption and quantization for privacy preserving federated deep learning","author":"Zhu","year":"2020"},{"key":"10.1016\/j.comnet.2026.112350_b20","series-title":"Advances in Cryptology, Proceedings of CRYPTO \u201984","first-page":"242","article-title":"Security of ramp schemes","volume":"196","author":"Blakley","year":"1984"},{"issue":"6","key":"10.1016\/j.comnet.2026.112350_b21","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.comnet.2026.112350_b22","doi-asserted-by":"crossref","unstructured":"J.H. Bell, K.A. Bonawitz, A. Gasc\u00f3n, T. Lepoint, M. Raykova, Secure single-server aggregation with (poly) logarithmic overhead, in: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020, pp. 1253\u20131269.","DOI":"10.1145\/3372297.3417885"},{"key":"10.1016\/j.comnet.2026.112350_b23","doi-asserted-by":"crossref","first-page":"1736","DOI":"10.1109\/TIFS.2020.3043139","article-title":"VeriFL: Communication-efficient and fast verifiable aggregation for federated learning","volume":"16","author":"Guo","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.comnet.2026.112350_b24","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1109\/TIFS.2019.2929409","article-title":"VerifyNet: Secure and verifiable federated learning","volume":"15","author":"Xu","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.comnet.2026.112350_b25","series-title":"2023 IEEE Symposium on Security and Privacy","first-page":"1961","article-title":"Elsa: Secure aggregation for federated learning with malicious actors","author":"Rathee","year":"2023"},{"key":"10.1016\/j.comnet.2026.112350_b26","series-title":"2020 USENIX Annual Technical Conference, USENIX ATC 2020, July 15-17, 2020","first-page":"493","article-title":"BatchCrypt: Efficient homomorphic encryption for cross-silo federated learning","author":"Zhang","year":"2020"},{"key":"10.1016\/j.comnet.2026.112350_b27","unstructured":"H. Fereidooni, S. Marchal, M. Miettinen, A. Mirhoseini, H. M\u00f6llering, T.D.N.P. Rieger, A.-R. Sadeghi, T. Schneider, H. Yalame, S. Zeitouni, SAFELearn: Secure Aggregation for private FEderated Learning (Full Version)."},{"key":"10.1016\/j.comnet.2026.112350_b28","doi-asserted-by":"crossref","unstructured":"R. Xu, N. Baracaldo, Y. Zhou, A. Anwar, H. Ludwig, Hybridalpha: An efficient approach for privacy-preserving federated learning, in: Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security, 2019, pp. 13\u201323.","DOI":"10.1145\/3338501.3357371"},{"issue":"11","key":"10.1016\/j.comnet.2026.112350_b29","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"issue":"11","key":"10.1016\/j.comnet.2026.112350_b30","doi-asserted-by":"crossref","first-page":"2524","DOI":"10.1109\/TPDS.2020.2996273","article-title":"Towards fair and privacy-preserving federated deep models","volume":"31","author":"Lyu","year":"2020","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"6","key":"10.1016\/j.comnet.2026.112350_b31","doi-asserted-by":"crossref","first-page":"1923","DOI":"10.1109\/TPDS.2023.3267897","article-title":"Dap-FL: Federated learning flourishes by adaptive tuning and secure aggregation","volume":"34","author":"Chen","year":"2023","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.comnet.2026.112350_b32","first-page":"304","article-title":"Multiparty homomorphic encryption: From theory to practice.","volume":"2020","author":"Mouchet","year":"2020","journal-title":"IACR Cryptol. EPrint Arch."},{"issue":"3\u20134","key":"10.1016\/j.comnet.2026.112350_b33","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy.","volume":"9","author":"Dwork","year":"2014","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"10.1016\/j.comnet.2026.112350_b34","series-title":"2023 IEEE Symposium on Security and Privacy","first-page":"477","article-title":"Flamingo: Multi-round single-server secure aggregation with applications to private federated learning","author":"Ma","year":"2023"},{"key":"10.1016\/j.comnet.2026.112350_b35","doi-asserted-by":"crossref","unstructured":"P. Mohassel, P. Rindal, ABY3: A mixed protocol framework for machine learning, in: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018, pp. 35\u201352.","DOI":"10.1145\/3243734.3243760"},{"key":"10.1016\/j.comnet.2026.112350_b36","series-title":"International Conference on Machine Learning","first-page":"201","article-title":"Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy","author":"Gilad-Bachrach","year":"2016"},{"key":"10.1016\/j.comnet.2026.112350_b37","series-title":"Falcon: Honest-majority maliciously secure framework for private deep learning","author":"Wagh","year":"2020"},{"key":"10.1016\/j.comnet.2026.112350_b38","series-title":"BLAZE: blazing fast privacy-preserving machine learning","author":"Patra","year":"2020"},{"issue":"12","key":"10.1016\/j.comnet.2026.112350_b39","doi-asserted-by":"crossref","first-page":"3690","DOI":"10.1109\/TPDS.2022.3167434","article-title":"Differentially private Byzantine-robust federated learning","volume":"33","author":"Ma","year":"2022","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.comnet.2026.112350_b40","article-title":"Robust and secure aggregation scheme for federated learning","author":"Tang","year":"2024","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.comnet.2026.112350_b41","series-title":"Advances in Cryptology - EUROCRYPT 2007","first-page":"291","article-title":"Secure computation from random error correcting codes","volume":"vol. 4515","author":"Chen","year":"2007"},{"key":"10.1016\/j.comnet.2026.112350_b42","series-title":"27th IEEE International Conference on Advanced Information Networking and Applications, AINA 2013, Barcelona, Spain, March 25-28, 2013","first-page":"530","article-title":"Secret sharing scheme suitable for cloud computing","author":"Takahashi","year":"2013"},{"issue":"8","key":"10.1016\/j.comnet.2026.112350_b43","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1587\/transfun.E92.A.1808","article-title":"A fast (k, L, n)-threshold ramp secret sharing scheme","volume":"92","author":"Kurihara","year":"2009","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"10.1016\/j.comnet.2026.112350_b44","series-title":"Proceedings of the 24th Annual ACM Symposium on Theory of Computing","first-page":"699","article-title":"Communication complexity of secure computation (extended abstract)","author":"Franklin","year":"1992"},{"issue":"2","key":"10.1016\/j.comnet.2026.112350_b45","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s12095-010-0039-6","article-title":"Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures","volume":"3","author":"Martin","year":"2011","journal-title":"Cryptogr. Commun."},{"issue":"3","key":"10.1016\/j.comnet.2026.112350_b46","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0020-0190(98)00204-X","article-title":"An application of ramp schemes to broadcast encryption","volume":"69","author":"Stinson","year":"1999","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.comnet.2026.112350_b47","series-title":"Advances in Cryptology - ASIACRYPT 2000","first-page":"531","article-title":"Authenticated encryption: Relations among notions and analysis of the generic composition paradigm","volume":"1976","author":"Bellare","year":"2000"},{"key":"10.1016\/j.comnet.2026.112350_b48","doi-asserted-by":"crossref","DOI":"10.1109\/TPDS.2024.3455762","article-title":"Trusted model aggregation with zero-knowledge proofs in federated learning","author":"Ma","year":"2024","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.comnet.2026.112350_b49","series-title":"Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015","first-page":"1737","article-title":"Deep learning with limited numerical precision","volume":"vol. 37","author":"Gupta","year":"2015"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626003622?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626003622?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T11:32:39Z","timestamp":1779363159000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128626003622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":49,"alternative-id":["S1389128626003622"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112350","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"FSSA: Fast secure single-server aggregation with optimal communication rounds","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112350","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"112350"}}