Private Membership Aggregation

by   Mohamed Nomeir, et al.

We consider the problem of private membership aggregation (PMA), in which a user counts the number of times a certain element is stored in a system of independent parties that store arbitrary sets of elements from a universal alphabet. The parties are not allowed to learn which element is being counted by the user. Further, neither the user nor the other parties are allowed to learn the stored elements of each party involved in the process. PMA is a generalization of the recently introduced problem of K private set intersection (K-PSI). The K-PSI problem considers a set of M parties storing arbitrary sets of elements, and a user who wants to determine if a certain element is repeated at least at K parties out of the M parties without learning which party has the required element and which party does not. To solve the general problem of PMA, we dissect it into four categories based on the privacy requirement and the collusions among databases/parties. We map these problems into equivalent private information retrieval (PIR) problems. We propose achievable schemes for each of the four variants of the problem based on the concept of cross-subspace alignment (CSA). The proposed schemes achieve linear communication complexity as opposed to the state-of-the-art K-PSI scheme that requires exponential complexity even though our PMA problems contain more security and privacy constraints.


page 1

page 2

page 3

page 4


Multi-Party Private Set Intersection: An Information-Theoretic Approach

We investigate the problem of multi-party private set intersection (MP-P...

DP-PSI: Private and Secure Set Intersection

One way to classify private set intersection (PSI) for secure 2-party co...

Multi-party Private Set Operations with an External Decider

A Private Set Operation (PSO) protocol involves at least two parties wit...

Earn While You Reveal: Private Set Intersection that Rewards Participants

In Private Set Intersection protocols (PSIs), a non-empty result always ...

Vertical Federated Learning without Revealing Intersection Membership

Vertical Federated Learning (vFL) allows multiple parties that own diffe...

Private Information Retrieval and Its Applications: An Introduction, Open Problems, Future Directions

Private information retrieval (PIR) is a privacy setting that allows a u...

Interleaved group products

Let G be the special linear group SL(2,q). We show that if (a_1,...,a_t)...

Please sign up or login with your details

Forgot password? Click here to reset