Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 139435, 14 pages
http://dx.doi.org/10.1155/2014/139435
Research Article

A Secure and Fair Joint E-Lottery Protocol

1Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung 41349, Taiwan
2Department of Information Management, Da-Yeh University, Changhua 51591, Taiwan

Received 23 January 2014; Accepted 3 March 2014; Published 4 May 2014

Academic Editors: M. Ivanovic and F. Yu

Copyright © 2014 Chin-Ling Chen et al. 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.

Linked References

  1. Mega millions, http://www.megamillions.com/.
  2. 649Lotter, http://www.649lotter.com/.
  3. California State Lottery, http://www.calottery.com/default.htm.
  4. S. S. M. Chow, L. C. K. Hui, S. M. Yiu, and K. P. Chow, “Practical electronic lotteries with offline TTP,” Computer Communications, vol. 29, no. 15, pp. 2830–2840, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. J.-S. Lee and C.-C. Chang, “Design of electronic t-out-of-n lotteries on the Internet,” Computer Standards and Interfaces, vol. 31, no. 2, pp. 395–400, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. J.-S. Lee, C.-S. Chan, and C.-C. Chang, “Non-iterative privacy preservation for online lotteries,” IET Information Security, vol. 3, no. 4, pp. 139–147, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. J. Haigh, “The statistics of lotteries,” in Handbook of Sports and Lottery Markets, pp. 481–502, 2008. View at Google Scholar
  8. e-Lottery Syndicates, http://www.e-lottery-syndicates.com/.
  9. Myleto, http://www.myleto.cc/.
  10. S. Micali, M. Rabin, and S. Vadhan, “Verifiable random functions,” in Proceedings of the IEEE 40th Annual Conference on Foundations of Computer Science, pp. 120–130, October 1999. View at Scopus
  11. O. Goldreich, S. Goldwasser, and S. Micali, “How to construct random functions (extended abstract),” in Proceedings of the IEEE Annual Symposium on Foundations of Computer Science, pp. 464–479, 1984.
  12. A. Lysyanskaya, “Unique signatures and verifiable random functions from the DH-DDH separation,” in Proceedings of the Advances in Cryptology (CRYPTO '02), vol. 2442 of Lecture Notes in Computer Science, pp. 597–612, 2002.
  13. A. Shamir, “Identity-based cryptosystems and signature schemes,” in Proceedings of the Advances in Cryptology (CRYPTO ’85), vol. 196 of Lecture Notes in Computer Science, pp. 47–53, 1985.
  14. L. Harn and J. Ren, “Efficient identity-based RSA multisignatures,” Computers and Security, vol. 27, no. 1-2, pp. 12–15, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. P. Sarkar, “Domain extender for collision resistant hash functions: improving upon Merkle-Damgård iteration,” Discrete Applied Mathematics, vol. 157, no. 5, pp. 1086–1097, 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. C.-L. Chen and M.-H. Liu, “A traceable E-cash transfer system against blackmail via subliminal channel,” Electronic Commerce Research and Applications, vol. 8, no. 6, pp. 327–333, 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. Internet Engineering Task Force (IETF) Working Group, “RFC 2631 Diffie-Hellman Key Agreement Method,” June 1999.
  18. W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644–654, 1976. View at Google Scholar · View at Scopus
  19. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126, 1978. View at Publisher · View at Google Scholar · View at Scopus