Composable Oblivious Pseudo-Random Functions via Garbled Circuits

ePrint Report: Composable Oblivious Pseudo-Random Functions via Garbled Circuits

Sebastian Faller, Astrid Ottenhues, Johannes Ernst

Oblivious Pseudo-Random Functions (OPRFs) are a central
tool for building modern protocols for authentication and distributed
computation. For example, OPRFs enable simple login protocols that do
not reveal the password to the provider, which helps to mitigate known
shortcomings of password-based authentication such as password reuse
or mix-up. Reliable treatment of passwords becomes more and more
important as we login to a multitude of services …

authentication computation distributed enable eprint report functions login oblivious password protocols random report simple tool