Fantastic OPRFs and Where to Find Them - Exploring Oblivious Pseudo-Random Functions
Offered By: media.ccc.de via YouTube
Course Description
Overview
Explore the world of Oblivious Pseudo-Random Functions (OPRFs) in this 46-minute conference talk. Discover how OPRFs work as versatile cryptographic primitives, enabling outsourced randomness computations without compromising confidentiality. Learn about their applications in adding strong privacy guarantees to protocols, providing confidentiality without PKI infrastructure, and offering security guarantees beyond traditional systems. Delve into the theoretical aspects of various OPRF types, their properties, and benefits. Examine concrete free software implementations, including liboprf, libopaque, sphinx, and klutshnik. Gain insights into standardization efforts for OPAQUE and OPRF by the IRTF CFRG. Explore practical applications such as private set intersection, private information retrieval, privacy-respecting single-sign-on, deduplication, and secure pattern matching.
Syllabus
Fantastic OPRFs and where to find them
Taught by
media.ccc.de
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