Secure Multi-Party Matrix Multiplication Based on Strassen-Winograd Algorithm - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Secure Multi-Party Matrix Multiplication Based on Strassen-Winograd Algorithm

Abstract

This paper presents a secure multiparty computation protocol for the Strassen-Winograd matrix multiplication algorithm. We focus on the setting in which any given player knows only one row (or one block of rows) of both input matrices and learns the corresponding row (or block of rows) of the resulting product matrix. Neither the player initial data, nor the intermediate values, even during the recurrence part of the algorithm, are ever revealed to other players. We use a combination of partial homomorphic encryption schemes and additive masking techniques together with a novel schedule for the location and encryption layout of all intermediate computations to preserve privacy. Compared to state of the art protocols, the asymptotic communication volume of our construction is reduced from O(n^3) to O(n^{2.81}). This improvement in terms of communication volume arises with matrices of dimension as small as n=96 which is confirmed by experiments.
Fichier principal
Vignette du fichier
smc_strassen_pkc.pdf (502.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01781554 , version 1 (30-04-2018)
hal-01781554 , version 2 (13-11-2018)
hal-01781554 , version 3 (03-04-2019)

Identifiers

Cite

Jean-Guillaume Dumas, Pascal Lafourcade, Julio Lopez Fenner, David Lucas, Jean-Baptiste Orfila, et al.. Secure Multi-Party Matrix Multiplication Based on Strassen-Winograd Algorithm. The 14th International Workshop on Security (IWSEC 2019), Aug 2019, Tokyo, Japan. pp.67-88, ⟨10.1007/978-3-030-26834-3_5⟩. ⟨hal-01781554v3⟩
721 View
1487 Download

Altmetric

Share

Gmail Facebook X LinkedIn More