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

Abstract : This paper presents how to adapt Strassen-Winograd matrix multiplication algorithm to the context of secure multiparty computation. We consider that each player owns only one row of both input matrices and learns one row of the product matrix, without revealing their input to other players. After presenting some building block protocols, we describe how to perform a secure execution of Strassen-Winograd. Then, a comparison is made with a variant of the best known algorithm, relaxed to this setting. It first shows that, asymptotically, the communication volume is reduced from O(n 3) to O(n 2.81), as expected. Furthermore, a finer study on the amount of communication shows that the improvement occurs for matrices with dimension as small as n = 81.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger
Contributeur : Clément Pernet <>
Soumis le : mardi 13 novembre 2018 - 10:04:21
Dernière modification le : lundi 18 février 2019 - 13:24:07
Document(s) archivé(s) le : jeudi 14 février 2019 - 12:14:20


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01781554, version 2


Jean-Guillaume Dumas, Pascal Lafourcade, Julio Fenner, David Lucas, Jean-Baptiste Orfila, et al.. Secure Multi-Party Matrix Multiplication Based on Strassen-Winograd Algorithm. 2018. 〈hal-01781554v2〉



Consultations de la notice


Téléchargements de fichiers