DRAGD: A Federated Unlearning Data Reconstruction Attack Based on Gradient Differences

Bocheng Ju, Junchao Fan, Jiaqi Liu, Xiaolin Chang
7/13/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Federated learning enables collaborative machine learning while preserving data privacy. However, the rise of federated unlearning, designed to allow clients to erase their data from the global model, introduces new privacy concerns. Specifically, the gradient exchanges during the unlearning process can leak sensitive information about deleted data. In this paper, we introduce DRAGD, a novel attack that exploits gradient discrepancies before and after unlearning to reconstruct forgotten data. We also present DRAGDP, an enhanced version of DRAGD that leverages publicly available prior data to improve reconstruction accuracy, particularly for complex datasets like facial images. Extensive experiments across multiple datasets demonstrate that DRAGD and DRAGDP significantly outperform existing methods in data reconstruction.Our work highlights a critical privacy vulnerability in federated unlearning and offers a practical solution, advancing the security of federated unlearning systems in real-world applications.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ju2025dragd,
  title  = {DRAGD: A Federated Unlearning Data Reconstruction Attack Based on Gradient Differences},
  author = {Bocheng Ju and Junchao Fan and Jiaqi Liu and Xiaolin Chang},
  year   = {2025},
  eprint = {2507.09602},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.09602v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.09602.svg)](https://codeofpaper.com/paper/2507.09602)

Discussion