|
[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]
|