Statically Aggregate Verifiable Random Functions and Application to E-Lottery
1
Department of Computer Science and Engineering, Chalmers University of Technology, SE-41296 Gothenburg, Sweden
2
School of Computer Science, University of St. Gallen, CH-9000 St. Gallen, Switzerland
*
Author to whom correspondence should be addressed.
Cryptography 2020, 4(4), 37; https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography4040037
Received: 29 October 2020 / Revised: 29 November 2020 / Accepted: 9 December 2020 / Published: 13 December 2020
(This article belongs to the Special Issue Cryptographic Protocols 2020)
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.
View Full-Text
Keywords:
pseudorandom functions; verifiable random functions; aggregate pseudorandom functions; aggregate verifiable random functions
▼
Show Figures
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
MDPI and ACS Style
Liang, B.; Banegas, G.; Mitrokotsa, A. Statically Aggregate Verifiable Random Functions and Application to E-Lottery. Cryptography 2020, 4, 37. https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography4040037
AMA Style
Liang B, Banegas G, Mitrokotsa A. Statically Aggregate Verifiable Random Functions and Application to E-Lottery. Cryptography. 2020; 4(4):37. https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography4040037
Chicago/Turabian StyleLiang, Bei; Banegas, Gustavo; Mitrokotsa, Aikaterini. 2020. "Statically Aggregate Verifiable Random Functions and Application to E-Lottery" Cryptography 4, no. 4: 37. https://0-doi-org.brum.beds.ac.uk/10.3390/cryptography4040037
Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.