A Novel Construction of Constrained Verifiable Random Functions

Abstract EN

Constrained verifiable random functions (VRFs) were introduced by Fuchsbauer.

In a constrained VRF, one can drive a constrained key skS from the master secret key sk, where S is a subset of the domain.

Using the constrained key skS, one can compute function values at points which are not in the set S.

The security of constrained VRFs requires that the VRFs’ output should be indistinguishable from a random value in the range.

They showed how to construct constrained VRFs for the bit-fixing class and the circuit constrained class based on multilinear maps.

Their construction can only achieve selective security where an attacker must declare which point he will attack at the beginning of experiment.

In this work, we propose a novel construction for constrained verifiable random function from bilinear maps and prove that it satisfies a new security definition which is stronger than the selective security.

We call it semiadaptive security where the attacker is allowed to make the evaluation queries before it outputs the challenge point.

It can immediately get that if a scheme satisfied semiadaptive security, and it must satisfy selective security.