Privacy-Preserving Set Union

104 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

An Efficient Toolkit for Computing Private Set Operations (2017, methodology): “[13] O(n) O(n log log n) N Blanton et al.”
Constant-Round Multi-party Private Set Union Using Reversed Laurent Series (2012, background): “Rounds Communication Computation Assumptions Threshold [19] O(n) O(n(2) k τN ) O(n (3)k(2)τNρN ) DCR t < n [11] O(n) O(n(2) k τN ) O(nk (2)τNρN ) DCR t < n Here O(1) O(n(3)k(2)τp) O((n (4)k(2) + n(2)k(2)τp)ρp) none t < n/2 Malicious: Ref.”
Fast and Private Computation of Cardinality of Set Intersection and Union (2012, background): “Additional PSU constructs appear in [21, 16, 36].”
Constant-Round Privacy Preserving Multiset Union (2013, background): “In addition, other types of multiparty computations have followed such as set intersection [5, 6, 8, 9, 13, 14, 20, 24], set element reduction [16], and set union [3, 10, 15, 16].”
Secure Multiparty Computation (2011, unknown): “This has been useful for set operations (which are described in detail in the next section), including [12,13,20].”
Fast Private Set Operations with SEPIA (2012, background): “Moreover, most approaches [13, 14, 10, 25, 19, 9, 27] focus on a few operations and do not provide a complete suite of composable set operations.”