A verifiable random function with short proofs and keys

Yevgeniy Dodis, Aleksandr Yampolskiy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationLecture Notes in Computer Science
EditorsS. Vaudenay
Pages416-431
Number of pages16
Volume3386
StatePublished - 2005
Event8th International Workshop on Theory and Practice in Public Key Cryptography, PKC 2005 - Les Diablerets, Switzerland
Duration: Jan 23 2005Jan 26 2005

Other

Other8th International Workshop on Theory and Practice in Public Key Cryptography, PKC 2005
CountrySwitzerland
CityLes Diablerets
Period1/23/051/26/05

Fingerprint

Hash functions

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Dodis, Y., & Yampolskiy, A. (2005). A verifiable random function with short proofs and keys. In S. Vaudenay (Ed.), Lecture Notes in Computer Science (Vol. 3386, pp. 416-431)

A verifiable random function with short proofs and keys. / Dodis, Yevgeniy; Yampolskiy, Aleksandr.

Lecture Notes in Computer Science. ed. / S. Vaudenay. Vol. 3386 2005. p. 416-431.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dodis, Y & Yampolskiy, A 2005, A verifiable random function with short proofs and keys. in S Vaudenay (ed.), Lecture Notes in Computer Science. vol. 3386, pp. 416-431, 8th International Workshop on Theory and Practice in Public Key Cryptography, PKC 2005, Les Diablerets, Switzerland, 1/23/05.
Dodis Y, Yampolskiy A. A verifiable random function with short proofs and keys. In Vaudenay S, editor, Lecture Notes in Computer Science. Vol. 3386. 2005. p. 416-431
Dodis, Yevgeniy ; Yampolskiy, Aleksandr. / A verifiable random function with short proofs and keys. Lecture Notes in Computer Science. editor / S. Vaudenay. Vol. 3386 2005. pp. 416-431
@inproceedings{f508e13750c440b8b812e168c84fab38,
title = "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, 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.",
author = "Yevgeniy Dodis and Aleksandr Yampolskiy",
year = "2005",
language = "English (US)",
volume = "3386",
pages = "416--431",
editor = "S. Vaudenay",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - A verifiable random function with short proofs and keys

AU - Dodis, Yevgeniy

AU - Yampolskiy, Aleksandr

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=24144481228&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144481228&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3386

SP - 416

EP - 431

BT - Lecture Notes in Computer Science

A2 - Vaudenay, S.

ER -