A comprehensive survey of membership inference attacks and defenses in federated learning, proposing update-based and trend-based attack taxonomies and four defense categories.
Perfectly Accurate Membership Inference by a Dishonest Central Server in Federated Learning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Federated Learning is expected to provide strong privacy guarantees, as only gradients or model parameters but no plain text training data is ever exchanged either between the clients or between the clients and the central server. In this paper, we challenge this claim by introducing a simple but still very effective membership inference attack algorithm, which relies only on a single training step. In contrast to the popular honest-but-curious model, we investigate a framework with a dishonest central server. Our strategy is applicable to models with ReLU activations and uses the properties of this activation function to achieve perfect accuracy. Empirical evaluation on visual classification tasks with MNIST, CIFAR10, CIFAR100 and CelebA datasets show that our method provides perfect accuracy in identifying one sample in a training set with thousands of samples. Occasional failures of our method lead us to discover duplicate images in the CIFAR100 and CelebA datasets.
citation-role summary
citation-polarity summary
fields
cs.CR 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Membership Inference Attacks and Defenses in Federated Learning: A Survey
A comprehensive survey of membership inference attacks and defenses in federated learning, proposing update-based and trend-based attack taxonomies and four defense categories.