Dual protocols for private multi-party matrix multiplication and trust computations. Issue 71 (November 2017)

• Record Type: Journal Article
• Authors: Dumas, Jean-Guillaume; Lafourcade, Pascal; Orfila, Jean-Baptiste; Puys, Maxime
• Is Part Of: Computers & security. Issue 71(2017)
• Page Start: 51
• Page End: 70
• Publication Date: 2017-11
• Subjects: Secure Multiparty Computation (MPC) -- Distributed Matrix Multiplication -- Trust evaluation -- Proverif -- AVISPA; Computer security -- Periodicals; Electronic data processing departments -- Security measures -- Periodicals; 005.805
• DOI: 10.1016/j.cose.2017.04.013
• Languages: English
• ISSNs: 0167-4048

Abstract

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.