CRLGDec 1, 2022

HashVFL: Defending Against Data Reconstruction Attacks in Vertical Federated Learning

arXiv:2212.00325v223 citationsh-index: 52
Originality Incremental advance
AI Analysis

This addresses privacy risks in collaborative machine learning for industries using VFL, though it is an incremental improvement over existing secure computation techniques.

The paper tackles the problem of data reconstruction attacks in Vertical Federated Learning (VFL) by proposing HashVFL, which integrates hashing to defend against such attacks while maintaining task performance and reducing label leakage.

Vertical Federated Learning (VFL) is a trending collaborative machine learning model training solution. Existing industrial frameworks employ secure multi-party computation techniques such as homomorphic encryption to ensure data security and privacy. Despite these efforts, studies have revealed that data leakage remains a risk in VFL due to the correlations between intermediate representations and raw data. Neural networks can accurately capture these correlations, allowing an adversary to reconstruct the data. This emphasizes the need for continued research into securing VFL systems. Our work shows that hashing is a promising solution to counter data reconstruction attacks. The one-way nature of hashing makes it difficult for an adversary to recover data from hash codes. However, implementing hashing in VFL presents new challenges, including vanishing gradients and information loss. To address these issues, we propose HashVFL, which integrates hashing and simultaneously achieves learnability, bit balance, and consistency. Experimental results indicate that HashVFL effectively maintains task performance while defending against data reconstruction attacks. It also brings additional benefits in reducing the degree of label leakage, mitigating adversarial attacks, and detecting abnormal inputs. We hope our work will inspire further research into the potential applications of HashVFL.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes