Privacy-Preserving Distributed Algorithm for Sparse Vector Sum
Zhong, Sheng
Bull. Belg. Math. Soc. Simon Stevin, Tome 17 (2010) no. 1, p. 235-242 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We study the following problem: $B_0$ and $B_1$ each has a sparse input vector $V_0$ and $V_1$; for each $j$ we need to decide whether $B_0[j]+B_1[j]>t$. We give a privacy-preserving algorithm, in which $B_0$ and $B_1$ do not need to reveal any information about their input vectors to each other, except the output of algorithm. Our algorithm is highly efficient.
Publié le : 2010-04-15
Classification:  Cryptography,  Distributed Algorithm,  Sparse Vector,  11T71,  94A60 
@article{1274896202,
     author = {Zhong, Sheng},
     title = {Privacy-Preserving Distributed Algorithm for Sparse Vector Sum},
     journal = {Bull. Belg. Math. Soc. Simon Stevin},
     volume = {17},
     number = {1},
     year = {2010},
     pages = { 235-242},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1274896202}
}

Zhong, Sheng. Privacy-Preserving Distributed Algorithm for Sparse Vector Sum. Bull. Belg. Math. Soc. Simon Stevin, Tome 17 (2010) no. 1, pp.  235-242. http://gdmltest.u-ga.fr/item/1274896202/