[Resource Topic] 2017/051: A note on VRFs from Verifiable Functional Encryption

Welcome to the resource topic for 2017/051

A note on VRFs from Verifiable Functional Encryption

Authors: Saikrishna Badrinarayanan, Vipul Goyal, Aayush Jain, Amit Sahai


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]).

ePrint: https://eprint.iacr.org/2017/051

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 .