General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussaConference article in proceedingsScientificvertaisarvioitu

3 Sitaatiot (Scopus)

Abstrakti

In this paper, a general framework for linear secure distributed matrix multiplication (SDMM) is introduced. The model allows for a neat treatment of straggling and Byzantine servers via a star product interpretation as well as simplified security proofs. Known properties of star products also immediately yield a lower bound for the recovery threshold, as well as an upper bound for the number of colluding workers the system can tolerate. It produces many of the known SDMM schemes as special cases, hence providing unification for the previous literature on the topic. Furthermore, error behavior specific to SDMM is discussed and interleaved codes are proposed as a suitable means for efficient error correction in the proposed model. Analysis of the error correction capability is also provided, largely based on well-known results on interleaved codes.

AlkuperäiskieliEnglanti
Otsikko2022 IEEE Information Theory Workshop, ITW 2022
KustantajaIEEE
Sivut143-148
Sivumäärä6
ISBN (elektroninen)978-1-6654-8341-4
DOI - pysyväislinkit
TilaJulkaistu - 2022
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisussa
TapahtumaIEEE Information Theory Workshop - Mumbai, Intia
Kesto: 1 marrask. 20229 marrask. 2022

Conference

ConferenceIEEE Information Theory Workshop
LyhennettäITW
Maa/AlueIntia
KaupunkiMumbai
Ajanjakso01/11/202209/11/2022

Sormenjälki

Sukella tutkimusaiheisiin 'General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä