Dual Protocols for Private Multi-party Matrix Multiplication and Trust Computations

Abstract : This paper deals with distributed matrix multiplication. Each player owns only one row of both matrices and wishes to learn about one distinct row of the product matrix, without revealing its input to the other players. We first improve on a weighted average protocol, in order to securely compute a dot-product with a quadratic volume of communications and linear number of rounds. We also propose two dual protocols with five communication rounds, using a Paillier-like underlying homomorphic public key cryptosystem, which is secure in the semi-honest model or secure with high probability in the malicious adversary model. Using cryptographic protocol verification tools, we are able to check the security of both protocols and provide a countermeasure for each attack found by the tools. We also give a generic randomization method to avoid collusion attacks. As an application, we show that this protocol enables a distributed and secure evaluation of trust relationships in a network, for a large class of trust evaluation schemes.
Type de document :
Article dans une revue
Computers and Security, Elsevier, 2017, 71, pp.51-70. 〈10.1016/j.cose.2017.04.013〉
Liste complète des métadonnées

Littérature citée [41 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01497866
Contributeur : Jean-Baptiste Orfila <>
Soumis le : mercredi 29 mars 2017 - 13:48:19
Dernière modification le : jeudi 7 mars 2019 - 12:04:03
Document(s) archivé(s) le : vendredi 30 juin 2017 - 15:12:42

Fichier

matMulDistrib.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Jean-Guillaume Dumas, Pascal Lafourcade, Jean-Baptiste Orfila, Maxime Puys. Dual Protocols for Private Multi-party Matrix Multiplication and Trust Computations. Computers and Security, Elsevier, 2017, 71, pp.51-70. 〈10.1016/j.cose.2017.04.013〉. 〈hal-01497866〉

Partager

Métriques

Consultations de la notice

599

Téléchargements de fichiers

226