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

• Published in: IEEE transactions on dependable and secure computing Vol. 21; no. 4; pp. 4290 - 4296
• Main Authors: Pichler, Georg, Romanelli, Marco, Vega, Leonardo Rey, Piantanida, Pablo
• Format: Journal Article
• Language: English
• Published: Washington IEEE 01-07-2024; IEEE Computer Society; Institute of Electrical and Electronics Engineers
• Subjects: Accuracy; Algorithms; Clients; Computer Science; Cryptography; Datasets; Dishonest server; duplicates; Federated learning; Image contrast; Inference; Machine learning; membership inference; Neural networks; Optimized production technology; Privacy; ReLU; Servers; Training; Tutorials; Visual tasks
• ISSN: 1545-5971; 1941-0018
• DOI: 10.1109/TDSC.2023.3326230

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.