Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?

By Yan Huang, David E. Evans, Jonathan Katz. 2012

486 citations recorded by the source corpus.

How researchers see this paper

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

Citations in the corpus

Privacy-Preserving Ridge Regression on Hundreds of Millions of Records (2013, neutral): “implement Yao garbled circuits and describe many applications [6], [49].”
Secure Computation on Floating Point Numbers (2013, methodology): “Recent implementations of secure multi-party techniques include [6], [5] and two-party techniques include [31], [33].”
Scalable Private Set Intersection Based on OT Extension (2018, methodology): “A Boolean circuit for PSI that has O ( n log n ) size is the sort-compare-shufﬂe (SCS) circuit described in [Huang et al. 2012].”
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation (2015, methodology): “Boolean circuits that compute the private set intersection functionality were described in [37] and evaluated using Yao’s garbled circuits protocol.”
Scalable Private Set Union from Symmetric-Key Techniques (2019, background): “Over the last decade, there has been a significant amount of work on private set intersection [15, 16, 3, 29, 18, 46, 47, 36, 12, 37, 51, 11, 27, 49, 10, 20, 13, 17, 45, 43, 32].”
On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications (2019, methodology): “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].”
Private Join and Compute from PIR with Default (2020, unknown): “Huang, Katz, and Evans [HEK12] propose an eﬃcient sort-compare-shuﬄe circuit construction to implement PJC. Pinkas et al [PSWW, PSTY19] improve circuit-PSI using several hashing techniques.”
Improved Private Set Intersection Against Malicious Adversaries (2017, unknown): “[11] explored using general-purpose 2PC techniques (e.”
Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates (2015, unknown): “3% Set intersection [13] 37.”
Compacting privacy-preserving k-nearest neighbor search using logic synthesis (2015, methodology): “Our methodology for providing a SFE is based on Yao’s Garbled Circuit (GC) that is currently considered the most effective way to preserve privacy [4, 13].”
A Pragmatic Introduction to Secure Multi-Party Computation (2019, methodology): “and configuring the swappers in a Waksman network (Waksman, 1968) as necessary to produce it (Huang et al., 2012a).”