Secure Distributed Matrix Multiplication with Precomputation

Ryann Cartor, Rafael G.L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David Karpuk, Alex Sprintson

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

Abstract

We consider the problem of secure distributed ma-trix multiplication in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We show how to construct polynomial schemes for the outer product partitioning which take advantage of the user's ability to precompute, and provide bounds for our technique. We show that precomputation allows for a reduction in the order of the time complexity for the cases where the number of colluding servers is a fixed percentage of the number of servers. Furthermore, with precomputation, any percentage (less than 100%) of collusions can be tolerated, compared to the upper limit of 50% for the case without precomputation.

Original languageEnglish
Title of host publication2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings
PublisherIEEE
Pages2568-2573
Number of pages6
ISBN (Electronic)979-8-3503-8284-6
DOIs
Publication statusPublished - 2024
MoE publication typeA4 Conference publication
EventIEEE International Symposium on Information Theory - Athens, Greece
Duration: 7 Jul 202412 Jul 2024

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
Country/TerritoryGreece
CityAthens
Period07/07/202412/07/2024

Fingerprint

Dive into the research topics of 'Secure Distributed Matrix Multiplication with Precomputation'. Together they form a unique fingerprint.

Cite this