Verifiable random functions with Boolean function constraints

Dear editor, Verifiable random functions (VRFs) [1] are cryptographic functions that behaves like a random function for producing a random string y for any variant x, but also allows for efficient verification of uniqueness of y for a valid witness z. In this work, we extend the concept of VRFs to a notion of a conditionally verifiable random function (CVRF… CONTINUE READING