English

Residual-Evasive Attacks on ADMM in Distributed Optimization

Cryptography and Security 2025-04-29 v1 Distributed, Parallel, and Cluster Computing Machine Learning Optimization and Control

Abstract

This paper presents two attack strategies designed to evade detection in ADMM-based systems by preventing significant changes to the residual during the attacked iteration. While many detection algorithms focus on identifying false data injection through residual changes, we show that our attacks remain undetected by keeping the residual largely unchanged. The first strategy uses a random starting point combined with Gram-Schmidt orthogonalization to ensure stealth, with potential for refinement by enhancing the orthogonal component to increase system disruption. The second strategy builds on the first, targeting financial gains by manipulating reactive power and pushing the system to its upper voltage limit, exploiting operational constraints. The effectiveness of the proposed attack-resilient mechanism is demonstrated through case studies on the IEEE 14-bus system. A comparison of the two strategies, along with commonly used naive attacks, reveals trade-offs between simplicity, detectability, and effectiveness, providing insights into ADMM system vulnerabilities. These findings underscore the need for more robust monitoring algorithms to protect against advanced attack strategies.

Keywords

Cite

@article{arxiv.2504.18570,
  title  = {Residual-Evasive Attacks on ADMM in Distributed Optimization},
  author = {Sabrina Bruckmeier and Huadong Mo and James Qin},
  journal= {arXiv preprint arXiv:2504.18570},
  year   = {2025}
}

Comments

10 pages, 12 figures, 2 tables

R2 v1 2026-06-28T23:11:45.617Z