Weak Verifiable Random Functions

9 years 10 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commitment to all values of the function and can then produce, for any input x, a proof that the function has been evaluated correctly on x, preserving pseudorandomness for all other inputs. No public-key (even a falsely generated one) should allow for proving more than one value per input. VRFs are both a natural and a useful primitive, and previous works have suggested a variety of constructions and applications. Still, there are many open questions in the study of VRFs, especially their relation to more widely studied cryptographic primitives and constructing them from a wide variety of cryptographic assumptions. In this work we define a natural relaxation of VRFs that we call weak verifiable random functions, where pseudorandomness is required to hold only for randomly selected inputs. We conduct a study of we...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum
Added 25 Nov 2009
Updated 25 Nov 2009
Type Conference
Year 2009
Where TCC
Authors Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan
Comments (0)