Repository logo
Research Outputs
Projects
People
Statistics
  1. Home
  2. HSG CRIS
  3. HSG Publications
  4. Statically Aggregate Verifiable Random Functions and Application to E-Lottery
Details

Statically Aggregate Verifiable Random Functions and Application to E-Lottery

Journal
Cryptography
Type
journal article
Date Issued
2020-12-13
Author(s)
Liang, Bei
;
Banegas, Gustavo
;
Mitrokotsa, Aikaterini  
DOI
10.3390/cryptography4040037
Abstract
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.
Language
English
HSG Classification
contribution to scientific community
Refereed
Yes
Publisher
MDPI
Volume
4
Number
4
Start page
37
Pages
20
Official URL
https://www.mdpi.com/2410-387X/4/4/37
URL
https://www.alexandria.unisg.ch/handle/20.500.14171/111472
Subject(s)

computer science

Division(s)

ICS - Institute of Co...

Eprints ID
261812
File(s)
Thumbnail Image

open.access

Name

cryptography-04-00037-v2 (1).pdf

Size

439.27 KB

Format

Adobe PDF

Checksum (MD5)

1c61a090b7d96301dbaa59da382aa1c6

Support
HSG researchers can find instructions here for adding or importing publications (DOI, ORCID). Please send questions to alexandria@unisg.ch

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify