Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication

Roberto Assis Machado; Rafael G. L. D’Oliveira; Salim El Rouayheb; Daniel Heinlein

doi:10.1109/REDUNDANCY52534.2021.9606447

Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication

Roberto Assis Machado, Rafael G. L. D’Oliveira, Salim El Rouayheb, Daniel Heinlein

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

Abstrakti

We consider the problem of communication efficient secure distributed matrix multiplication. The previous literature has focused on reducing the number of servers as a proxy for minimizing communication costs. The intuition being that the more servers are used, the higher is the communication cost. We show that this is not the case in general. Our central technique relies on adapting results from the literature on repairing Reed-Solomon codes in which, instead of downloading the whole output of a computing task, a user downloads field traces of it. We present Field Trace Polynomial (FTP) codes, a family of codes, that leverage this technique and characterize regimes for which they outperform existing codes in the literature.

Alkuperäiskieli	Englanti
Otsikko	2021 17th International Symposium Problems of Redundancy in Information and Control Systems, REDUNDANCY 2021
Kustantaja	IEEE
Sivut	188-193
Sivumäärä	6
ISBN (elektroninen)	978-1-6654-3308-2
ISBN (painettu)	978-1-6654-3309-9
DOI - pysyväislinkit	https://doi.org/10.1109/REDUNDANCY52534.2021.9606447
Tila	Julkaistu - 29 lokakuuta 2021
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	International Symposium Problems of Redundancy in Information and Control Systems - Moscow, Venäjä Kesto: 25 lokakuuta 2021 → 29 lokakuuta 2021 Konferenssinumero: 17 https://miem.hse.ru/redundancy2021

Conference

Conference	International Symposium Problems of Redundancy in Information and Control Systems
Lyhennettä	REDUNDANCY
Maa/Alue	Venäjä
Kaupunki	Moscow
Ajanjakso	25/10/2021 → 29/10/2021
www-osoite	https://miem.hse.ru/redundancy2021

Pääsy asiakirjaan

10.1109/REDUNDANCY52534.2021.9606447

Muut tiedostot ja linkit

Linkki julkaisuun Scopuksessa

1 Aktiivinen

Konstruktioner och klassificeringar av delrumskoder och relaterade strukturer för kommunikationsnätverk
Heinlein, D.
01/09/2020 → 31/08/2023
Projekti: Academy of Finland: Other research funding

Siteeraa tätä

@inproceedings{24c87342fa4e4d72a8221ef6c3cd0b1d,

title = "Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication",

abstract = "We consider the problem of communication efficient secure distributed matrix multiplication. The previous literature has focused on reducing the number of servers as a proxy for minimizing communication costs. The intuition being that the more servers are used, the higher is the communication cost. We show that this is not the case in general. Our central technique relies on adapting results from the literature on repairing Reed-Solomon codes in which, instead of downloading the whole output of a computing task, a user downloads field traces of it. We present Field Trace Polynomial (FTP) codes, a family of codes, that leverage this technique and characterize regimes for which they outperform existing codes in the literature.",

keywords = "Reed-Solomon codes, Codes, Costs, Redundancy, Control systems, Servers, Task analysis",

author = "Machado, {Roberto Assis} and D{\textquoteright}Oliveira, {Rafael G. L.} and Rouayheb, {Salim El} and Daniel Heinlein",

year = "2021",

month = oct,

day = "29",

doi = "10.1109/REDUNDANCY52534.2021.9606447",

language = "English",

isbn = "978-1-6654-3309-9",

pages = "188--193",

booktitle = "2021 17th International Symposium Problems of Redundancy in Information and Control Systems, REDUNDANCY 2021",

publisher = "IEEE",

address = "United States",

note = "International Symposium Problems of Redundancy in Information and Control Systems, REDUNDANCY ; Conference date: 25-10-2021 Through 29-10-2021",

url = "https://miem.hse.ru/redundancy2021",

}

Machado, RA, D’Oliveira, RGL, Rouayheb, SE & Heinlein, D 2021, Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication. julkaisussa 2021 17th International Symposium Problems of Redundancy in Information and Control Systems, REDUNDANCY 2021., 9606447, IEEE, Sivut 188-193, International Symposium Problems of Redundancy in Information and Control Systems, Moscow, Venäjä, 25/10/2021. https://doi.org/10.1109/REDUNDANCY52534.2021.9606447

Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication. / Machado, Roberto Assis; D’Oliveira, Rafael G. L.; Rouayheb, Salim El; Heinlein, Daniel.

2021 17th International Symposium Problems of Redundancy in Information and Control Systems, REDUNDANCY 2021. IEEE, 2021. s. 188-193 9606447.

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

TY - GEN

T1 - Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication

AU - Machado, Roberto Assis

AU - D’Oliveira, Rafael G. L.

AU - Rouayheb, Salim El

AU - Heinlein, Daniel

N1 - Conference code: 17

PY - 2021/10/29

Y1 - 2021/10/29

N2 - We consider the problem of communication efficient secure distributed matrix multiplication. The previous literature has focused on reducing the number of servers as a proxy for minimizing communication costs. The intuition being that the more servers are used, the higher is the communication cost. We show that this is not the case in general. Our central technique relies on adapting results from the literature on repairing Reed-Solomon codes in which, instead of downloading the whole output of a computing task, a user downloads field traces of it. We present Field Trace Polynomial (FTP) codes, a family of codes, that leverage this technique and characterize regimes for which they outperform existing codes in the literature.

AB - We consider the problem of communication efficient secure distributed matrix multiplication. The previous literature has focused on reducing the number of servers as a proxy for minimizing communication costs. The intuition being that the more servers are used, the higher is the communication cost. We show that this is not the case in general. Our central technique relies on adapting results from the literature on repairing Reed-Solomon codes in which, instead of downloading the whole output of a computing task, a user downloads field traces of it. We present Field Trace Polynomial (FTP) codes, a family of codes, that leverage this technique and characterize regimes for which they outperform existing codes in the literature.

KW - Reed-Solomon codes

KW - Codes

KW - Costs

KW - Redundancy

KW - Control systems

KW - Servers

KW - Task analysis

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

U2 - 10.1109/REDUNDANCY52534.2021.9606447

DO - 10.1109/REDUNDANCY52534.2021.9606447

M3 - Conference contribution

SN - 978-1-6654-3309-9

SP - 188

EP - 193

BT - 2021 17th International Symposium Problems of Redundancy in Information and Control Systems, REDUNDANCY 2021

PB - IEEE

T2 - International Symposium Problems of Redundancy in Information and Control Systems

Y2 - 25 October 2021 through 29 October 2021

ER -

Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication

Abstrakti

Conference

Pääsy asiakirjaan

Muut tiedostot ja linkit

Sormenjälki

Projektit

Konstruktioner och klassificeringar av delrumskoder och relaterade strukturer för kommunikationsnätverk

Siteeraa tätä