This paper proposes Prism, a secret sharing based approach to compute private
set operations (i.e., intersection and union), as well as aggregates over
outsourced databases belonging to multiple owners. Prism enables data owners to
pre-load the data onto non-colluding servers and exploits the additive and
multiplicative properties of secret-shares to compute the above-listed
operations in (at most) two rounds of communication between the servers
(storing the secret-shares) and the querier, resulting in a very efficient
implementation. Also, Prism does not require communication among the servers
and supports result verification techniques for each operation to detect
malicious adversaries. Experimental results show that Prism scales both in
terms of the number of data owners and database sizes, to which prior
approaches do not scale.

Go to Source of this post
Author Of this post: <a href="http://arxiv.org/find/cs/1/au:+Li_Y/0/1/0/all/0/1">Yin Li</a>, <a href="http://arxiv.org/find/cs/1/au:+Ghosh_D/0/1/0/all/0/1">Dhrubajyoti Ghosh</a>, <a href="http://arxiv.org/find/cs/1/au:+Gupta_P/0/1/0/all/0/1">Peeyush Gupta</a>, <a href="http://arxiv.org/find/cs/1/au:+Mehrotra_S/0/1/0/all/0/1">Sharad Mehrotra</a>, <a href="http://arxiv.org/find/cs/1/au:+Panwar_N/0/1/0/all/0/1">Nisha Panwar</a>, <a href="http://arxiv.org/find/cs/1/au:+Sharma_S/0/1/0/all/0/1">Shantanu Sharma</a>

By admin