Paper 2004/310 Original: eprint.iacr.org/2004/310 ↗
A Verifiable Random Function With Short Proofs and Keys
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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2005-03-08: last updated
- 2004-11-16: published
- Short URL
- https://ia.cr/2004/310
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2004/310,
author = {Yevgeniy Dodis and Aleksandr Yampolskiy},
title = {A Verifiable Random Function With Short Proofs and Keys},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/310},
year = {2004},
url = {https://eprint.iacr.org/2004/310}
}