This paper considers a distributed computing framework, where the task of T matrix-vector products is distributed among n worker machines. External adversaries have access to a subset L (the cardinality of which is |L|) of these machines, and can maliciously perturb the result of each of their computations with probability α. To correctly recover each matrixvector product, the master has to identify a set (of a fixed cardinality) of 'unattacked' worker machines. Towards this end, this work proposes four schemes that aim at performing such an identification. These schemes are analyzed and compared under different regimes of (|L|,α) for the two cases when |L| is (1) known or (2) unknown at the master.
|Original language||English (US)|
|Title of host publication||2022 IEEE International Symposium on Information Theory, ISIT 2022|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||6|
|State||Published - 2022|
|Event||2022 IEEE International Symposium on Information Theory, ISIT 2022 - Espoo, Finland|
Duration: Jun 26 2022 → Jul 1 2022
|Name||2022 IEEE International Symposium on Information Theory (ISIT)|
|Conference||2022 IEEE International Symposium on Information Theory, ISIT 2022|
|Period||6/26/22 → 7/1/22|
Bibliographical noteFunding Information:
This research was supported in part by the U.S. National Science Foundation under Grants CCF-1907785 and CCF-1849757. 1This is different from the setting considered in  where the attackers can collaborate with each other.
© 2022 IEEE.