Decentralized Sparse Matrix Multiplication Under Byzantine Attacks

Sara Ghasvarianjahromi; Yauhen Yakimenka; Jörg Kliewer

doi:10.1109/GLOBECOM54140.2023.10437858

Decentralized Sparse Matrix Multiplication Under Byzantine Attacks

Sara Ghasvarianjahromi, Yauhen Yakimenka, Jörg Kliewer

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 language	English (US)
Title of host publication	GLOBECOM 2023 - 2023 IEEE Global Communications Conference
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1723-1728
Number of pages	6
ISBN (Electronic)	9798350310900
DOIs	https://doi.org/10.1109/GLOBECOM54140.2023.10437858
State	Published - 2023
Event	2023 IEEE Global Communications Conference, GLOBECOM 2023 - Kuala Lumpur, Malaysia Duration: Dec 4 2023 → Dec 8 2023

Publication series

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

Conference

Conference	2023 IEEE Global Communications Conference, GLOBECOM 2023
Country/Territory	Malaysia
City	Kuala Lumpur
Period	12/4/23 → 12/8/23

All Science Journal Classification (ASJC) codes

Artificial Intelligence
Computer Networks and Communications
Hardware and Architecture
Signal Processing

Keywords

Distributed matrix multiplication
byzantine attack
decentralized computation
sparse matrices

Access to Document

10.1109/GLOBECOM54140.2023.10437858

Cite this

Ghasvarianjahromi, S., Yakimenka, Y., & Kliewer, J. (2023). Decentralized Sparse Matrix Multiplication Under Byzantine Attacks. In GLOBECOM 2023 - 2023 IEEE Global Communications Conference (pp. 1723-1728). (Proceedings - IEEE Global Communications Conference, GLOBECOM). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOBECOM54140.2023.10437858

@inproceedings{683ad774538b4ff89e8843cb7d86c933,

title = "Decentralized Sparse Matrix Multiplication Under Byzantine Attacks",

abstract = "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.",

keywords = "Distributed matrix multiplication, byzantine attack, decentralized computation, sparse matrices",

author = "Sara Ghasvarianjahromi and Yauhen Yakimenka and J{\"o}rg Kliewer",

note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 2023 IEEE Global Communications Conference, GLOBECOM 2023 ; Conference date: 04-12-2023 Through 08-12-2023",

year = "2023",

doi = "10.1109/GLOBECOM54140.2023.10437858",

language = "English (US)",

series = "Proceedings - IEEE Global Communications Conference, GLOBECOM",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1723--1728",

booktitle = "GLOBECOM 2023 - 2023 IEEE Global Communications Conference",

address = "United States",

}

Ghasvarianjahromi, S, Yakimenka, Y & Kliewer, J 2023, Decentralized Sparse Matrix Multiplication Under Byzantine Attacks. in GLOBECOM 2023 - 2023 IEEE Global Communications Conference. Proceedings - IEEE Global Communications Conference, GLOBECOM, Institute of Electrical and Electronics Engineers Inc., pp. 1723-1728, 2023 IEEE Global Communications Conference, GLOBECOM 2023, Kuala Lumpur, Malaysia, 12/4/23. https://doi.org/10.1109/GLOBECOM54140.2023.10437858

Decentralized Sparse Matrix Multiplication Under Byzantine Attacks. / Ghasvarianjahromi, Sara; Yakimenka, Yauhen; Kliewer, Jörg.
GLOBECOM 2023 - 2023 IEEE Global Communications Conference. Institute of Electrical and Electronics Engineers Inc., 2023. p. 1723-1728 (Proceedings - IEEE Global Communications Conference, GLOBECOM).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Decentralized Sparse Matrix Multiplication Under Byzantine Attacks

AU - Ghasvarianjahromi, Sara

AU - Yakimenka, Yauhen

AU - Kliewer, Jörg

PY - 2023

Y1 - 2023

N2 - 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.

AB - 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.

KW - Distributed matrix multiplication

KW - byzantine attack

KW - decentralized computation

KW - sparse matrices

UR - http://www.scopus.com/inward/record.url?scp=85187393470&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85187393470&partnerID=8YFLogxK

U2 - 10.1109/GLOBECOM54140.2023.10437858

DO - 10.1109/GLOBECOM54140.2023.10437858

M3 - Conference contribution

AN - SCOPUS:85187393470

T3 - Proceedings - IEEE Global Communications Conference, GLOBECOM

SP - 1723

EP - 1728

BT - GLOBECOM 2023 - 2023 IEEE Global Communications Conference

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2023 IEEE Global Communications Conference, GLOBECOM 2023

Y2 - 4 December 2023 through 8 December 2023

ER -

Decentralized Sparse Matrix Multiplication Under Byzantine Attacks

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this