mlsanityData to 7 Oct 2026

FedComm: Federated Learning as a Medium for Covert Communication

arXiv 2201.08786 ↗First posted 21 Jan 2022cs.CR cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Proposed as a solution to mitigate the privacy implications related to the adoption of deep learning, Federated Learning (FL) enables large numbers of participants to successfully train deep neural networks without having to reveal the actual private training data. To date, a substantial amount of research has investigated the security and privacy properties of FL, resulting in a plethora of innovative attack and defense strategies. This paper thoroughly investigates the communication capabilities of an FL scheme. In particular, we show that a party involved in the FL learning process can use FL as a covert communication medium to send an arbitrary message. We introduce FedComm, a novel multi-system covert-communication technique that enables robust sharing and transfer of targeted payloads within the FL framework. Our extensive theoretical and empirical evaluations show that FedComm provides a stealthy communication channel, with minimal disruptions to the training process. Our experiments show that FedComm successfully delivers 100% of a payload in the order of kilobits before the FL procedure converges. Our evaluation also shows that FedComm is independent of the application domain and the neural network architecture used by the underlying FL scheme.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 54 of its 134 references that are in the map. First posted on arXiv 21 Jan 2022.

Builds on

54 of 134 references.

References · 54

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  5. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  6. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
  7. 2019Advances and Open Problems in Federated Learningcited by 3,021
  8. 2016Pointer Sentinel Mixture Modelscited by 2,992
  9. 2016Deep Learning with Differential Privacycited by 2,682
  10. 2016Xception: Deep Learning with Depthwise Separable Convolutionscited by 2,320
  11. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
  12. 2017Targeted Backdoor Attacks on Deep Learning Systems Using Data Poisoningcited by 1,012
38 more
  1. 2018The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networkscited by 847
  2. 2018How To Backdoor Federated Learningcited by 745
  3. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
  4. 2013Speech Recognition with Deep Recurrent Neural Networkscited by 666
  5. 2020Federated Learning with Matched Averagingcited by 564
  6. 2018Fine-Pruning: Defending Against Backdooring Attacks on Deep Neural Networkscited by 550
  7. 2018Exploiting Unintended Feature Leakage in Collaborative Learningcited by 509
  8. 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 479
  9. 2018ML-Leaks: Model and Data Independent Membership Inference Attacks and Defenses on Machine Learning Modelscited by 475
  10. 2018Spectral Signatures in Backdoor Attackscited by 457
  11. 2018Detecting Backdoor Attacks on Deep Neural Networks by Activation Clusteringcited by 429
  12. 2018Invertible Residual Networkscited by 364
  13. 2018Analyzing Federated Learning through an Adversarial Lenscited by 346
  14. 2019Why gradient clipping accelerates training: A theoretical justification for adaptivitycited by 335
  15. 2018Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooringcited by 334
  16. 2017Deep Models Under the GAN: Information Leakage from Collaborative Deep Learningcited by 326
  17. 2020Attack of the Tails: Yes, You Really Can Backdoor Federated Learningcited by 307
  18. 2019Can You Really Backdoor Federated Learning?cited by 250
  19. 2018Machine Learning with Membership Privacy using Adversarial Regularizationcited by 177
  20. 2017Machine Learning Models that Remember Too Muchcited by 165
  21. 2018i-RevNet: Deep Invertible Networkscited by 137
  22. 2013Hacking Smart Machines with Smarter Ones: How to Extract Meaningful Data from Machine Learning Classifierscited by 128
  23. 2017Adversarial Frontier Stitching for Remote Neural Network Watermarkingcited by 110
  24. 2020Unleashing the Tiger: Inference Attacks on Split Learningcited by 104
  25. 2021PPFL: Privacy-preserving Federated Learning with Trusted Execution Environmentscited by 93
  26. 2020An Embarrassingly Simple Approach for Trojan Attack in Deep Neural Networkscited by 92
  27. 2018DRACO: Byzantine-resilient Distributed Training via Redundant Gradientscited by 74
  28. 2018Generating High Fidelity Images with Subscale Pixel Networks and Multidimensional Upscalingcited by 74
  29. 2020Knowledge-Enriched Distributional Model Inversion Attackscited by 65
  30. 2019Federated Learning with Bayesian Differential Privacycited by 60
  31. 2020Leakage of Dataset Properties in Multi-Party Machine Learningcited by 46
  32. 2019DETOX: A Redundancy-based Framework for Faster and More Robust Gradient Aggregationcited by 44
  33. 2017PassGAN: A Deep Learning Approach for Password Guessingcited by 25
  34. 2016Ask the GRU: Multi-Task Learning for Deep Text Recommendationscited by 24
  35. 2019Helen: Maliciously Secure Coopetitive Learning for Linear Modelscited by 20
  36. 2020SWIFT: Super-fast and Robust Privacy-Preserving Machine Learningcited by 20
  37. 2021Membership Inference Attacks are Easier on Difficult Problemscited by 16
  38. 2021PassFlow: Guessing Passwords with Generative Flowscited by 10

50 most cited of 54 All 54 (JSON)

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 1.

3 papers.