Efficient Circuit-Based PSI with Linear Communication
Offered By: TheIACR via YouTube
Course Description
Overview
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.
Syllabus
Introduction
PSI Cardinality
Google Ads Analytics
Google Pay
CircuitBased PSI
oblivious PRF
PRF Protocol
Goals
Divide Conquer
Optimization
Experiments
Taught by
TheIACR
Related Courses
How Apple Scans Your Phone and How to Evade It - NeuralHash CSAM Detection Algorithm ExplainedYannic Kilcher via YouTube FHE and Private Set Intersection
Simons Institute via YouTube Privacy-Preserving Information Sharing - Tools and Applications
Alan Turing Institute via YouTube Solving Private Set Intersection via Cuckoo Hashing - Benny Pinkas, Bar-Ilan University, Israel
Alan Turing Institute via YouTube Efficient Batched Oblivious PRF with Applications to Private Set Intersection
Association for Computing Machinery (ACM) via YouTube