mlsanityData to 14 Oct 2026

Privacy-Preserving Federated Learning over Vertically and Horizontally Partitioned Data for Financial Anomaly Detection

arXiv 2310.19304 ↗First posted 30 Oct 2023cs.CR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

The effective detection of evidence of financial anomalies requires collaboration among multiple entities who own a diverse set of data, such as a payment network system (PNS) and its partner banks. Trust among these financial institutions is limited by regulation and competition. Federated learning (FL) enables entities to collaboratively train a model when data is either vertically or horizontally partitioned across the entities. However, in real-world financial anomaly detection scenarios, the data is partitioned both vertically and horizontally and hence it is not possible to use existing FL approaches in a plug-and-play manner. Our novel solution, PV4FAD, combines fully homomorphic encryption (HE), secure multi-party computation (SMPC), differential privacy (DP), and randomization techniques to balance privacy and accuracy during training and to prevent inference threats at model deployment time. Our solution provides input privacy through HE and SMPC, and output privacy against inference time attacks through DP. Specifically, we show that, in the honest-but-curious threat model, banks do not learn any sensitive features about PNS transactions, and the PNS does not learn any information about the banks' dataset but only learns prediction labels. We also develop and analyze a DP mechanism to protect output privacy during inference. Our solution generates high-utility models by significantly reducing the per-bank noise level while satisfying distributed DP. To ensure high accuracy, our approach produces an ensemble model, in particular, a random forest. This enables us to take advantage of the well-known properties of ensembles to reduce variance and increase accuracy. Our solution won second prize in the first phase of the U.S. Privacy Enhancing Technologies (PETs) Prize Challenge.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 19 of its 57 references that are in the map. First posted on arXiv 30 Oct 2023.

Builds on

19 of 57 references.

References · 19

  1. 2019Advances and Open Problems in Federated Learningcited by 3,046
  2. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,281
  3. 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,538
  4. 2020Label-Only Membership Inference Attackscited by 388
  5. 2020FedML: A Research Library and Benchmark for Federated Machine Learningcited by 300
  6. 2018A Hybrid Approach to Privacy-Preserving Federated Learningcited by 210
  7. 2017Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryptioncited by 176
  8. 2019SecureBoost: A Lossless Federated Learning Frameworkcited by 176
  9. 2020Membership Leakage in Label-Only Exposurescited by 168
  10. 2020Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learningcited by 78
  11. 2020FastSecAgg: Scalable Secure Aggregation for Privacy-Preserving Federated Learningcited by 61
  12. 2020IBM Federated Learning: an Enterprise Framework White Paper V0.1cited by 57
7 more
  1. 2021PyVertical: A Vertical Federated Learning Framework for Multi-headed SplitNNcited by 35
  2. 2018Scalable Graph Learning for Anti-Money Laundering: A First Lookcited by 33
  3. 2021FedV: Privacy-Preserving Federated Learning over Vertically Partitioned Datacited by 31
  4. 2016Decision Tree Classification with Differential Privacy: A Surveycited by 17
  5. 2016Differentially Private Random Decision Forests using Smooth Sensitivitycited by 16
  6. 2022Privacy-preserving record linkage using local sensitive hash and private set intersectioncited by 1
  7. 2023Advancement on Security Applications of Private Intersection Sum Protocolcited by 1

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.