1.信息工程大学密码工程学院, 河南 郑州 450001
2.密码科学技术国家重点实验室, 北京 100094
[ "杨帆(1996- ),女,天津人,信息工程大学硕士生,主要研究方向为网络与信息安全、可验证计算。" ]
[ "孙奕(1979- ),女,河南郑州人,信息工程大学教授、博士生导师,主要研究方向为网络与信息安全、数据安全交换。" ]
[ "陈性元(1963- ),男,安徽无为人,信息工程大学教授、博士生导师,主要研究方向为网络与信息安全。" ]
[ "高琦(1998- ),男,湖北襄阳人,信息工程大学硕士生,主要研究方向为联邦学习、隐私保护。" ]
收稿:2023-06-21,
修回:2024-03-04,
纸质出版:2024-06-25
移动端阅览
杨帆, 孙奕, 陈性元, 等. 基于同态代理重认证的可验证联邦聚合方法[J]. 网络与信息安全学报, 2024, 10(3): 91-106.
YANG F, SUN Y, CHEN X Y, et al. Verifiable federated aggregation method based on homomorphic proxy re-authentication[J]. Chinese Journal of Network and Information Security, 2024, 10(3): 91-106.
杨帆, 孙奕, 陈性元, 等. 基于同态代理重认证的可验证联邦聚合方法[J]. 网络与信息安全学报, 2024, 10(3): 91-106. DOI: 10.11959/j.issn.2096-109x.2024042.
YANG F, SUN Y, CHEN X Y, et al. Verifiable federated aggregation method based on homomorphic proxy re-authentication[J]. Chinese Journal of Network and Information Security, 2024, 10(3): 91-106. DOI: 10.11959/j.issn.2096-109x.2024042.
联邦学习可以通过共享梯度参数训练模型,但在模型聚合过程中面临恶意服务器进行不诚实数据聚合的风险,同时不受信任的用户参与联邦学习还可能会毒害全局模型,模型训练过程中的可靠性和安全性受到威胁。针对联邦学习中用户不可信、聚合结果不可信等问题,首次引入同态代理重认证,提出了适用于多方聚合计算的双向认证方法,并结合双掩码技术构造了具有隐私保护、高效可信联邦学习聚合方法,不仅可以实现用户对全局模型聚合结果的正确性验证,还能够使聚合服务器完成对用户上传模型来源的可信性验证和模型完整性验证,防止攻击者恶意操控用户破坏安全聚合,同时在验证过程中不会泄露用户隐私数据。通过形式化的安全性分析证明了可验证联邦聚合方法的安全性,有效抵抗了伪造攻击和Sybil攻击,且具有良好的鲁棒性。通过仿真实验进一步表明了所提方法能够在不影响联邦训练的情况下实现聚合结果的可信性验证,且验证不会受到用户中途退出的影响。
Federated learning
capable of training models by sharing gradient parameters
faces the risk of dishonest data aggregation by malicious servers during the model aggregation process. Untrusted users participating in federated learning may also pose a threat by poisoning the global model
thereby compromising the reliability and security of the model training process. To address these issues
homomorphic proxy re-authentication was introduced for the first time to propose a bi-directional authentication method suitable for multi-party aggregation computation. Additionally
a privacy-preserving
efficient
and trustworthy federated learning aggregation method was constructed
combining the double mask technique. This method not only enables users to verify the correctness of global model aggregation results but also allows the aggregation server to assess the trustworthiness and model integrity of the model sources uploaded by the users. It prevents attackers from maliciously manipulating users to disrupt secure aggregation
without leaking users’ private data during the verification process. The security of the verifiable federated aggregation method was demonstrated through formal security analysis
which effectively resists forgery attacks and Sybil attacks
exhibiting good robustness. Simulation experiments further illustrated that the proposed method can achieve credible verification of the aggregation results without impacting federated training. Moreover
the verification process remains unaffected even if users quit in the middle.
MCMAHAN H B , MOORE E , RAMAGE D , et al . Communication-efficient learning of deep networks from decentralized data [J ] . Artificial Intelligence and Statistics . 2017 : 1273 - 1282 .
YANG Q , LIU Y , CHEN T J , et al . Federated machine learning: concept and applications [J ] . ACM Transactions on Intelligent Systems and Technology , 2019 , 10 ( 2 ): 12 .
LI T , SAHU A K , TALWALKAR A , et al . Federated learning: challenges, methods, and future directions [J ] . IEEE Signal Processing Magazine , 2020 , 37 ( 3 ): 50 - 60 .
钱文君 , 沈晴霓 , 吴鹏飞 , 等 . 大数据计算环境下的隐私保护技术研究进展 [J ] . 计算机学报 , 2022 , 45 ( 4 ): 669 - 701 .
QIAN W J , SHEN Q N , WU P F , et al . Research progress on privacy-preserving techniques in big data computing environment [J ] . Chinese Journal of Computers , 2022 , 45 ( 4 ): 669 - 701 .
BONAWITZ K , IVANOV V , KREUTER B , et al . Practical secure aggregation for privacy-preserving machine learning [C ] // Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security . New York : ACM press , 2017 : 1175 - 1191 .
周传鑫 , 孙奕 , 汪德刚 , 等 . 联邦学习研究综述 [J ] . 网络与信息安全学报 , 2021 , 7 ( 5 ): 77 - 92 .
ZHOU C X , SUN Y , WANG D G , et al . Survey of federated learning research [J ] . Chinese Journal of Network and Information Security , 2021 , 7 ( 5 ): 77 - 92 .
XU G W , LI H W , LIU S , et al . VerifyNet: secure and verifiable federated learning [J ] . IEEE Transactions on Information Forensics and Security . 2019 ( 15 ): 911 - 926 .
GUO X J , LIU Z L , LI J , et al . VeriFL: communication-efficient and fast verifiable aggregation for federated learning [J ] . IEEE Transactions on Information Forensics and Security . 2021 , 1809 ( 16 ): 1736 - 1751 .
FUNG C , YOON C J M , Beschastnikh I . The limitations of federated learning in Sybil settings [C ] // Proceedings of the 23rd International Symposium on Research in Attacks, Intrusions and Defenses (RAID 2020 ) . 2020 : 301 - 316 .
REN Y L , LI Y R , FENG G R , et al . Privacy-enhanced and verification-traceable aggregation for federated learning [J ] . IEEE Internet of Things Journa , 2022 , 9 ( 24 ): 24933 - 24948 .
HAHN C , KIM H , KIM M , et al . VerSA: verifiable secure aggregation for cross-device federated learning [J ] . IEEE Transactions on Dependable and Secure Computing . 2023 , 20 ( 1 ): 36 - 52 .
ZHANG Z Z , WU L B , HE D B , et al . G-VCFL: grouped verifiable chained privacy-preserving federated learning [J ] . IEEE Transactions on Network and Service Management , 2022 , 19 ( 4 ): 4219 - 4231 .
FU A M , ZHANG X L , XIONG N X , et al . VFL: a verifiable federated learning with privacy-preserving for big data in industrial IoT [J ] . IEEE Transactions on Industrial Informatics , 2022 , 18 ( 5 ): 3316 - 3326 .
GENNARO R , GENTRY C , PARNO B . Non-interactive verifiable computing: outsourcing computation to untrusted workers [C ] // Proceedings of the Annual Cryptology Conference . Berlin : Springer , 2010 : 465 - 482 .
DEMIREL D , SCHABHÜSER L , BUCHMANN J . Homomorphic authenticators [M ] . Cham : Privately and Publicly Verifiable Computing Techniques , 2017 .
SONG M K , WANG Z B , ZHANG Z F , et al . Analyzing user-level privacy attack against federated learning [J ] . IEEE Journal on Selected Areas in Communications . 2020 , 38 ( 10 ): 2430 - 2444 .
ZHANG J L , CHEN B , CHENG X , et al . PoisonGAN: generative poisoning attacks against federated learning in edge computing systems [J ] . IEEE Internet of Things Journal , 2021 , 8 ( 5 ): 3310 - 3322 .
BLUM M , MICALI S . How to generate cryptographically strong sequences of pseudo random bits [C ] // Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (SFCS ) . Piscataway : IEEE Press , 1982 : 112 - 117 .
DIFFIE W , HELLMAN M . New directions in cryptography [J ] . IEEE Transactions on Information Theory , 1976 , 22 ( 6 ): 644 - 654 .
LI H W , LIU D X , DAI Y S , et al . Enabling efficient multi-keyword ranked search over encrypted mobile cloud data through blind storage [J ] . IEEE Transactions on Emerging Topics in Computing , 2015 , 3 ( 1 ): 127 - 138 .
SHAMIR A . How to share a secret [J ] . Communications of the ACM , 1979 , 22 ( 11 ): 612 - 613 .
DERLER D , RAMACHER S , SLAMANIG D . Homomorphic proxy re-authenticators and applications to verifiable multi-user data aggregation [C ] // Proceedings of the International Conference on Financial Cryptography and Data Security . Cham : Springer , 2017 : 124 - 142 .
BONEH D , FREEMAN D , KATZ J , et al . Signing a linear subspace: signature schemes for network coding [C ] // Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC'09 . New York : ACM press , 2009 : 68 - 87 .
BLAZE M , BLEUMER G , STRAUSS M . Divertible protocols and atomic proxy cryptography [M ] . Berlin : Berlin Heidelberg , 1998 .
0
浏览量
57
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621