An anonymous verifiable random function with unbiasability and constant size proof.

Recently, verifiable random function (VRF) has been frequently applied in secure consensus protocols and e-lottery system to achieve random selection. In this context, how to build various secure verifiable random function to suit increasing application requirements receives much attention. Therefore, in this paper, we propose a new type of anonymous verifiable random function (AVRF). Concretely, the proposed anonymous verifiable random function achieves identity anonymity of prover based on the Decision Linear assumption that is secure in bilinear groups in contrast to the known anonymous verifiable random function which is relied on the Decisional Diffie–Hellman (DDH) assumption. The anonymity indicates that the verifier cannot recognize the prover's identity. In addition, our proposed AVRF is also unbiasable. It can provide unpredictability under malicious key generation. Security analysis shows that the proposed scheme satisfies correctness, uniqueness, pseudorandomness, anonymity and unbiasability. Theoretical analysis results indicate that our anonymous verifiable random function is relatively efficient, and its proof size is constant regardless of input size. [ABSTRACT FROM AUTHOR]