A typical Vertical Federated Learning (VFL) scenario involves several participants collaboratively training a machine learning model, where each party has different features for the same samples, with labels held exclusively by one party. Since labels contain sensitive information, VFL must ensure the privacy of labels. However, existing VFL-targeted label inference attacks are either limited to specific scenarios or require auxiliary data, rendering them impractical in real-world applications. We introduce a novel Label Enumeration Attack (LEA) that, for the first time, achieves applicability across multiple VFL scenarios and eschews the need for auxiliary data. Our intuition is that an adversary, employing clustering to enumerate mappings between samples and labels, ascertains the accurate label mappings by evaluating the similarity between the benign model and the simulated models trained under each mapping. To achieve that, the first challenge is how to measure model similarity, as models trained on the same data can have different weights. Drawing from our findings, we propose an efficient approach for assessing congruence based on the cosine similarity of the first-round loss gradients, which offers superior efficiency and precision compared to the comparison of parameter similarities. However, the computational cost may be prohibitive due to the necessity of training and comparing the vast number of simulated models generated through enumeration. To overcome this challenge, we propose Binary-LEA from the perspective of reducing the number of models and eliminating futile training, which lowers the number of enumerations from n! to n^3. Moreover, LEA is resilient against common defense mechanisms such as gradient noise and gradient compression.
Figures & tables
Fig. 1 : Flowchart of Vertical Federated Learning.
Attack Scheme
VFL Setting
Model
Support
Protecting
Auxiliary
Number
Computational
Batch-Level
Intermediate
of classes
AggVFL
SplitVFL
LR
NN
Gradients
Results
Requirement
Supported
complexity 1
Direct Label Inference (DLI) [ 5 , 18 ]
✓
×
×
✓
×
×
-
≥2
O(m)
Norm Scoring Attack (NS) [ 18 ]
×
✓
×
✓
×
×
-
=2
O(m)
Direction Scoring Attack (DS) [ 18 ]
×
✓
×
✓
×
×
-
=2
O(m)
Residual Reconstruction Attacks (RR) [ 19 ]
✓
×
✓
×
✓
✓
-
≥2
O(d3)
TABLE I : Label Inference Attacks in VFL.
Fig. 2 : The attack process of LEA.
Fig. 3 : Comparison of attack effects of LEA and PMC using NN models in SplitVFL and AggVFL scenarios under five dataset settings.
Dataset
Scene
Number
Number of
Distribution
Model
Attack Performance
of
Simulated
of
Classes
Models
Features
NAA
CA
ASR 1
Breast Cancer
AggVFL
2
2
28 -2
LR
0.970
0.932
0.946
MLP
0.982
0.932
0.938
19 -9-2
LR
0.963
0.921
0.965
MLP
0.973
0.921
0.947
TABLE II : The attack performance of LEA.
Fig. 4 : The SHAPLEY Value Analysis Chart for the Breast Cancer Dataset.
Fig. 5 : The SHAPLEY Value Analysis Chart for the Give-me-some-credit Dataset.
Scenario
Model
Cosine Similarity
Parameters
First-round loss gradients
Attack
Another 1
Attack
Another
AggVFL
LR
0.908
-0.161
0.996
-0.438
NN
0.945
0.840
0.982
-0.967
SplitVFL
LR
0.705
0.946
0.972
-0.723
NN
0.746
0.690
0.871
-0.695
TABLE III : Comparison of cosine similarity between parameters and first-round loss gradients on Breast Cancer dataset.
Fig. 6 : The impact of different percentage of adversary’s features on cluster accuracy and attack performance in Binary SplitVFL with NN model.
Dataset
Scheme
Time cost (s)
Breast Cancer
LEA
0.3960
Breast Cancer
Binary-LEA
0.4010
Give-me-some-credit
LEA
12.3576
Give-me-some-credit
Binary-LEA
13.6124
MNIST-3
LEA
15.1794
MNIST-3
Binary-LEA
16.1245
TABLE IV : The time cost of Binary-LEA and LEA under various dataset settings in splitVFL scenario.
Fig. 7 : Two defenses against LEA and their impacts. (a)-(c): Noisy Gradients, (d)-(f) Gradient Compression.
Fig. 8 : The defense effectiveness of a label mapping table based defense scheme under different proportions of auxiliary datasets owned by adversaries.
Vertical federated learning (VFL) allows an active party with a top model, and multiple passive parties with bottom models to collaborate. In this scenario, passive parties possessing only features may attempt to infer active party's private labels, making label inference attacks (LIAs) a significant threat. Previous LIA studies have claimed that well-trained bottom models can effectively represent labels. However, we demonstrate that this view is misleading and exposes the vulnerability of existing LIAs. By leveraging mutual information, we present the first observation of the "model compensation" phenomenon in VFL. We theoretically prove that, in VFL, the mutual information between layer outputs and labels increases with layer depth, indicating that bottom models primarily extract feature information while the top model handles label mapping. Building on this insight, we introduce task reassignment to show that the success of existing LIAs actually stems from the distribution alignment between features and labels. When this alignment is disrupted, the performance of LIAs declines sharply or even fails entirely. Furthermore, the implications of this insight for defenses are also investigated. We propose a zero-overhead defense technique based on layer adjustment. Extensive experiments across five datasets and five representative model architectures indicate that shifting cut layers forward to increase the proportion of top model layers in the entire model not only improves resistance to LIAs but also enhances other defenses.
Yige Liu, Dexuan Xu, Zimai Guo +2
Key Laboratory of High Confidence Software Technologies (Peking University), Ministry of Education; School of Computer Science, Peking University, Beijing, China. · Zhongguancun Laboratory, Beijing, China.
As a distributed collaborative machine learning paradigm, vertical federated learning (VFL) allows multiple passive parties with distinct features and one active party with labels to collaboratively train a model. Although it is known for the privacy-preserving capabilities, VFL still faces significant privacy and security threats from backdoor attacks. Existing backdoor attacks typically involve an attacker implanting a trigger into the model during the training phase and executing the attack by adding the trigger to the samples during the inference phase. However, in this paper, we find that triggers are not essential for backdoor attacks in VFL. In light of this, we disclose a new backdoor attack pathway in VFL by introducing a feature-based triggerless backdoor attack. This attack operates under a more stringent security assumption, where the attacker is honest-but-curious rather than malicious during the training phase. It comprises three modules: label inference for the targeted backdoor attack, poison generation with amplification and perturbation mechanisms, and backdoor execution to implement the attack. Extensive experiments on five benchmark datasets demonstrate that our attack outperforms three baseline backdoor attacks by 2 to 50 times while minimally impacting the main task. Even in VFL scenarios with 32 passive parties and only one set of auxiliary data, our attack maintains high performance. Moreover, when confronted with distinct defense strategies, our attack remains largely unaffected and exhibits strong robustness. We hope that the disclosure of this triggerless backdoor attack pathway will encourage the community to revisit security threats in VFL scenarios and inspire researchers to develop more robust and practical defense strategies.
Yige Liu, Yiwei Lou, Che Wang +2
Key Laboratory of High Confidence Software Technologies (Peking University), Ministry of Education; School of Computer Science, Peking University, Beijing, China. · Zhongguancun Laboratory, Beijing, China.
We propose a novel end-to-end privacy-preserving framework, instantiated by three efficient protocols for different deployment scenarios, covering both input and output privacy, for the vertically split scenario in federated learning (FL), where features are split across clients and labels are not shared by all parties. We do so by distributing the role of the aggregator in FL into multiple servers and having them run secure multiparty computation (MPC) protocols to perform model and feature aggregation and apply differential privacy (DP) to the final released model. While a naive solution would have the clients delegating the entirety of training to run in MPC between the servers, our optimized solution, which supports purely global and also global-local models updates with privacy-preserving, drastically reduces the amount of computation and communication performed using multiparty computation. The experimental results also show the effectiveness of our protocols.