(If) Size Matters: Size-Hiding Private Set Intersection
نویسندگان
چکیده
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 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 hiding the size of the set held by one of the two entities ("client"). We introduce the notion of SizeHiding 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.
منابع مشابه
Bounded Size-Hiding Private Set Intersection
Private Set Intersection (PSI) and other private set operations have many current and emerging applications. Numerous PSI techniques have been proposed that vary widely in terms of underlying cryptographic primitives, security assumptions as well as complexity. One recent strand of PSI-related research focused on an additional privacy property of hiding participants’ input sizes. Despite some i...
متن کاملFast and Private Computation of Cardinality of Set Intersection and Union
With massive amounts of electronic information stored, transferred, and shared every day, legitimate needs for sensitive information must be reconciled with natural privacy concerns. This motivates various cryptographic techniques for privacy-preserving information sharing, such as Private Set Intersection (PSI) and Private Set Union (PSU). Such techniques involve two parties – client and serve...
متن کاملComputing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملOn the Security of O-PSI a Delegated Private Set Intersection on Outsourced Datasets (Extended Version)
In recent years, determining the common information privately and efficiently between two mutually mistrusting parties have become an important issue in social networks. Many Private set intersection (PSI) protocols have been introduced to address this issue. By applying these protocols, two parties can compute the intersection between their sets without disclosing any information about compone...
متن کاملHiding the Input-Size in Secure Two-Party Computation
In the setting of secure multiparty computation, a set of parties wish to compute a joint function of their inputs, while preserving properties like privacy, correctness, and independence of inputs. One security property that has typically not been considered in the past relates to the length or size of the parties inputs. This is despite the fact that in many cases the size of a party’s input ...
متن کامل