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 a protocol 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 ProVerif, a cryptographic protocol verification tool, we are able to check the security of the protocol and provide a countermeasure for each attack found by the tool. We also give a 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.
Liste complète des métadonnées

Cited literature [28 references]  Display  Hide  Download

http://hal.univ-grenoble-alpes.fr/hal-01344750
Contributor : Maxime Puys <>
Submitted on : Wednesday, September 14, 2016 - 10:04:13 AM
Last modification on : Monday, April 8, 2019 - 1:28:02 PM
Document(s) archivé(s) le : Thursday, December 15, 2016 - 12:43:45 PM

File

matMulDistrib.pdf
Files produced by the author(s)

Identifiers

Citation

Jean-Guillaume Dumas, Pascal Lafourcade, Jean-Baptiste Orfila, Maxime Puys. Private Multi-party Matrix Multiplication and Trust Computations. 13th International Conference on Security and Cryptography SECRYPT 16, Jul 2016, Lisbon, Portugal. pp.61-72, ⟨10.5220/0005957200610072⟩. ⟨hal-01344750v2⟩

Share

Metrics

Record views

1088

Files downloads

212