Title | ||
---|---|---|
A Collusion-Resistant Distributed Scalar Product Protocol with Application to Privacy-Preserving Computation of Trust |
Abstract | ||
---|---|---|
Private scalar product protocols have proved to beinteresting in various applications such as data mining, data integration, trust computing, etc. In 2007, Yao et al. proposed a distributed scalar product protocol with application to privacy-preserving computation of trust [1]. This protocol is split in two phases: an homorphic encryption computation; and a private multi-party summation protocol. The summation protocol has two drawbacks: first, it generates a non-negligible communication overhead; and second, it introduces a security flaw.The contribution of this present paper is two-fold. We first prove that the protocol of [1] is not secure in the semi-honest model by showing that it is not resistant to collusion attacks and we give an example of a collusion attack, with only four participants. Second, we propose to use a superposed sending round as an alternative to the multi-party summation protocol, which results in better security properties and in a reduction of the communication costs. In particular, regarding security, we show that the previous scheme was vulnerable to collusions of three users whereas in our proposal we can fix t [1..n − 1] and define a protocol resisting to collusions of up to t users. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/NCA.2009.48 | NCA |
Keywords | Field | DocType |
better security property,data mining,summation protocol,scalar product protocol,communication cost,private multi-party summation protocol,collusion attack,data integration,multi-party summation protocol,private scalar product protocol,privacy-preserving computation,computational modeling,bismuth,protocols,collaboration,distributed computing,computer applications,telephony,cryptographic protocols,generators,cryptography,secure multi party computation,data privacy,scalar product,trusted computing,security,data integrity,computer networks | Secure multi-party computation,Cryptographic protocol,Computer science,Cryptography,Computer network,Otway–Rees protocol,Theoretical computer science,Encryption,Information privacy,Collusion,Universal composability | Conference |
Citations | PageRank | References |
5 | 0.47 | 20 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Carlos Aguilar Melchor | 1 | 266 | 20.27 |
Boussad Ait-Salem | 2 | 8 | 0.86 |
Philippe Gaborit | 3 | 700 | 56.29 |