面向弱信任环境的量子安全联邦学习协议
Post-Quantum Secure Federated Learning Protocol for Weak-Trust Environments
DOI: 10.12677/csa.2026.164121, PDF,   
作者: 何芯雨, 岳笑含:沈阳工业大学信息科学与工程学院,辽宁 沈阳
关键词: 联邦学习量子安全抗串通不可关联性Federated Learning Post-Quantum Security Collusion Resistance Non-Correlation
摘要: 联邦学习虽具“数据不出域”优势,但仍面临梯度泄露、身份关联、串通攻击及量子计算威胁,难以兼顾抗量子、抗串通与不可关联性。为此,本文提出了一种支持抗量子与抗串通的隐私联邦学习协议,旨在为跨机构弱信任环境下的模型训练与数据协作提供安全保障。该方案基于RLWE构建后量子安全的同态加密聚合机制,实现梯度机密性保护;通过加法秘密共享与双混洗服务器设计,实现抗串通安全;结合混洗与虚拟客户端机制,实现身份与梯度的不可关联性。该协议在保障模型效用的同时,实现了后量子安全、抗串通性与匿名性的统一,兼顾安全性与系统性能,提升了协议在复杂现实场景中的可部署性与长期安全稳定性,增强了系统整体的可信性与工程应用价值。
Abstract: Although federated learning has the advantage of “data not leaving the domain”, it still faces issues such as gradient leakage, identity association, collusion attacks, and quantum computing threats, making it difficult to balance anti-quantum, anti-collusion, and non-correlation. Therefore, this paper proposes a privacy federated learning protocol that supports anti-quantum and anti-collusion, aiming to provide security guarantees for model training and data collaboration in cross-institutional weak-trust environments. This scheme is based on RLWE to build a post-quantum secure homomorphic encryption aggregation mechanism, achieving gradient confidentiality protection; through addition secret sharing and double mixing server design, achieving anti-collusion security; combining mixing and virtual client mechanisms, achieving non-correlation between identity and gradient. This protocol ensures the model utility while achieving the unification of post-quantum security, anti-collusion, and anonymity, balancing security and system performance. This improves the deployability and long-term security stability of the protocol in complex real-world scenarios, enhancing the overall reliability and engineering application value of the system.
文章引用:何芯雨, 岳笑含. 面向弱信任环境的量子安全联邦学习协议[J]. 计算机科学与应用, 2026, 16(4): 186-194. https://doi.org/10.12677/csa.2026.164121

参考文献

[1] 罗姚, 魏苏璟, 杨晶, 等. 公立医院数据安全风险治理路径研究[J]. 卫生经济研究, 2025, 42(3): 71-74, 78.
[2] 李莉莎, 谭镇锋. 金融数据共享: 理论、挑战与机制构建[J]. 经济与社会发展, 2024, 22(5): 59-74.
[3] Lim, W.Y.B., Luong, N.C., Hoang, D.T., Jiao, Y., Liang, Y., Yang, Q., et al. (2020) Federated Learning in Mobile Edge Networks: A Comprehensive Survey. IEEE Communications Surveys & Tutorials, 22, 2031-2063. [Google Scholar] [CrossRef
[4] Geiping, J., Bauermeister, H., Dröge, H., et al. (2020) Inverting Gradients-How Easy Is It to Break Privacy in Federated Learning? Advances in Neural Information Processing Systems, 33, 16937-16947.
[5] Mansouri, M., Önen, M., Ben Jaballah, W. and Conti, M. (2023) Sok: Secure Aggregation Based on Cryptographic Schemes for Federated Learning. Proceedings on Privacy Enhancing Technologies, 2023, 140-157. [Google Scholar] [CrossRef
[6] Gentry, C. (2009) Fully Homomorphic Encryption Using Ideal Lattices. Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, Bethesda, 31 May-2 June 2009, 169-178. [Google Scholar] [CrossRef
[7] Behera, S. and Prathuri, J.R. (2024) FPGA-Based Acceleration of K-Nearest Neighbor Algorithm on Fully Homomorphic Encrypted Data. Cryptography, 8, Article 8. [Google Scholar] [CrossRef
[8] Regev, O. (2009) On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. Journal of the ACM, 56, 1-40. [Google Scholar] [CrossRef
[9] Shamir, A. (1979) How to Share a Secret. Communications of the ACM, 22, 612-613. [Google Scholar] [CrossRef
[10] Gascón, A., Ishai, Y., Kelkar, M., Li, B., Ma, Y. and Raykova, M. (2024) Computationally Secure Aggregation and Private Information Retrieval in the Shuffle Model. Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, Salt Lake, 14-18 October 2024, 4122-4136. [Google Scholar] [CrossRef