General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2022 IEEE Information Theory Workshop, ITW 2022
PublisherIEEE
Pages143-148
Number of pages6
ISBN (Electronic)978-1-6654-8341-4
DOIs
Publication statusPublished - 2022
MoE publication typeA4 Conference publication
EventIEEE Information Theory Workshop - Mumbai, India
Duration: 1 Nov 20229 Nov 2022

Conference

ConferenceIEEE Information Theory Workshop
Abbreviated titleITW
Country/TerritoryIndia
CityMumbai
Period01/11/202209/11/2022

Fingerprint

Dive into the research topics of 'General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers'. Together they form a unique fingerprint.

Cite this