Efficient Batched Oblivious PRF with Applications to Private Set Intersection
Offered By: Association for Computing Machinery (ACM) via YouTube
Course Description
Overview
Explore a conference talk on efficient batched oblivious PRF and its applications to private set intersection, presented at CCS 2016. Delve into the research conducted by Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, and Ni Trieu, focusing on privacy-preserving protocols. Learn about the PSI protocol, test protocol, and various extensions discussed during the presentation. Examine the transfer tensions, attentions protocol, and K and P protocol, as well as their security implications. Compare different approaches and gain insights into privacy-enhancing technologies in decision-making processes. This 25-minute talk, delivered at the 23rd ACM Conference on Computer and Communications Security in Vienna, Austria, offers valuable knowledge for researchers and practitioners in the field of cryptography and secure computation.
Syllabus
Introduction
Presentation
Privacy in Decisions
PSI Protocol
Test Protocol
Extensions
Transfer Tensions
Attentions Protocol
K and P Protocol
Security
Comparisons
Taught by
ACM CCS
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 Efficient Circuit-Based PSI with Linear Communication
TheIACR 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