Welcome to the resource topic for 2004/310
Title:
A Verifiable Random Function With Short Proofs and Keys
Authors: Yevgeniy Dodis, Aleksandr Yampolskiy
Abstract:We give a simple and efficient construction of a verifiable random function (VRF) on bilinear groups. Our construction is direct.
In contrast to prior VRF constructions [MRV99, Lys02], it avoids using an inefficient Goldreich-Levin transformation, thereby saving several factors in security. Our proofs of security are based on a decisional bilinear Diffie-Hellman inversion assumption, which seems reasonable given current state of knowledge. For small message spaces, our VRF’s proofs and keys have constant size. By utilizing a collision-resistant hash function, our VRF can also be used with arbitrary message spaces. We show that our scheme can be instantiated with an elliptic group of very reasonable size.
Furthermore, it can be made distributed and proactive.
ePrint: https://eprint.iacr.org/2004/310
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .