Cryptology ePrint Archive: Report 2017/051

A note on VRFs from Verifiable Functional Encryption

Saikrishna Badrinarayanan and Vipul Goyal and 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]).

Category / Keywords: Verifiable Random Functions, NIWI, Functional Encryption.

Date: received 22 Jan 2017, last revised 26 Jan 2017

Contact author: saikrishna at cs ucla edu, aayushjain1728@gmail com

Available format(s): PDF | BibTeX Citation

Version: 20170131:150023 (All versions of this report)

Short URL: ia.cr/2017/051