Fantastic OPRFs and Where to Find Them - Exploring Oblivious Pseudo-Random Functions

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.