Date of Original Version
Abstract or Description
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private input multiset. In order to protect these private sets, the players perform privacy-preserving computation; that is, no party learns more information about other parties’ private input sets than what can be deduced from the result. In this paper, we propose eﬃcient techniques for privacy-preserving operations on multisets. By employing the mathematical properties of polynomials, we build a framework of eﬃcient, secure, and composable multiset operations: the union, intersection, and element reduction operations. We apply these techniques to a wide range of practical problems, achieving more eﬃcient results than those of previous work.