Invertible Polynomial Representation for Private Set Operations
Privacy-Preserving Set Operations (PPSO) are to compute set operations of participants' dataset without revealing any information other than the result. There has been many proposals to construct PPSO protocols with various techniques such as general MPC, polynomial representations, pseudorandom functions, and blind RSA signatures. While the last two techniques are hard to be generalized into multi-party protocols, polynomial representations combining with Additive Homomorphic Encryption (AHE) schemes enable users to have multi-party PPSO protocols for various operations, including set intersection, (over-)threshold set union, element reduction and so on. Among these constructions, set intersection protocols run in a number of rounds, but others run in linear of the number of participants.