Abstract
In this paper we provide protocols for fair lottery and casino games.These fair protocols enable to remove the trust from the casino/lottery without resorting to another trusted third party, by allowing the user playing the game to participate in the generation of the specific run of the game. Furthermore, the user is able to verify the correctness of the execution of the game at the end of the run. On-line lotteries and on-line casinos have different properties and we address the needs of the two different types of games.
Most of this research was done while the author was a visiting scientist at the IBM T.J. Watson Research Center.
For example, the offcial web site of the New-York lottery is www.nylottery.org while if you enter www.nylottery.com you get a different web-site that until recently used to offer lotteries.
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
C. Dwork, and M. Naor, “Pricing via Processing or Combating Junk Mail”, Proc. of Crypto’92.
M. K. Franklin, and D. Malkhi, “Auditable metering with lightweight security”, Proc. of Financial Cryptography, Springer-Verlag LNCS Vol. 1318, pp. 151–160, 1997.
D. M. Goldschlag, and S. G. Stubblebine, “Publicly Verifiable Lotteries: Applications of Delaying Functions”, Proc. of Financial Cryptography, Springer-Verlag LNCS, 1998.
R. C. Merkle, “Secure Communication over Insecure Channels”, CACM, Vol. 21, pp. 294–299, 1978.
R. Motwani, and P. Raghavan, “Randomized Algorithms”, Cambridge University Press, 1995.
R. L. Rivest, “Electronic Lottery Tickets as Micropayments”, Proc. of Financial Cryptography, Springer-Verlag LNCS Vol. 1318, pp. 307–314, 1997.
R. L. Rivest, A. Shamir, and D. A. Wagner. “Time-lock Puzzles and Timed-Release Crypto”, Technical Memo MIT/LCS/TR-684, February 1996.
National Institute for Standards and Technology. Secure Hash Standard, April 17 1995.
P. Syverson, “Weakly Secret Bit Commitment: Applications to Lotteries and Fair Exchange”, 11th IEEE Computer Security Foundations Workshop, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Heidelberg
About this paper
Cite this paper
Kushilevitz, E., Rabin, T. (2001). Fair e-Lotteries and e-Casinos. In: Naccache, D. (eds) Topics in Cryptology — CT-RSA 2001. CT-RSA 2001. Lecture Notes in Computer Science, vol 2020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45353-9_9
Download citation
DOI: https://doi.org/10.1007/3-540-45353-9_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41898-6
Online ISBN: 978-3-540-45353-6
eBook Packages: Springer Book Archive