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.
This research is supported in part by the Areas of Excellence Scheme established under the University Grants Committee of the Hong Kong Special Administrative Region (HKSAR), China (Project No. AoE/E-01/99), grants from the Research Grants Council of the HKSAR, China (Project No. HKU/7144/03E, HKU/7136/04E and HKU/7021/00E), and grants from the Innovation and Technology Commission of the HKSAR, China (Project No. ITS/170/01 and UIM/145).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bao, F., Deng, R.H., Mao, W.: Efficient and Practical Fair Exchange Protocols with Off-line TTP. In: IEEE Symposium on Foundations of Security and Privacy, pp. 77–85 (1998)
Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and Verifiably Encrypted Signatures. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416–432. Springer, Heidelberg (2003)
Dodis, Y., Yampolskiy, A.: A Verifiable Random Function With Short Proofs and Keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 416–431. Springer, Heidelberg (2005)
Fouque, P.-A., Poupard, G., Stern, J.: Sharing Decryption in the Context of Voting or Lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 90–104. Springer, Heidelberg (2001)
Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions (Extended Abstract). In: 25th Annual Symposium on Foundations of Computer Science, pp. 464–479. IEEE, Los Alamitos (1984)
Goldschlag, D.M., Stubblebine, S.G.: Publicly Verifiable Lotteries: Applications of Delaying Functions. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol. 1465, pp. 214–226. Springer, Heidelberg (1998)
Hall, C., Schneier, B.: Remote Electronic Gambling. In: 13th Annual Computer Security Applications Conference, December 1997, pp. 227–230. ACM Press, New York (1997)
Ham, W., Kim, K.: A Secure On-line Lottery Using Bank as a Notary. In: CISC 2002, pp. 121–124 (2002)
Kobayashi, K., Morita, H., Hakuta, M., Nakanowatari, T.: An Electronic Soccer Lottery System that Uses Bit Commitment. IEICE Transactions on Information and Systems E83-D(5), 980–987 (2000)
Konstantinou, E., Liagkou, V., Spirakis, P., Stamatiou, Y.C., Yung, M.: Electronic National Lotteries. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 147–163. Springer, Heidelberg (2004)
Kushilevitz, E., Rabin, T.: Fair e-Lotteries and e-Casinos. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 100–109. Springer, Heidelberg (2001)
Lysyanskaya, A.: Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 597–612. Springer, Heidelberg (2002)
Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable Random Functions. In: IEEE Symposium on Foundations of Computer Science, pp. 120–130 (1999)
Sako, K.: Implementation of a Digital Lottery Server on WWW. In: Baumgart, R. (ed.) CQRE 1999. LNCS, vol. 1740, pp. 101–108. Springer, Heidelberg (1999)
Zhou, J., Tan, C.: Playing Lottery on the Internet. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 189–201. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chow, S.S.M., Hui, L.C.K., Yiu, S.M., Chow, K.P. (2005). An e-Lottery Scheme Using Verifiable Random Function. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424857_72
Download citation
DOI: https://doi.org/10.1007/11424857_72
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25862-9
Online ISBN: 978-3-540-32045-6
eBook Packages: Computer ScienceComputer Science (R0)