Secure and Verifiable Data Collaboration with Low-Cost Zero-Knowledge Proofs
Yizheng Zhu, Yuncheng Wu, Zhaojing Luo, Beng Chin Ooi, Xiaokui Xiao
摘要
Federated Learning (FL) emerges as a viable solution to facilitate data collaboration, enabling multiple clients to collaboratively train a machine learning (ML) model under the supervision of a central server while ensuring the confidentiality of their raw data. However, existing studies have unveiled two main risks: (i) the potential for the server to infer sensitive information from the client's uploaded updates (i.e., model gradients), compromising client input privacy, and (ii) the risk of malicious clients uploading malformed updates to poison the FL model, compromising input integrity. Recent works utilize secure aggregation with zero-knowledge proofs (ZKP) to guarantee input privacy and integrity in FL. Nevertheless, they suffer from extremely low efficiency and, thus, are impractical for real deployment. In this paper, we propose a novel and highly efficient approach RiseFL for secure and verifiable data collaboration, ensuring input privacy and integrity simultaneously. Firstly, we devise a probabilistic integrity check method that transforms strict checks into a hypothesis test problem, offering great optimization opportunities. Secondly, we introduce a hybrid commitment scheme to satisfy Byzantine robustness with improved performance. Thirdly, we present an optimized ZKP generation and verification technique that significantly reduces the ZKP cost based on probabilistic integrity checks. Furthermore, we theoretically prove the security guarantee of RiseFL and provide a cost analysis compared to state-of-the-art baselines. Extensive experiments on synthetic and real-world datasets suggest that our approach is effective and highly efficient in both client computation and communication. For instance, RiseFL is up to 28x, 53x, and 164x faster than baselines ACORN, RoFL, and EIFFeL for the client computation.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- LZKSA: Lattice-Based Special Zero-Knowledge Proofs for Secure Aggregation's Input VerificationZhi Lu, Songfeng LuCCS 2025 · 被引用 2 次
- WhiteCloak: How to Hold Anonymous Malicious Clients Accountable in Secure Aggregation?Zhi Lu, Yongquan Cui, Songfeng LuNDSS 2026
它引用的顶会 Paper28
- Practical Secure Aggregation for Privacy-Preserving Machine LearningKallista A. Bonawitz, Vladimir Ivanov, Ben Kreuter, Antonio Marcedone 等CCS 2017 · 被引用 3,936 次
- TabNet: Attentive Interpretable Tabular LearningSercan Ö. Arik, Tomas PfisterAAAI 2021 · 被引用 2,148 次
- Comprehensive Privacy Analysis of Deep Learning: Passive and Active White-box Inference Attacks against Centralized and Federated LearningMilad Nasr, Reza Shokri, Amir HoumansadrS&P 2019 · 被引用 1,778 次
- Exploiting Unintended Feature Leakage in Collaborative LearningLuca Melis, Congzheng Song, Emiliano De Cristofaro, Vitaly ShmatikovS&P 2019 · 被引用 1,736 次
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra 等S&P 2018 · 被引用 1,285 次
相关 Paper
- Input Integrity and Authentic Results: Towards Trustworthy Aggregation in Federated LearningZhangshuang Guan, Yulin Zhao, Zhiguo Wan, Wei WangINFOCOM 2025 · 被引用 1 次
- EIFFeL: Ensuring Integrity for Federated LearningAmrita Roy Chowdhury, Chuan Guo, Somesh Jha, Laurens van der MaatenCCS 2022 · 被引用 70 次
- ZKSL: Verifiable and Efficient Split Federated Learning via Asynchronous Zero-Knowledge ProofsYixiao Zheng, Changzheng Wei, Xiaodong Qi, Hanghang Wu 等NDSS 2026 · 被引用 1 次
- Label Noise Correction for Federated Learning: A Secure, Efficient and Reliable RealizationHaodi Wang, Tangyu Jiang, Yu Guo, Fangda Guo 等ICDE 2024 · 被引用 7 次
- ELSA: Secure Aggregation for Federated Learning with Malicious ActorsMayank Rathee, Conghao Shen, Sameer Wagh, Raluca Ada PopaS&P 2023
