Private set intersection

Private set intersection is a secure multiparty computation cryptographic technique^[1] that allows two parties holding sets to compare encrypted versions of these sets in order to compute the intersection. In this scenario, neither party reveals anything to the counterparty except for the elements in the intersection.

Other variants of this exist, such as the server-client scenario, in which only the client learns the intersection of her set with the set of the server, without the server learning intersection of his set with the clients. ^[2]

For the comparison of data sets by cryptographic hashes on a small or predictable domain, precautions should be taken to prevent dictionary attacks.^[3]

Apple uses this technique in Password Monitoring.^[4] It has proposed using the technology for its announced Expanded Protections for Children ^[5]

In general, PSI protocols can be categorized into two broad categories: (1) traditional PSI and (2) delegated PSI. In the traditional PSI category, the data owners interact directly with each other and need to have a copy of their set at the time of the computation, e.g.,.^[6] In the delegated PSI the computation of PSI and/or the storage of sets can be delegated to a third-party server (that is itself might be a passive or active adversary). The delegated PSI category can be further divided into two classes: (a) those that support one-off delegation, and (b) those that support repeated delegation. The PSI protocols that support one-off delegation require the data owner to re-encode its data and send the encoded data to the server for each computation, e.g.,.^[7] Those that support repeated delegation allow the data owners to upload their (encrypted) data to the server only once, and then re-use it many times for each computation carried out but the server, e.g.,^[8]

Recently, researchers have proposed a variant of PSI protocol (in both traditional and delegated categories) that support data update, e.g., .^[9][10] This type of PSI protocol lets data owners insert/delete set elements into/from their data with low overheads and in a privacy-preserving manner.

This educational example demonstrated the key idea of PSI, but does not provide real-world cryptographic security (hence should not be used with real-world data).

# Example sets
party_a_set = {"apple", "banana", "cherry"}
party_b_set = {"banana", "orange", "apple"}

# Hashing the elements in both sets
hashed_party_a_set = {hash(e) for e in party_a_set}
hashed_party_b_set = {hash(e) for e in party_b_set}

# Finding the intersection of the hashed sets
intersection = hashed_party_a_set.intersection(hashed_party_b_set)

# Printing hashed intersection for demonstration
print(intersection)

This cryptography-related article is a stub. You can help Wikipedia by adding missing information.

• v
• t
• e