A Security-Enhanced Federated Learning Scheme Based on Homomorphic Encryption and Secret Sharing

Cong Shen (), Wei Zhang (), Tanping Zhou and Lingling Zhang
Additional contact information
Cong Shen: College of Cryptography Engineering, Engineering University of People’s Armed Police, Xi’an 710086, China
Wei Zhang: College of Cryptography Engineering, Engineering University of People’s Armed Police, Xi’an 710086, China
Tanping Zhou: College of Cryptography Engineering, Engineering University of People’s Armed Police, Xi’an 710086, China
Lingling Zhang: College of Information Engineering, Engineering University of People’s Armed Police, Xi’an 710086, China

Mathematics, 2024, vol. 12, issue 13, 1-20

Abstract: Although federated learning is gaining prevalence in smart sensor networks, substantial risks to data privacy and security persist. An improper application of federated learning techniques can lead to critical privacy breaches. Practical and effective privacy-enhanced federated learning (PEPFL) is a widely used federated learning framework characterized by low communication overhead and efficient encryption and decryption processes. Initially, our analysis scrutinized security vulnerabilities within the PEPFL framework and identified an effective attack strategy. This strategy enables the server to derive private keys from content uploaded by participants, achieving a 100% success rate in extracting participants’ private information. Moreover, when the number of participants does not exceed 300, the attack time does not surpass 3.72 s. Secondly, this paper proposes a federated learning model that integrates homomorphic encryption and secret sharing. By using secret sharing among participants instead of secure multi-party computation, the amount of effective information available to servers is reduced, thereby effectively preventing servers from inferring participants’ private gradients. Finally, the scheme was validated through experiments, and it was found to significantly reduce the inherent collusion risks unique to the federated learning scenario. Moreover, even if some participants are unavailable, the reconstructable nature of secret sharing ensures that the decryption process can continue uninterrupted, allowing the remaining users to proceed with further training. Importantly, our proposed scheme exerts a negligible impact on the accuracy of model training.

Keywords: federated learning; privacy protection; homomorphic encryption; secret sharing (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/13/1993/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/13/1993/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:13:p:1993-:d:1424058

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().