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, it avoids using an in-efficient 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.
| Original language | English (US) |
|---|---|
| Title of host publication | Lecture Notes in Computer Science |
| Editors | S. Vaudenay |
| Pages | 416-431 |
| Number of pages | 16 |
| Volume | 3386 |
| State | Published - 2005 |
| Event | 8th International Workshop on Theory and Practice in Public Key Cryptography, PKC 2005 - Les Diablerets, Switzerland Duration: Jan 23 2005 → Jan 26 2005 |
Other
| Other | 8th International Workshop on Theory and Practice in Public Key Cryptography, PKC 2005 |
|---|---|
| Country/Territory | Switzerland |
| City | Les Diablerets |
| Period | 1/23/05 → 1/26/05 |
ASJC Scopus subject areas
- Computer Science (miscellaneous)