Efficient Circuit-Based PSI with Linear Communication

Explore a groundbreaking paper on efficient circuit-based Private Set Intersection (PSI) with linear communication, presented at EUROCRYPT 2019. Delve into the innovative work by Benny Pinkas, Thomas Schneider, Oleksandr Tkachenko, and Avishay Yanai, which addresses critical aspects of PSI cardinality, Google Ads analytics, and Google Pay. Examine the intricacies of circuit-based PSI, oblivious PRF, and PRF protocol. Understand the researchers' goals, their divide-and-conquer approach, and various optimizations. Analyze the experimental results that demonstrate the effectiveness of this novel PSI technique, which has significant implications for privacy-preserving computations in real-world applications.

Introduction
PSI Cardinality
Google Ads Analytics
Google Pay
CircuitBased PSI
oblivious PRF
PRF Protocol
Goals
Divide Conquer
Optimization
Experiments