Secure Multi-Party Matrix Multiplication Based on Strassen-Winograd Algorithm
Résumé
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.
Domaines
Cryptographie et sécurité [cs.CR]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...