Efficient Private Matching and Set Intersection

By Michael J. Freedman, Kobbi Nissim, Benny Pinkas. 2004

1,449 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Secure Multiparty Computation for Privacy-Preserving Data Mining (2009, background): “There is also a variant which is secure against malicious adversaries, but it is analyzed in the random oracle model (see (17) for details of all these variants).”
Practical Multi-party Private Set Intersection from Symmetric-Key Techniques (2017, methodology): “party to run a version of the protocol of [12] with all other parties.”
Fast Private Set Intersection from Homomorphic Encryption (2017, background): “[23] proposed a protocol based on oblivious polynomial evaluation.”
Privacy-Preserving Set Operations (2005, methodology): “They proposed protocols for the problems related to Set-Intersection, based on the representation of sets as roots of a polynomial [12].”
Fast Private Set Operations with SEPIA (2012, background): “Moreover, most approaches [13, 14, 10, 25, 19, 9, 27] focus on a few operations and do not provide a complete suite of composable set operations.”
Computational Differential Privacy (2009, background): “The problem of secure Hamming distance computation, together with closely related problems of secure scalar product and secure set-intersection cardinality [14,15,16,17,18], may”
Constant-Round Multi-party Private Set Union Using Reversed Laurent Series (2012, background): “This problem, for various types of set operations, has received a lot of attention in both the two-party [10, 4, 14, 7, 6, 17, 9, 15, 8] and multi-party [19, 11, 23] settings.”
Do I know you?: efficient and privacy-preserving common friend-finder protocols and applications (2013, methodology): “To this end, we turn to Private Set Intersection Cardinality (PSI-CA) protocols [23, 4, 27, 14]: PSI-CA allows two parties, each holding a private set, to interact in a cryptographic protocol such that one party learns the magnitude of the set intersection (and nothing else), while the other obtains”
Data Collection and Wireless Communication in Internet of Things (IoT) Using Economic Analysis and Pricing Models: A Survey (2016, methodology): “Then, the private set intersection algorithm in [240] was adopted for the winner determination.”
Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution (2012, methodology): “We derive our secure equality-test protocol (Figure 5) by specializing the ideas of Freedman et al. [9] based on additively homomorphic encryption.”
On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications (2019, background): “Private set intersection is a specialized problem for secure two-party computation that has been studied extensively in a long sequence of works [30, 15, 35, 48, 45, 43, 19, 47, 34, 25, 12, 20, 16, 29].”