Decentralized Sparse Matrix Multiplication Under Byzantine Attacks

Sara Ghasvarianjahromi, Yauhen Yakimenka, Jörg Kliewer

Research output: Chapter in Book/Report/Conference proceedingConference contribution


In this paper, we propose a sparse matrix multiplication in a decentralized setting, where a set of worker nodes wishes to compute a task collaboratively over a logical ring. We consider a subset of Byzantine nodes in the system who want to maliciously corrupt the result by corrupting their own computed blocks. In particular, the main focus of this paper is to compute the result with the least possible distortion by identifying the Byzantine nodes and re-assigning their tasks to the benign nodes. Our results demonstrate the feasibility of our proposed decentralized scheme and provide a trade-off between the computational complexity required at each worker node and the reconstruction distortion.

Original languageEnglish (US)
Title of host publicationGLOBECOM 2023 - 2023 IEEE Global Communications Conference
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9798350310900
StatePublished - 2023
Event2023 IEEE Global Communications Conference, GLOBECOM 2023 - Kuala Lumpur, Malaysia
Duration: Dec 4 2023Dec 8 2023

Publication series

NameProceedings - IEEE Global Communications Conference, GLOBECOM
ISSN (Print)2334-0983
ISSN (Electronic)2576-6813


Conference2023 IEEE Global Communications Conference, GLOBECOM 2023
CityKuala Lumpur

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computer Networks and Communications
  • Hardware and Architecture
  • Signal Processing


  • Distributed matrix multiplication
  • byzantine attack
  • decentralized computation
  • sparse matrices


Dive into the research topics of 'Decentralized Sparse Matrix Multiplication Under Byzantine Attacks'. Together they form a unique fingerprint.

Cite this