Paper 2017/750

Adaptive-Secure VRFs with Shorter Keys from Static Assumptions

Răzvan Roşie


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.

Available format(s)
Public-key cryptography
Publication info
Preprint. MINOR revision.
Contact author(s)
razvan rosie @ ens fr
2017-08-07: received
Short URL
Creative Commons Attribution


      author = {Răzvan Roşie},
      title = {Adaptive-Secure {VRFs} with Shorter Keys from Static Assumptions},
      howpublished = {Cryptology ePrint Archive, Paper 2017/750},
      year = {2017},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.