mlsanityData to 7 Oct 2026

Privacy Against Agnostic Inference Attacks in Vertical Federated Learning

arXiv 2302.05545 ↗First posted 10 Feb 2023cs.CR cs.IT cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

A novel form of inference attack in vertical federated learning (VFL) is proposed, where two parties collaborate in training a machine learning (ML) model. Logistic regression is considered for the VFL model. One party, referred to as the active party, possesses the ground truth labels of the samples in the training phase, while the other, referred to as the passive party, only shares a separate set of features corresponding to these samples. It is shown that the active party can carry out inference attacks on both training and prediction phase samples by acquiring an ML model independently trained on the training samples available to them. This type of inference attack does not require the active party to be aware of the score of a specific sample, hence it is referred to as an agnostic inference attack. It is shown that utilizing the observed confidence scores during the prediction phase, before the time of the attack, can improve the performance of the active party's autonomous ML model, and thus improve the quality of the agnostic inference attack. As a countermeasure, privacy-preserving schemes (PPSs) are proposed. While the proposed schemes preserve the utility of the VFL model, they systematically distort the VFL parameters corresponding to the passive party's features. The level of the distortion imposed on the passive party's parameters is adjustable, giving rise to a trade-off between privacy of the passive party and interpretabiliy of the VFL outcomes by the active party. The distortion level of the passive party's parameters could be chosen carefully according to the privacy and interpretabiliy concerns of the passive and active parties, respectively, with the hope of keeping both parties (partially) satisfied. Finally, experimental results demonstrate the effectiveness of the proposed attack and the PPSs.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 40 references that are in the map. First posted on arXiv 10 Feb 2023.

Builds on

12 of 40 references.

References · 12

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2018Federated Learning for Mobile Keyboard Predictioncited by 565
  3. 2019Federated Learning with Differential Privacy: Algorithms and Performance Analysiscited by 528
  4. 2019Privacy-preserving Federated Brain Tumour Segmentationcited by 169
  5. 2019Federated Learning for Emoji Prediction in a Mobile Keyboardcited by 115
  6. 2020Feature Inference Attack on Model Predictions in Vertical Federated Learningcited by 105
  7. 2016Differential Privacy as a Mutual Information Constraintcited by 41
  8. 2019A Quasi-Newton Method Based Vertical Federated Learning Framework for Logistic Regressioncited by 37
  9. 2020Transparency, Auditability and eXplainability of Machine Learning Models in Credit Scoringcited by 26
  10. 2021A Penalty-free Infeasible Approach for a Class of Nonsmooth Optimization Problems over the Stiefel Manifoldcited by 8
  11. 2022Privacy Against Inference Attacks in Vertical Federated Learningcited by 2
  12. 2020Bitvector-aware Query Optimization for Decision Support Queries (extended version)cited by 1

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.