In this talk, Prof. Alex Davidson will describe a novel construction of an oblivious pseudorandom function (OPRF) protocol with post-quantum security guarantees, based on (T)FHE and low-depth pseudorandom functions. Classical OPRFs are being standardised by the Internet Engineering Task Force, and their applications (including the Privacy Pass and OPAQUE protocols) require high-performance solutions. While previous post-quantum candidates focus more on feasibility, Alex will show that FHE-based OPRFs appear to provide a viable way forward for realising practically efficient constructions.
Alex is an Assistant Professor in the Computer Science Department at Universidade NOVA de Lisboa. His research focuses on applications of cryptography in the Internet setting, and concrete constructions of primitives from lattice-based assumptions. His recent work focuses on building practical privacy-preserving protocols for data aggregation and retrieval scenarios.
The newsletter where we post community announcements: https://fheorg.substack.com/
The discord server where you can discuss FHE related topics with the community: https://discord.fhe.org
Make sure to join either (or both) of these to stay informed about future events!