mlsanityData to 14 Oct 2026

Maximum Knowledge Orthogonality Reconstruction with Gradients in Federated Learning

arXiv 2310.19222 ↗First posted 30 Oct 2023cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Federated learning (FL) aims at keeping client data local to preserve privacy. Instead of gathering the data itself, the server only collects aggregated gradient updates from clients. Following the popularity of FL, there has been considerable amount of work, revealing the vulnerability of FL approaches by reconstructing the input data from gradient updates. Yet, most existing works assume an FL setting with unrealistically small batch size, and have poor image quality when the batch size is large. Other works modify the neural network architectures or parameters to the point of being suspicious, and thus, can be detected by clients. Moreover, most of them can only reconstruct one sample input from a large batch. To address these limitations, we propose a novel and completely analytical approach, referred to as the maximum knowledge orthogonality reconstruction (MKOR), to reconstruct clients' input data. Our proposed method reconstructs a mathematically proven high quality image from large batches. MKOR only requires the server to send secretly modified parameters to clients and can efficiently and inconspicuously reconstruct the input images from clients' gradient updates. We evaluate MKOR's performance on the MNIST, CIFAR-100, and ImageNet dataset and compare it with the state-of-the-art works. The results show that MKOR outperforms the existing approaches, and draws attention to a pressing need for further research on the privacy protection of FL so that comprehensive defense approaches can be developed.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 23 of its 33 references that are in the map. First posted on arXiv 30 Oct 2023.

Builds on

23 of 33 references.

References · 23

  1. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  2. 2019Advances and Open Problems in Federated Learningcited by 3,046
  3. 2016Deep Learning with Differential Privacycited by 2,728
  4. 2019Deep Leakage from Gradientscited by 1,021
  5. 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 712
  6. 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 564
  7. 2018Exploiting Unintended Feature Leakage in Collaborative Learningcited by 520
  8. 2020iDLG: Improved Deep Leakage from Gradientscited by 382
  9. 2021See through Gradients: Image Batch Recovery via GradInversioncited by 326
  10. 2018Beyond Inferring Class Representatives: User-Level Privacy Leakage From Federated Learningcited by 246
  11. 2021Evaluating Gradient Inversion Attacks and Defenses in Federated Learningcited by 196
  12. 2018Protection Against Reconstruction and Its Applications in Private Federated Learningcited by 130
11 more
  1. 2021When the Curious Abandon Honesty: Federated Learning Is Not Privatecited by 127
  2. 2021Robbing the Fed: Directly Obtaining Private Data in Federated Learning with Modified Modelscited by 108
  3. 2020R-GAP: Recursive Gradient Attack on Privacycited by 97
  4. 2020Provable Defense against Privacy Leakage in Federated Learning from Representation Perspectivecited by 94
  5. 2022Fishing for User Data in Large-Batch Federated Learning via Gradient Magnificationcited by 73
  6. 2022Auditing Privacy Defenses in Federated Learning via Generative Gradient Leakagecited by 72
  7. 2021Eluding Secure Aggregation in Federated Learning via Model Inconsistencycited by 67
  8. 2022GradViT: Gradient Inversion of Vision Transformerscited by 53
  9. 2021Gradient Disaggregation: Breaking Privacy in Federated Learning by Reconstructing the User Participant Matrixcited by 43
  10. 2020Privacy-preserving Collaborative Learning with Automatic Transformation Searchcited by 31
  11. 2021User-Level Label Leakage from Gradients in Federated Learningcited by 21

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 1.

4 papers.