Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 1116-1128 |
Number of pages | 13 |
Journal | Proceedings of the ACM SIGMOD International Conference on Management of Data |
DOIs | |
State | Published - 2021 |
Externally published | Yes |
Event | 2021 International Conference on Management of Data, SIGMOD 2021 - Virtual, Online, China Duration: Jun 20 2021 → Jun 25 2021 |
All Science Journal Classification (ASJC) codes
- Software
- Information Systems
Keywords
- aggregation operation
- private set intersection
- private set union
- result verification