计算机科学
可验证秘密共享
信息隐私
隐私软件
隐私保护
互联网隐私
计算机安全
集合(抽象数据类型)
程序设计语言
作者
Xiaofen Wang,Tao Chen,Hong‐Ning Dai,Long Peng,Haomiao Yang,Zehui Xiong,Willy Susilo
标识
DOI:10.1109/jiot.2025.3561262
摘要
Federated learning allows clients to share model gradients instead of privacy-sensitive data, which can solve the issue of data silos, but lead to the problem of data privacy leakage due to the model gradient revealing the characteristics of the training data. Privacy-preserving federated learning based on homomorphic encryption schemes (HE-based PPFL) can properly solve the issues of participantsfs data privacy leakage, but they encounter some new challenges. Existing PPFL-based single-key homomorphic encryption schemes face the problem that clients can obtain othersf model gradients due to the shared key and PPFL-based multi-key homomorphic encryption schemes face the issues of incomplete privacy protection for models and high communication overhead due to the requirement of the collaborated decryption. Moreover, existing PPFL schemes either assume the server is always honest or the verification method is unreliable and expensive. To tackle these emerging challenges in HE-based PPFL, we propose an enhancing privacy-preserving and verifiable federated learning scheme. Specifically, we first construct a novel multi-key homomorphic encryption algorithm that achieves single-key decryption instead of the collaborated decryption in traditional PPFL-based multi-key homomorphic encryption. Meanwhile, we design a blockchain-based public verification method for the global model by applying a vector homomorphic hash, which can properly solve the issues of unreliable and expensive global model verification of the existing global model verification methods. Formal security analysis shows that the proposed scheme can well provide complete privacy protection and guarantee the integrity of the global model. Extensive experiments demonstrate that the proposed schemes can keep high accuracy (≈95%) compared with existing differential privacy-based PPFL schemes (≤90%). Meanwhile, the proposed schemes can achieve no decryption share size (0MB) compared to existing HE-based PPFL schemes and efficient verification compared wit
科研通智能强力驱动
Strongly Powered by AbleSci AI