Privacy-Preserving Set Operations

  • Lea Kissner
  • Dawn Song
Conference paper

DOI: 10.1007/11535218_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3621)
Cite this paper as:
Kissner L., Song D. (2005) Privacy-Preserving Set Operations. In: Shoup V. (eds) Advances in Cryptology – CRYPTO 2005. CRYPTO 2005. Lecture Notes in Computer Science, vol 3621. Springer, Berlin, Heidelberg


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 efficient techniques for privacy-preserving operations on multisets. By building a framework of multiset operations, employing the mathematical properties of polynomials, we design efficient, secure, and composable methods to enable privacy-preserving computation of the union, intersection, and element reduction operations. We apply these techniques to a wide range of practical problems, achieving more efficient results than those of previous work.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Lea Kissner
    • 1
  • Dawn Song
    • 1
  1. 1.Carnegie Mellon UniversityPittsburghUSA

Personalised recommendations