Cryptology ePrint Archive: Report 2017/750

Adaptive-Secure VRFs with Shorter Keys from Static Assumptions

Răzvan Roşie

Abstract: Verifiable random functions are pseudorandom functions producing publicly verifiable proofs for their outputs, allowing for efficient checks of the correctness of their computation. In this work, we introduce a new computational hypothesis, the n-Eigen-Value assumption, which can be seen as a relaxation of the U_n-MDDH assumption, and prove its equivalence with the n-Rank assumption. Based on the newly introduced computational hypothesis, we build the core of a verifiable random function having an exponentially large input space and reaching adaptive security under a static assumption. The final construction achieves shorter public and secret keys compared to the existing schemes reaching the same properties.

Category / Keywords: public-key cryptography /

Date: received 3 Aug 2017

Contact author: razvan rosie at ens fr

Available format(s): PDF | BibTeX Citation

Version: 20170807:163338 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]