Integrating zero-knowledge proofs into federated learning: a path to on-chain verifiable and privacy-preserving federated learning frameworks

被引:0
作者
Li, Chunlei [1 ]
Xing, Zhibo [1 ]
Liu, Jiamou [2 ]
Russello, Giovanni [2 ]
Li, Zhen [1 ]
Wu, Yan [1 ]
Li, Meng [3 ]
Asghar, Muhammad Rizwan [4 ]
机构
[1] Beijing Inst Technol, Sch Cyberspace Sci & Technol, Beijing, Peoples R China
[2] Univ Auckland, Sch Comp Sci, Auckland, New Zealand
[3] Hefei Univ Technol, Sch Comp Sci & Informat Engn, Hefei, Peoples R China
[4] Univ Surrey, Sch Comp Sci, Guildford, England
基金
中国国家自然科学基金;
关键词
Zero-knowledge proofs; Federated learning; Blockchain; Verifiability;
D O I
10.1108/ijwis-01-2025-0024; 10.1108/IJWIS-01-2025-0024
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
PurposeThe growing concern over privacy leakage has led to reduced user participation in data sharing, prompting the exploration of novel techniques such as federated learning (FL). Meanwhile, existing FL solutions often overlook the validation of the training process, leaving room for malicious trainers to introduce false or toxic local models, detrimental to the global model's utility. This study aims to propose a zero-knowledge proof-based verifiable federated learning (ZKP-FL) framework on the blockchain.Design/methodology/approachZKP-FL leverages zero-knowledge proofs to verify the extensive local training process without threatening the local privacy. To reduce the memory and runtime overhead, the authors divide the training algorithm to be proven into smaller pieces and generating proofs for each segment. The authors leverage sigma-protocol to ensure the consistency and reliability of these proofs. Moreover, they design a secure model aggregation protocol that matches the local proofs, safeguarding the data privacy of individual local models throughout the process. Furthermore, this aggregation protocol can also guarantee the correctness of the aggregation.FindingsTo establish the effectiveness and security of ZKP-FL, the authors conduct a formal security analysis in terms of completeness, soundness and zero-knowledge properties. Experimental evaluations with different algorithms and models within the ZKP-FL framework demonstrate that with parallel execution the additional proof time per round is minimal.Originality/valueThis paper offers a novel perspective on security and privacy of FL, providing valuable insights that extend the current understanding of verifiable FL. The findings contribute to the ZKP-FL, highlighting areas for future research and practical applications.
引用
收藏
页码:275 / 297
页数:23
相关论文
共 27 条
[1]  
Ahmadi Mojtaba, 2024, 2024 IEEE 3rd International Conference on AI in Cybersecurity (ICAIC), P1, DOI 10.1109/ICAIC60265.2024.10433831
[2]  
Beutel D. J., 2020, arXiv
[3]   Practical Secure Aggregation for Privacy-Preserving Machine Learning [J].
Bonawitz, Keith ;
Ivanov, Vladimir ;
Kreuter, Ben ;
Marcedone, Antonio ;
McMahan, H. Brendan ;
Patel, Sarvar ;
Ramage, Daniel ;
Segal, Aaron ;
Seth, Karn .
CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, :1175-1191
[4]  
Choi SG, 2013, LECT NOTES COMPUT SC, V7785, P499, DOI 10.1007/978-3-642-36594-2_28
[5]  
Damgard Ivan, 2002, Lecture Notes, P84
[6]  
Fisher, 1936, UCI MACHINE LEARNING
[7]  
Gennaro R, 2013, LECT NOTES COMPUT SC, V7881, P626, DOI 10.1007/978-3-642-38348-9_37
[8]  
Ghodsi Z., 2017, P INT C NEUR INF PRO, P4675, DOI DOI 10.5555/3294996.3295220
[9]   On the Size of Pairing-Based Non-interactive Arguments [J].
Groth, Jens .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2016, PT II, 2016, 9666 :305-326
[10]  
Guo Jinxi, 2020, CoRR abs/2012.12700