An e-lottery scheme using Verifiable Random Function

18Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A number of e-lottery schemes have been proposed; however, none of them can satisfy all the identified requirements. In particular, some of them require a certain subset of players to remain online or the existence of a trusted third party (TTP) in order to generate the winning number(s) and some suffer from the forgery ticket attack. In this paper, we propose a new e-lottery scheme based on Verifiable Random Function that can satisfy all the identified requirements without the presence of TTP, yet the result of this generation is publicly verifiable. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Chow, S. S. M., Hui, L. C. K., Yiu, S. M., & Chow, K. P. (2005). An e-lottery scheme using Verifiable Random Function. In Lecture Notes in Computer Science (Vol. 3482, pp. 651–660). Springer Verlag. https://doi.org/10.1007/11424857_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free