Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Efficient Batched Oblivious PRF with Applications to Private Set Intersection

Association for Computing Machinery (ACM) via YouTube

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

Reviews

Start your review of Efficient Batched Oblivious PRF with Applications to Private Set Intersection

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.