{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:49:45Z","timestamp":1774964985110,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T00:00:00Z","timestamp":1772668800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T00:00:00Z","timestamp":1772668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFB3106100"],"award-info":[{"award-number":["2023YFB3106100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172436, 62102452, 6210245"],"award-info":[{"award-number":["62172436, 62102452, 6210245"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2023-JC-YB-584"],"award-info":[{"award-number":["2023-JC-YB-584"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"DOI":"10.1007\/s12083-025-02187-2","type":"journal-article","created":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T11:25:53Z","timestamp":1772709953000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient collusion-resistant and drop-proof federated learning security aggregation scheme based on RLWE"],"prefix":"10.1007","volume":"19","author":[{"given":"Xinyue","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Tanping","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Ke","sequence":"additional","affiliation":[]},{"given":"Zijun","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Weidong","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Xiaoyuan","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,5]]},"reference":[{"issue":"2","key":"2187_CR1","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1109\/TC.2022.3169436","volume":"72","author":"M Xu","year":"2022","unstructured":"Xu M, Zou Z, Cheng Y, Hu Q, Yu D, Cheng X (2022) Spdl: A blockchain-enabled secure and privacy-preserving decentralized learning system. IEEE Trans Comput 72(2):548\u2013558","journal-title":"IEEE Trans Comput"},{"key":"2187_CR2","doi-asserted-by":"publisher","unstructured":"Konen J, Mcmahan HB, Ramage D et al (2016) Federated optimization: distributed machine learning for on-device intelligence. https:\/\/doi.org\/10.48550\/arXiv.1610.02527","DOI":"10.48550\/arXiv.1610.02527"},{"key":"2187_CR3","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) A fully homomorphic encryption scheme. PhD thesis, STANFORD UNIVERSITY","DOI":"10.1145\/1536414.1536440"},{"key":"2187_CR4","unstructured":"Zhang C, Li S, Xia J, Wang W, Yan F, Liu Y (2020) Batchcrypt: efficient homomorphic encryption for cross-silo federated learning. In: USENIX annual technical conference"},{"key":"2187_CR5","doi-asserted-by":"crossref","unstructured":"Dwork C, Mcsherry F, Nissim K, Smith A (2006) Calibrating noise to sensitivity in private data analysis. Proc VLDB Endowment","DOI":"10.1007\/11681878_14"},{"key":"2187_CR6","doi-asserted-by":"crossref","unstructured":"Mart\u00ed Abadi N, Chu A, Goodfellow IJ, Mcmahan HB, Mironov I, Talwar K, Zhang L (2016) Deep learning with differential privacy. ACM","DOI":"10.1145\/2976749.2978318"},{"key":"2187_CR7","unstructured":"Papernot N, Abadi M, Erlingsson L, Goodfellow I, Talwar K (2016) Semi-supervised knowledge transfer for deep learning from private training data"},{"key":"2187_CR8","doi-asserted-by":"crossref","unstructured":"Truex S, Liu L, Chow KH, Gursoy ME, Wei W (2020) Ldp-fed: federated learning with local differential privacy","DOI":"10.1145\/3378679.3394533"},{"key":"2187_CR9","doi-asserted-by":"crossref","unstructured":"Shi L, Gao Y, Chen C, Huang S, Zhao J, Hu X (2025) Privacy-preserving r\u00e9nyi layer-wise budget allocation against gradient leakage for federated learning. IEEE Trans Mobile Comput","DOI":"10.1109\/TMC.2025.3618185"},{"key":"2187_CR10","doi-asserted-by":"publisher","unstructured":"Mohassel P, Zhang Y (2017) Secureml: a system for scalable privacy-preserving machine learning. In: 2017 IEEE Symposium on Security and Privacy (SP), pp 19\u201338. https:\/\/doi.org\/10.1109\/SP.2017.12","DOI":"10.1109\/SP.2017.12"},{"key":"2187_CR11","unstructured":"Cramer R, Damgrd I, Escudero D, Scholl P, Xing C (2018) Spd 2 k : Efficient mpc mod 2 k for dishonest majority. In: International cryptology conference"},{"key":"2187_CR12","doi-asserted-by":"publisher","unstructured":"Ma Y, Woods J, Angel S, Polychroniadou A, Rabin T (2023) Flamingo: multi-round single-server secure aggregation with applications to private federated learning. In: 2023 IEEE Symposium on Security and Privacy (SP), pp 477\u2013496. https:\/\/doi.org\/10.1109\/SP46215.2023.10179434","DOI":"10.1109\/SP46215.2023.10179434"},{"key":"2187_CR13","doi-asserted-by":"publisher","first-page":"2977","DOI":"10.1109\/TIFS.2023.3273914","volume":"18","author":"T Eltaras","year":"2023","unstructured":"Eltaras T, Sabry F, Labda W, Alzoubi K, Ahmedeltaras Q (2023) Efficient verifiable protocol for privacy-preserving aggregation in federated learning. IEEE Trans Inf Forensics Secur 18:2977\u20132990","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"2187_CR14","unstructured":"Stevens T, Skalka C, Vincent C, Ring J, Clark S, Near J (2022) Efficient differentially private secure aggregation for federated learning via hardness of learning with errors. In: 31st USENIX Security Symposium (USENIX Security 22), pp 1379\u20131395. USENIX Association, Boston, MA . https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/stevens"},{"key":"2187_CR15","doi-asserted-by":"crossref","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. Proc Annual ACM Symp Theory Comput 56(6)","DOI":"10.1145\/1568318.1568324"},{"issue":"6","key":"2187_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky V, Peikert C, Regev O (2013) On ideal lattices and learning with errors over rings. J Assoc Comput Mach 60(6):43\u201314335","journal-title":"J Assoc Comput Mach"},{"key":"2187_CR17","doi-asserted-by":"crossref","unstructured":"Lin Z, Li H, Chen X, Xiao M, Huang Q (2024) Identity-based encryption with disjunctive, conjunctive and range keyword search from lattices. IEEE Trans Inf Forensics Secur","DOI":"10.1109\/TIFS.2024.3459646"},{"key":"2187_CR18","doi-asserted-by":"crossref","unstructured":"Yao A (1982) Protocols for secure computations (extended abstract)","DOI":"10.1109\/SFCS.1982.38"},{"key":"2187_CR19","doi-asserted-by":"crossref","unstructured":"Goyal V, Polychroniadou A, Song Y (2022) Sharing transformation anddishonest majority mpc withpacked secret sharing. In: Annual international cryptology conference","DOI":"10.1007\/978-3-031-15985-5_1"},{"key":"2187_CR20","unstructured":"Benaloh JC (1987) Secret sharing homomorphisms: keeping shares of a secret secret"},{"issue":"6","key":"2187_CR21","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MSP.2012.2211477","volume":"29","author":"L Deng","year":"2012","unstructured":"Deng L (2012) The mnist database of handwritten digit images for machine learning research [best of the web]. IEEE Signal Process Mag 29(6):141\u2013142","journal-title":"IEEE Signal Process Mag"},{"key":"2187_CR22","unstructured":"Xiao H, Rasul K, Vollgraf R (2017) Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms"},{"key":"2187_CR23","unstructured":"Krizhevsky A, Hinton G (2009) Learning multiple layers of features from tiny images. Handbook Syst Autoimm Diseases 1(4)"},{"key":"2187_CR24","unstructured":"Netzer Y, Wang T, Coates A, Bissacco A, Wu B, Ng A (2011) Reading digits in natural images with unsupervised feature learning"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-02187-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-025-02187-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-02187-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T12:54:12Z","timestamp":1774961652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-025-02187-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,5]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["2187"],"URL":"https:\/\/doi.org\/10.1007\/s12083-025-02187-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-7093115\/v1","asserted-by":"object"}]},"ISSN":["1936-6450"],"issn-type":[{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,5]]},"assertion":[{"value":"10 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2026","order":3,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"57"}}