IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i13p1993-d1424058.html
   My bibliography  Save this article

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

Author

Listed:
  • 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
    Key Laboratory of Information Security 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
    Key Laboratory of Information Security 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)

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.

Suggested Citation

  • Cong Shen & Wei Zhang & Tanping Zhou & Lingling Zhang, 2024. "A Security-Enhanced Federated Learning Scheme Based on Homomorphic Encryption and Secret Sharing," Mathematics, MDPI, vol. 12(13), pages 1-20, June.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:13:p:1993-:d:1424058
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/13/1993/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/13/1993/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yingjie Tian & Yuqi Zhang & Haibin Zhang, 2023. "Recent Advances in Stochastic Gradient Descent in Deep Learning," Mathematics, MDPI, vol. 11(3), pages 1-23, January.
    2. Zhaosen Shi & Zeyu Yang & Alzubair Hassan & Fagen Li & Xuyang Ding, 2023. "A privacy preserving federated learning scheme using homomorphic encryption and secret sharing," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 82(3), pages 419-433, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Seung-Hwan Lee & Sung-Hak Lee, 2024. "U-Net-Based Learning Using Enhanced Lane Detection with Directional Lane Attention Maps for Various Driving Environments," Mathematics, MDPI, vol. 12(8), pages 1-24, April.
    2. Rulei Qi & Dan Xue & Yujia Zhai, 2024. "A Momentum-Based Adaptive Primal–Dual Stochastic Gradient Method for Non-Convex Programs with Expectation Constraints," Mathematics, MDPI, vol. 12(15), pages 1-26, July.
    3. Vasiliki Rokani & Stavros D. Kaminaris & Petros Karaisas & Dimitrios Kaminaris, 2023. "Power Transformer Fault Diagnosis Using Neural Network Optimization Techniques," Mathematics, MDPI, vol. 11(22), pages 1-33, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:13:p:1993-:d:1424058. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.