Dual Protocols for Private Multi-party Matrix Multiplication and Trust Computations - Archive ouverte HAL Access content directly
Journal Articles Computers and Security Year : 2017

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.
Fichier principal
Vignette du fichier
matMulDistrib.pdf (311.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01497866 , version 1 (29-03-2017)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More