Projekteja vuodessa
Abstrakti
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a recently introduced combinatorial tool called the degree table. Maximizing the download rate of a polynomial code for SDMM is equivalent to minimizing N, the number of distinct elements in the corresponding degree table. We propose new constructions of degree tables with a low number of distinct elements. These new constructions lead to a general family of polynomial codes for SDMM, which we call GASPr (Gap Additive Secure Polynomial codes) parametrized by an integer r. GASPr outperforms all previously known polynomial codes for SDMM. We also present lower bounds on N and show that GASPr achieves the lower bounds in the case of no server collusion.
Alkuperäiskieli | Englanti |
---|---|
Otsikko | 2019 IEEE Information Theory Workshop, ITW 2019 |
Kustantaja | IEEE |
Sivut | 414-418 |
ISBN (elektroninen) | 9781538669006 |
DOI - pysyväislinkit | |
Tila | Julkaistu - 1 elok. 2019 |
OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisussa |
Tapahtuma | IEEE Information Theory Workshop - Visby, Ruotsi Kesto: 25 elok. 2019 → 28 elok. 2019 |
Workshop
Workshop | IEEE Information Theory Workshop |
---|---|
Lyhennettä | ITW |
Maa/Alue | Ruotsi |
Kaupunki | Visby |
Ajanjakso | 25/08/2019 → 28/08/2019 |
Sormenjälki
Sukella tutkimusaiheisiin 'Degree Tables for Secure Distributed Matrix Multiplication'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.Projektit
- 1 Päättynyt
-
Konstruktion och klassificering av diskreta matematiska strukturer
Östergård, P. (Vastuullinen tutkija)
01/09/2015 → 31/08/2019
Projekti: Academy of Finland: Other research funding