Private Membership Aggregation

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.