Abstract. In this presentation we present current work in progress specification for Verifiable Oblivious PRFs, developed at IETF/CFRG. An Oblivious Pseudorandom Function (OPRF) is a party protocol between client and server for computing the output of a Pseudorandom Function (PRF). The protocol is verifiable if the client can verify whether the server used a specific key. A (V)OPRF is used as a building block for other protocols such as in Privacy Pass unlikable tokens and in OPAQUE, a password-authenticated key exchange. Finally, a Discrete-Logarithm Equivalence (DLEQ) zero knowledge-proof is also defined as part of the specification.
MPTS 2023: NIST Workshop on Multi-party Threshold Schemes 2023
Starts: September 26, 2023Virtual
Security and Privacy: cryptography