Defending Against Inference and Backdoor Attacks in Vertical Federated Learning via Mutual Information Regularization

Vertical Federated Learning (VFL) is widely utilized in real-world applications to enable collaborative learning while protecting local data and models. However, previous works show that parties without labels (passive parties) in VFL can infer the sensitive label or feature information owned by the party with labels (active party), or execute backdoor attacks. Meanwhile, active party can also infer sensitive feature or attribute information from passive party. All these pose great challenges to VFL systems. Former defense methods tend to experience either a loss in overall effectiveness or are too specialized for specific tasks. In this work, we propose a novel method and a unified framework for defending various attacks in VFL altogether, namely Mutual Information Regularization Defense (MID), which limits the mutual information between private raw data and intermediate outputs to achieve a consistently better trade-off between model utility and privacy. We provide both theoretical and experimental evidence to confirm the effectiveness of our MID framework in defending against a wide range of label and feature inference attacks, along with backdoor attacks in VFL. These showcase its promising potential as a versatile and effective defense mechanism, not tied to any specific task.

Authors

Institutions

Publication Details

Published
2024-12-15
DOI
https://doi.org/10.1109/bigdata62323.2024.10825545
Citations
3
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
1.04
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Defending Against Inference and Backdoor Attacks in Vertical Federated Learning via Mutual Information Regularization

Ye Ouyang, Tianyuan Zou, Ya-Qin Zhang, Yang Liu et al.
3 citations
Privacy-Preserving Technologies in Data
1.04
article

Defending Against Inference and Backdoor Attacks in Vertical Federated Learning via Mutual Information Regularization

Ye Ouyang, Tianyuan Zou, Ya-Qin Zhang, Yang Liu, Xiaozhou Ye
article en
3 citations

Abstract

Vertical Federated Learning (VFL) is widely utilized in real-world applications to enable collaborative learning while protecting local data and models. However, previous works show that parties without labels (passive parties) in VFL can infer the sensitive label or feature information owned by the party with labels (active party), or execute backdoor attacks. Meanwhile, active party can also infer sensitive feature or attribute information from passive party. All these pose great challenges to VFL systems. Former defense methods tend to experience either a loss in overall effectiveness or are too specialized for specific tasks. In this work, we propose a novel method and a unified framework for defending various attacks in VFL altogether, namely Mutual Information Regularization Defense (MID), which limits the mutual information between private raw data and intermediate outputs to achieve a consistently better trade-off between model utility and privacy. We provide both theoretical and experimental evidence to confirm the effectiveness of our MID framework in defending against a wide range of label and feature inference attacks, along with backdoor attacks in VFL. These showcase its promising potential as a versatile and effective defense mechanism, not tied to any specific task.

Tsinghua University (CN)
Reduced inequalities
Openalex Percentile: Top 18%
Privacy-Preserving Technologies in Data
1.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.