Unique Aggregate Signatures with Applications to Distributed Verifiable Random Functions

A Novel Construction of Constrained Verifiable Random Functions

Security and Communication Networks ◽

10.1155/2019/4187892 ◽

2019 ◽

Vol 2019 ◽

pp. 1-15

Author(s):

Muhua Liu ◽

Ping Zhang ◽

Qingtao Wu

Keyword(s):

Random Function ◽

Secret Key ◽

Bilinear Maps ◽

Random Functions ◽

Compute Function ◽

Multilinear Maps ◽

Verifiable Random Functions ◽

Selective Security

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.

Download Full-text

Securing Blockchain Shards By Using Learning Based Reputation and Verifiable Random Functions

2019 International Symposium on Networks, Computers and Communications (ISNCC) ◽

10.1109/isncc.2019.8909175 ◽

2019 ◽

Author(s):

Ahmet Bugday ◽

Adnan Ozsoy ◽

Hayri Sever

Keyword(s):

Random Functions ◽

Verifiable Random Functions

Download Full-text

Statically Aggregate Verifiable Random Functions and Application to E-Lottery

Cryptography ◽

10.3390/cryptography4040037 ◽

2020 ◽

Vol 4 (4) ◽

pp. 37

Author(s):

Bei Liang ◽

Gustavo Banegas ◽

Aikaterini Mitrokotsa

Keyword(s):

Random Function ◽

Random Functions ◽

Large Sets ◽

Diffie Hellman ◽

Winning Number ◽

Verifiable Random Functions

Cohen, Goldwasser, and Vaikuntanathan (TCC’15) introduced the concept of aggregate pseudo-random functions (PRFs), which allow efficiently computing the aggregate of PRF values over exponential-sized sets. In this paper, we explore the aggregation augmentation on verifiable random function (VRFs), introduced by Micali, Rabin and Vadhan (FOCS’99), as well as its application to e-lottery schemes. We introduce the notion of static aggregate verifiable random functions (Agg-VRFs), which perform aggregation for VRFs in a static setting. Our contributions can be summarized as follows: (1) we define static aggregate VRFs, which allow the efficient aggregation of VRF values and the corresponding proofs over super-polynomially large sets; (2) we present a static Agg-VRF construction over bit-fixing sets with respect to product aggregation based on the q-decisional Diffie–Hellman exponent assumption; (3) we test the performance of our static Agg-VRFs instantiation in comparison to a standard (non-aggregate) VRF in terms of costing time for the aggregation and verification processes, which shows that Agg-VRFs lower considerably the timing of verification of big sets; and (4) by employing Agg-VRFs, we propose an improved e-lottery scheme based on the framework of Chow et al.’s VRF-based e-lottery proposal (ICCSA’05). We evaluate the performance of Chow et al.’s e-lottery scheme and our improved scheme, and the latter shows a significant improvement in the efficiency of generating the winning number and the player verification.

Download Full-text