{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:34:21Z","timestamp":1780054461759,"version":"3.54.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T00:00:00Z","timestamp":1661299200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T00:00:00Z","timestamp":1661299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2020YFB1600201"],"award-info":[{"award-number":["2020YFB1600201"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U20A20202"],"award-info":[{"award-number":["U20A20202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62090024"],"award-info":[{"award-number":["62090024"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876173"],"award-info":[{"award-number":["61876173"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s11227-022-04745-4","type":"journal-article","created":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T15:03:02Z","timestamp":1661353382000},"page":"2819-2849","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["DHSA: efficient doubly homomorphic secure aggregation for cross-silo federated learning"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8896-8600","authenticated-orcid":false,"given":"Zizhen","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Si","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junfeng","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huawei","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaowei","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,24]]},"reference":[{"key":"4745_CR1","unstructured":"Hard A, Rao K, Mathews R, et al. (2018) Federated learning for mobile keyboard prediction[J]. arXiv preprint arXiv:1811.0360"},{"issue":"2","key":"4745_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3298981","volume":"10","author":"Q Yang","year":"2019","unstructured":"Yang Q, Liu Y, Chen T, Tong Y (2019) Federated machine learning: concept and applications. ACM Trans Intell Syst Technol 10(2):1\u201319","journal-title":"ACM Trans Intell Syst Technol"},{"key":"4745_CR3","doi-asserted-by":"crossref","unstructured":"Kairouz P, McMahan HB, Avent B, Bellet A, Bennis M, Bhagoji AN, Bonawitz K, Charles Z, Cormode G, Cummings R, et\u00a0al. (2021) Advances and open problems in federated learning. Found Trends\u00ae in Mach Learn 14(1\u20132), 1\u2013210","DOI":"10.1561\/2200000083"},{"key":"4745_CR4","doi-asserted-by":"crossref","unstructured":"Nasr M, Shokri R, Houmansadr A (2019) Comprehensive privacy analysis of deep learning: passive and active white-box inference attacks against centralized and federated learning. In: 2019 IEEE symposium on security and privacy (SP), pp 739\u2013753","DOI":"10.1109\/SP.2019.00065"},{"key":"4745_CR5","doi-asserted-by":"crossref","unstructured":"Zhang J, Zhang J, Chen J, Yu S (2020) Gan Enhanced Membership Inference: A Passive Local Attack in Federated Learning. In: ICC 2020 - 2020 IEEE International Conference on Communications (ICC), pp 1\u20136","DOI":"10.1109\/ICC40277.2020.9148790"},{"key":"4745_CR6","unstructured":"Zhang W, Tople S, Ohrimenko O (2021) Leakage of dataset properties in Multi-Party machine learning. In: 30th USENIX security symposium (USENIX Security 21), pp 2687\u20132704"},{"key":"4745_CR7","doi-asserted-by":"crossref","unstructured":"Zhu L, Han S (2020) Deep Leakage from Gradients. Federated learning, pp 17\u201331","DOI":"10.1007\/978-3-030-63076-8_2"},{"key":"4745_CR8","unstructured":"Bonawitz K, Ivanov V, Kreuter B, Marcedone A, McMahan HB, Patel S, Ramage D, Segal A, Seth K Practical secure aggregation for privacy-preserving machine learning. In: CCS, pp 1175\u20131191. ACM"},{"key":"4745_CR9","doi-asserted-by":"crossref","unstructured":"So J, Guler B, Avestimehr AS (2020) Turbo-aggregate: breaking the quadratic aggregation barrier in secure federated learning. IEEE JSAIT","DOI":"10.1109\/JSAIT.2021.3054610"},{"key":"4745_CR10","unstructured":"Kadhe S, Rajaraman N, Koyluoglu OO, Ramchandran K (2020) Fastsecagg: scalable secure aggregation for privacy-preserving federated learning. arXiv preprint arXiv:2009.11248"},{"key":"4745_CR11","doi-asserted-by":"crossref","unstructured":"Bell JH, Bonawitz KA, Gasc\u00f3n A, Lepoint T, Raykova M (2020) Secure single-server aggregation with (poly)logarithmic overhead. CCS \u201920, pp 1253\u20131269","DOI":"10.1145\/3372297.3417885"},{"key":"4745_CR12","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I, Keller M, Larraia E, Pastro V, Scholl P, Smart NP Practical covertly secure mpc for dishonest majority-or: breaking the spdz limits. In: ESORICS, pp 1\u201318. Springer","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"4745_CR13","unstructured":"Zhang C, Li S, Xia J, Wang W, Yan F, Liu Y Batchcrypt: efficient homomorphic encryption for cross-silo federated learning. In: USENIX ATC, pp 493\u2013506"},{"issue":"5","key":"4745_CR14","first-page":"1333","volume":"13","author":"Y Aono","year":"2017","unstructured":"Aono Y, Hayashi T, Wang L, Moriai S (2017) Privacy-preserving deep learning via additively homomorphic encryption. IEEE Trans Inform Foren Secur 13(5):1333\u20131345","journal-title":"IEEE Trans Inform Foren Secur"},{"key":"4745_CR15","doi-asserted-by":"crossref","unstructured":"Truex S, Baracaldo N, Anwar A, Steinke T, Ludwig H, Zhang R, Zhou Y (2019) A hybrid approach to privacy-preserving federated learning. In: AISec, pp 1\u201311","DOI":"10.1145\/3338501.3357370"},{"key":"4745_CR16","unstructured":"Xu R, Baracaldo N, Zhou Y, Anwar A, Ludwig H Hybridalpha: an efficient approach for privacy-preserving federated learning. In: Proceedings of the 12th ACM workshop on artificial intelligence and security, pp 13\u201323"},{"key":"4745_CR17","doi-asserted-by":"crossref","unstructured":"Sav S, Pyrgelis A, Troncoso-Pastoriza JR, Froelicher D, Bossuat J, Sousa JS, Hubaux J (2021) POSEIDON: privacy-preserving federated neural network learning. In: 28th annual network and distributed system security symposium, NDSS 2021, Virtually, February 21-25","DOI":"10.14722\/ndss.2021.24119"},{"key":"4745_CR18","unstructured":"Geyer RC, Klein T, Nabi M (2017) Differentially private federated learning: a client level perspective. arXiv preprint arXiv:.07557"},{"key":"4745_CR19","doi-asserted-by":"crossref","unstructured":"Abadi M, Chu A, Goodfellow I, McMahan HB, Mironov I, Talwar K, Zhang L (2016) Deep Learning with Differential Privacy. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp 308\u2013318","DOI":"10.1145\/2976749.2978318"},{"key":"4745_CR20","doi-asserted-by":"crossref","unstructured":"Sheller M J, Edwards B, Reina G A, et al (2020) Federated learning in medicine: facilitating multi-institutional collaborations without sharing patient data[J]. Sci Rep 10(1):1\u201312","DOI":"10.1038\/s41598-020-69250-1"},{"key":"4745_CR21","unstructured":"Nasr M, Shokri R, Houmansadr A (2018) Comprehensive privacy analysis of deep learning: stand-alone and federated learning under passive and active white-box inference attacks. ArXivabs\/1812.00910"},{"key":"4745_CR22","doi-asserted-by":"crossref","unstructured":"Wang Z, Song M, Zhang Z, Song Y, Wang Q, Qi H (2019) Beyond Inferring Class Representatives: User-Level Privacy Leakage from Federated Learning. In: IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, pp 2512\u20132520","DOI":"10.1109\/INFOCOM.2019.8737416"},{"key":"4745_CR23","unstructured":"Zhao B, Mopuri KR, Bilen H (2020) idlg: improved deep leakage from gradients. arXiv preprint arXiv:2001.02610"},{"key":"4745_CR24","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocols for secure computations. In: 23rd annual symposium on foundations of computer science (sfcs 1982), pp 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"issue":"11","key":"4745_CR25","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11):612\u2013613","journal-title":"Commun ACM"},{"key":"4745_CR26","doi-asserted-by":"crossref","unstructured":"Fouque P-A, Poupard G, Stern J (2001) Sharing decryption in the context of voting or lotteries. In: Cryptography Financial (ed) Frankel Y. Springer, Berlin, Heidelberg, pp 90\u2013104","DOI":"10.1007\/3-540-45472-1_7"},{"key":"4745_CR27","unstructured":"Hardy S, Henecka W, Ivey-Law H, et al (2017) Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption[J]. arXiv preprint arXiv:1711.10677"},{"key":"4745_CR28","doi-asserted-by":"crossref","unstructured":"Paillier P Public-key cryptosystems based on composite degree residuosity classes. In: Eurocrypt, pp 223\u2013238. Springer","DOI":"10.1007\/3-540-48910-X_16"},{"key":"4745_CR29","doi-asserted-by":"publisher","first-page":"323","DOI":"10.2478\/popets-2021-0030","volume":"2","author":"D Froelicher","year":"2021","unstructured":"Froelicher D, Troncoso-Pastoriza JR, Pyrgelis A, Sav S, Sousa JS, Bossuat J-P, Hubaux J-P (2021) Scalable privacy-preserving distributed learning. Proc Priv Enhancing Technol 2:323\u2013347","journal-title":"Proc Priv Enhancing Technol"},{"key":"4745_CR30","doi-asserted-by":"publisher","first-page":"3454","DOI":"10.1109\/TIFS.2020.2988575","volume":"15","author":"K Wei","year":"2020","unstructured":"Wei K, Li J, Ding M, Ma C, Yang HH, Farokhi F, Jin S, Quek TQ, Poor HV (2020) Federated learning with differential privacy: algorithms and performance analysis. IEEE Trans Inf Foren Secur 15:3454\u20133469","journal-title":"IEEE Trans Inf Foren Secur"},{"issue":"5","key":"4745_CR31","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1109\/TDSC.2015.2484326","volume":"14","author":"S Goryczka","year":"2017","unstructured":"Goryczka S, Xiong L (2017) A comprehensive comparison of multiparty secure additions with differential privacy. IEEE Trans Depend Secure Comput 14(5):463\u2013477","journal-title":"IEEE Trans Depend Secure Comput"},{"key":"4745_CR32","first-page":"5693","volume":"33","author":"H Yu","year":"2019","unstructured":"Yu H, Yang S, Zhu S (2019) Parallel restarted sgd with faster convergence and less communication: demystifying why model averaging works for deep learning. Proc AAAI Conf Artif Intell 33:5693\u20135700","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"4745_CR33","doi-asserted-by":"crossref","unstructured":"Boneh D, Lewi K, Montgomery H, et al. (2013) Key homomorphic PRFs and their applications[C]. Annual Cryptology Conference. Springer, Berlin, Heidelberg, pp 410\u2013428","DOI":"10.1007\/978-3-642-40041-4_23"},{"issue":"3","key":"4745_CR34","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht MR, Player R, Scott S (2015) On the concrete hardness of learning with errors. JMC 9(3):169\u2013203","journal-title":"JMC"},{"key":"4745_CR35","first-page":"117","volume":"4","author":"J Ernst","year":"2021","unstructured":"Ernst J, Koch A (2021) Private stream aggregation with labels in the standard model. PETs 4:117\u2013138","journal-title":"PETs"},{"key":"4745_CR36","doi-asserted-by":"crossref","unstructured":"Valovich F (2017) Aggregation of time-series data under differential privacy[C]. International Conference on Cryptology and Information Security in Latin America. Springer, Cham, pp 249\u2013270","DOI":"10.1007\/978-3-030-25283-0_14"},{"key":"4745_CR37","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144"},{"key":"4745_CR38","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim A, Kim M, Song Y (2017) Homomorphic Encryption for Arithmetic of Approximate Numbers. In: International Conference on the Theory and Application of Cryptology and Information Security, pp 409\u2013437 Springer","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"4745_CR39","doi-asserted-by":"crossref","unstructured":"Smart NP, Vercauteren F (2014) Fully homomorphic simd operations. Des Codes Cryptogr 71(1):57\u201381","DOI":"10.1007\/s10623-012-9720-4"},{"key":"4745_CR40","doi-asserted-by":"crossref","unstructured":"Peikert C, Shiehian S (2016) Multi-key fhe from lwe, revisited. In: Hirt M, Smith A (eds) Theory of Cryptography. Springer, Berlin, Heidelberg, pp 217\u2013238","DOI":"10.1007\/978-3-662-53644-5_9"},{"issue":"6","key":"4745_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM 56(6):1\u201340","journal-title":"J ACM"},{"key":"4745_CR42","doi-asserted-by":"crossref","unstructured":"Chen H, Dai W, Kim M, Song Y (2019) Efficient Multi-Key Homomorphic Encryption with Packed Ciphertexts with Application to Oblivious Neural Network Inference. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp 395\u2013412","DOI":"10.1145\/3319535.3363207"},{"key":"4745_CR43","doi-asserted-by":"crossref","unstructured":"Mouchet C, Troncoso-Pastoriza J, Bossuat J P, et al. (2021) Multiparty homomorphic encryption from ring-learning-with-errors[J]. Cryptol ePrint Arch","DOI":"10.2478\/popets-2021-0071"},{"key":"4745_CR44","unstructured":"Xiao H, Rasul K, Vollgraf R (2017) Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747"},{"key":"4745_CR45","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, Sun J (2015) Deep residual learning for image recognition. CoRR: abs\/1512.03385 arXiv:1512.03385","DOI":"10.1109\/CVPR.2016.90"},{"key":"4745_CR46","unstructured":"Krizhevsky A (2009) Learning Multiple Layers of Features from Tiny Images[J]. Master's thesis, University of Tront"},{"key":"4745_CR47","unstructured":"Caldas S, Duddu S M K, Wu P, et al (2018) Leaf: A benchmark for federated settings[J]. arXiv preprint arXiv:1812.01097"},{"issue":"8","key":"4745_CR48","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter S, Schmidhuber J (1997) Long short-term memory. Neural Comput 9(8):1735\u20131780","journal-title":"Neural Comput"},{"key":"4745_CR49","unstructured":"McMahan B, Moore E, Ramage D, Hampson S, y Arcas BA (2017) Communication-efficient learning of deep networks from decentralized data. In: Artificial Intelligence and Statistics, pp 1273\u20131282. PMLR"},{"key":"4745_CR50","doi-asserted-by":"crossref","unstructured":"Banerjee A, Peikert C, Rosen A (2012) Pseudorandom Functions and Lattices. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp 719\u2013737","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"4745_CR51","doi-asserted-by":"crossref","unstructured":"Albrecht M, Chase M, Chen H, Ding J, Goldwasser S, Gorbunov S, Halevi S, Hoffstein J, Laine K, Lauter K et\u00a0al (2021) Homomorphic encryption standard. In: Protecting privacy through homomorphic encryption, pp 31\u201362","DOI":"10.1007\/978-3-030-77287-1_2"},{"key":"4745_CR52","unstructured":"Lattigo v3 (2022) Online: https:\/\/github.com\/tuneinsight\/lattigo. EPFL-LDS, Tune Insight SA"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04745-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04745-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04745-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T04:11:46Z","timestamp":1700971906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04745-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,24]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["4745"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04745-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,24]]},"assertion":[{"value":"30 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}