Efficient Vertical Federated Learning with Secure Aggregation

Xinchi Qiu, Heng Pan, Wanru Zhao, Chenyang Ma, Pedro Porto Buarque de Gusmão +1 more
5/18/2023
cs.LGcs.AIcs.CR

No confident code implementation found for this paper.

Abstract

The majority of work in privacy-preserving federated learning (FL) has been focusing on horizontally partitioned datasets where clients share the same sets of features and can train complete models independently. However, in many interesting problems, such as financial fraud detection and disease detection, individual data points are scattered across different clients/organizations in vertical federated learning. Solutions for this type of FL require the exchange of gradients between participants and rarely consider privacy and security concerns, posing a potential risk of privacy leakage. In this work, we present a novel design for training vertical FL securely and efficiently using state-of-the-art security modules for secure aggregation. We demonstrate empirically that our method does not impact training performance whilst obtaining 9.1e2 ~3.8e4 speedup compared to homomorphic encryption (HE).

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. Any repos shown below are weak matches — 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{qiu2023efficient,
  title  = {Efficient Vertical Federated Learning with Secure Aggregation},
  author = {Xinchi Qiu and Heng Pan and Wanru Zhao and Chenyang Ma and Pedro Porto Buarque de Gusmão and Nicholas D. Lane},
  year   = {2023},
  eprint = {2305.11236},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.11236v1}
}

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/2305.11236.svg)](https://codeofpaper.com/paper/2305.11236)

Discussion