A note on VRFs from Verifiable Functional Encryption

Saikrishna Badrinarayanan; Vipul Goyal; Aayush Jain; Amit Sahai

Paper 2017/051

A note on VRFs from Verifiable Functional Encryption

Saikrishna Badrinarayanan, Vipul Goyal, Aayush Jain, and Amit Sahai

Abstract

Recently, Bitansky [Bit17] and Goyal et.al [GHKW17] gave generic constructions of selec- tively secure verifiable random functions(VRFs) from non-interactive witness indistinguishable proofs (NIWI) and injective one way functions. In this short note, we give an alternate construc- tion of selectively secure VRFs based on the same assumptions as an application of the recently introduced notion of verifiable functional encryption [BGJS16]. Our construction and proof is much simpler than the ones in [Bit17, GHKW17], given previous work (most notably given the constructions of verifiable functional encryption in [BGJS16]).

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Keywords: Verifiable Random Functions NIWI Functional Encryption.
Contact author(s): saikrishna @ cs ucla edu
aayushjain1728 @ gmail com
History: 2017-01-31: received
Short URL: https://ia.cr/2017/051
License: CC BY

BibTeX

@misc{cryptoeprint:2017/051,
      author = {Saikrishna Badrinarayanan and Vipul Goyal and Aayush Jain and Amit Sahai},
      title = {A note on VRFs from Verifiable Functional Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2017/051},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/051}},
      url = {https://eprint.iacr.org/2017/051}
}