We study the distributed function computation problem with k users of which at most s may be controlled by an adversary and characterize the set of functions of the sources the decoder can reconstruct robustly in the following sense -- if the users behave honestly, the function is recovered with high probability (w.h.p.); if they behave adversarially, w.h.p, either one of the adversarial users will be identified or the function is recovered with vanishingly small distortion.
@article{arxiv.2503.01522,
title = {Byzantine Distributed Function Computation},
author = {Hari Krishnan P. Anilkumar and Neha Sangwan and Varun Narayanan and Vinod M. Prabhakaran},
journal= {arXiv preprint arXiv:2503.01522},
year = {2025}
}