Perfectly Accurate Membership Inference by a Dishonest Central Server in Federated Learning

0Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Pichler, G., Romanelli, M., Vega, L. R., & Piantanida, P. (2024). Perfectly Accurate Membership Inference by a Dishonest Central Server in Federated Learning. IEEE Transactions on Dependable and Secure Computing, 21(4), 4290–4296. https://doi.org/10.1109/TDSC.2023.3326230

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free