Verifiable random function

A verifiable random function is a keyed function whose secret-key holder outputs, for each input, the function value together with a proof that the value is correct with respect to a published public key, while values at unqueried inputs remain pseudorandom to anyone holding only the public key.

TODO: syntax and security definition.

Participates in

Produces Verifiable random function

• BDH ⇒ VRF