Cryptology ePrint Archive: Report 2010/220

(If) Size Matters: Size-Hiding Private Set Intersection

Giuseppe Ateniese and Emiliano De Cristofaro and Gene Tsudik

Abstract: Modern society is increasingly dependent on, and fearful of, the availability of electronic information. There are numerous examples of situations where sensitive data must be -- sometimes reluctantly -- shared between two or more entities without mutual trust. As often happens, the research community has foreseen the need for mechanisms to enable limited (privacy-preserving) sharing of sensitive information and a number of effective solutions have been proposed. Among them, Private Set Intersection (PSI) techniques are particularly appealing for scenarios where two parties wish to compute an intersection of their respective sets of items without revealing to each other {\em any other information}. Thus far, "any other information" has been interpreted to mean any information about items not in the intersection.

In this paper, we motivate the need for Private Set Intersection with a stronger privacy property of {\em hiding the size} of the set held by one of the two entities ("client"). We introduce the notion of Size-Hiding Private Set Intersection (SHI-PSI) and propose an efficient construction secure under the RSA assumption in the Random Oracle Model. We also show that input size-hiding is attainable at very low additional cost.

Category / Keywords: Private set intersection, two-party computation, oblivious pseudo-random functions

Publication Info: A preliminary version of this paper appears in IACR PKC 2011.

Date: received 19 Apr 2010, last revised 24 Dec 2010

Contact author: edecrist at uci edu

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20101224:105748 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]