Electronic National Lotteries

  • Elisavet Konstantinou
  • Vasiliki Liagkou
  • Paul Spirakis
  • Yannis C. Stamatiou
  • Moti Yung
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3110)

Abstract

We describe the design and implementation of secure and robust protocol and system for a national electronic lottery. Electronic lotteries at a national level are a viable cost effective alternative to mechanical ones when there is a business need to support many types of ”games of chance” and to allow increased drawing frequency. Electronic lotteries are, in fact, extremely high risk financial application: If one discovers a way to predict or otherwise claim the winning numbers (even once) the result is huge financial damages. Moreover, the e-lottery process is complex, which increases the possibility of fraud or costly accidental failures. In addition, a national lottery must adhere to auditability and (regulatory) fairness requirements regarding its drawings. Our mechanism, which we believe is the first one of its kind to be described in the literature, builds upon a number of cryptographic primitives that ensure the unpredictability of the winning numbers, the prevention of their premature leakages and prevention of fraud. We also provide measures for auditability, fairness, and trustworthiness of the process. Besides cryptography, we incorporate security mechanisms that eliminate various risks along the entire process. Our system which was commissioned by a national organization, was implemented in the field and has been operational and active for a while, now.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alexi, W., Chor, B., Goldreich, O., Schnorr, C.: RSA and Rabin Functions: Certain Parts are as Hard as the Whole. SIAM J. Computing 17(2), 194–209 (1988)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bays, C., Durham, S.D.: Improving a Poor Random Number Generator. ACM Trans. Math. Software 2(1), 59–64 (1976)MATHCrossRefGoogle Scholar
  3. 3.
    Blum, L., Blum, M., Shub, M.: A Simple Unpredictable Pseudo-Random Generator. SIAM J. Computing 15(2), 364–383 (1986)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Boneh, D.: Simplified OAEP for the RSA and Rabin Functions. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 275–291. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Dobbertin, H., Bosselaers, A., Preneel, B.: RIPEMD-160: A Strengthened Version of RIPEMD. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 71–82. Springer, Heidelberg (1996)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Ferguson, N., Schneier, B.: Practical Cryptography. John Wiley & Sons, Chichester (2003)Google Scholar
  8. 8.
    Ford, M.P., Ford, D.J.: Investigation of GAUSS’ Random Number Generators, a report prepared for Aptech Systems, Inc., FORWARD Computing and Control Pty. Ltd., NSW Australia (2001)Google Scholar
  9. 9.
    Hall, C., Schneier, B.: Remote Electronic Gambling. In: Proc. 13th ACM Annual Computer Security Applications Conference, pp. 227–230 (1997)Google Scholar
  10. 10.
    Jakobsson, M., Shriver, E.A.M., Hillyer, B., Juels, A.: A Practical Secure Physical Random Bit Generator. In: Proc. of the 5th ACM Conference on Computer and Communications Security 1998, pp. 103–111 (1998)Google Scholar
  11. 11.
    Knuth, D.E.: Seminumerical Algorithms, 3rd edn. Addison-Wesley, Reading (1997)Google Scholar
  12. 12.
    Kobayashi, K., Morita, H., Hakuta, M., Nakanowatari, T.: Electronic Soccer Lottery System that Uses Bit Commitment. IEICE Trans. Inf. & Syst. E 83-D(5), 980–987 (2000)Google Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    Lacy, J.B., Mitchell, D.P., Schell, W.M.: CryptoLib: Cryptography in Software. In: Proc. 4th USENIX Security Symposium, USENIX Assoc., pp. 237–246 (1993)Google Scholar
  15. 15.
    Maclaren, M.D., Marsaglia, G.: Uniform Random Number Generators. JACM 12(1), 83–89 (1965)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Marsaglia, G.: A current view of random number generators, keynote address. In: Proc. 16th Symposium on the Interface between Computer Science and Statistics, pp. 3–10 (1985)Google Scholar
  17. 17.
    Marsaglia, G.: DIEHARD: A battery of tests for random number generators, available at http://stat.fsu.edu/~geo/diehard.html
  18. 18.
    Mcrypt cryptographic library, ftp://mcrypt.hellug.gr/pub/crypto/mcrypt
  19. 19.
    Micali, S., Rabin, M., Vadhan, S.: Verifiable Random Functions. In: Proc 40th IEEE Symp. on Foundations of Cumputer Science, pp. 120–130 (1999)Google Scholar
  20. 20.
    Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudorandom functions. In: Proc. 38th IEEE Symp. on Found. of Computer Science (1997)Google Scholar
  21. 21.
    Protego, product information, http://www.protego.se/sg100_en.htm
  22. 22.
    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)CrossRefGoogle Scholar
  23. 23.
    Schindler, W., Killmann, W.: Evaluation criteria for true (physical) random number generators used in cryptographic applications. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 431–449. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  24. 24.
    Syverson, P.: Weakly Secret Bit Commitment: Applications to Lotteries and Fair Exchange. In: Proc. IEEE Computer Security Foundations Workshop (CSFW11), pp. 2–13 (1998)Google Scholar
  25. 25.
    Westphal Electronics. product information, http://www.westphal-electronic.de
  26. 26.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Elisavet Konstantinou
    • 1
    • 2
  • Vasiliki Liagkou
    • 1
    • 2
  • Paul Spirakis
    • 1
    • 2
  • Yannis C. Stamatiou
    • 1
    • 3
    • 4
  • Moti Yung
    • 5
  1. 1.Research and Academic Computer Technology InstitutePatrasGreece
  2. 2.Department of Computer Engineering and InformaticsUniversity of PatrasPatrasGreece
  3. 3.Department of MathematicsUniversity of the Aegean,KarlovassiSamosGreece
  4. 4.Joint Research Group (JRG) on Communications and Information Systems Security(University of the Aegean and Athens University of Economics and Business) 
  5. 5.Computer ScienceColumbia UniversityNew YorkUSA

Personalised recommendations