Privacy-Preserving Federated Learning via Homomorphic Adversarial Networks

Wenhan Dong, Chao Lin, Xinlei He, Shengmin Xu, Xinyi Huang
12/2/2024
cs.CRcs.AIcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Privacy-preserving federated learning (PPFL) aims to train a global model for multiple clients while maintaining their data privacy. However, current PPFL protocols exhibit one or more of the following insufficiencies: considerable degradation in accuracy, the requirement for sharing keys, and cooperation during the key generation or decryption processes. As a mitigation, we develop the first protocol that utilizes neural networks to implement PPFL, as well as incorporating an Aggregatable Hybrid Encryption scheme tailored to the needs of PPFL. We name these networks as Homomorphic Adversarial Networks (HANs) which demonstrate that neural networks are capable of performing tasks similar to multi-key homomorphic encryption (MK-HE) while solving the problems of key distribution and collaborative decryption. Our experiments show that HANs are robust against privacy attacks. Compared with non-private federated learning, experiments conducted on multiple datasets demonstrate that HANs exhibit a negligible accuracy loss (at most 1.35%). Compared to traditional MK-HE schemes, HANs increase encryption aggregation speed by 6,075 times while incurring a 29.2 times increase in communication overhead.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{dong2024privacypreserving,
  title  = {Privacy-Preserving Federated Learning via Homomorphic Adversarial Networks},
  author = {Wenhan Dong and Chao Lin and Xinlei He and Shengmin Xu and Xinyi Huang},
  year   = {2024},
  eprint = {2412.01650},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.01650v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.01650.svg)](https://codeofpaper.com/paper/2412.01650)

Discussion