Secure Mobile Gambling
We study lightweight and secure gambling methods, and propose a general framework that is secure against various “disconnection” and “payment refusal” attacks. Our method can be employed for single- and multi-player games in which players are independent, such as slot machines, roulette and blackjack. We focus on “open card” games, i.e., games where the casino’s best game strategy is not affected by knowledge of the randomness used by the players (once both or all parties have committed to their random strings.) Our method allows players as well as casinos to ascertain that the game is played exactly according to the rules agreed on, including that the various random events in fact are random. Given the low computational costs involved, we can implement the games on cellular phones, without concerns of excessive computation or power consumption.
KeywordsFair gambling lightweight Merkle publicly verifiable robust
Unable to display preview. Download preview PDF.
- 2.N. Asokan, M. Schunter, and M. Waidner. Optimistic Protocols for Fair Exchange. In Proc. of the 4th CCS. ACM Press, New York, 1997.Google Scholar
- 3.D. Bleichenbacher and U. Maurer. Directed Acyclic Graphs, One-way Functions and Digital Signatures. In Crypto’ 94, LNCS 839, pages 75–82. Springer-Verlag, Berlin, 1994.Google Scholar
- 4.M. Blum. Coin Flipping by Telephone: a Protocol for Solving Impossible Problems. In Crypto’ 81, pages 11–15. ECE Dpt, UCSB, Santa Barbara, CA 93106, 1982.Google Scholar
- 5.R. Canetti. Towards Realizing Random Oracles: Hash Functions that Hide All Partial Information. In Crypto’ 97, LNCS 1294, pages 455–469. Springer-Verlag, Berlin, 1997.Google Scholar
- 6.D. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, 24-(2):84–88, February 1981.Google Scholar
- 9.M. Jakobsson. Flash Mixing. In Proc. of the 18th PODC, pages 83–89. ACM Press, New York, 1999.Google Scholar
- 10.J. Katz and M. Yung. Complete Characterization of Security Notions for Probabilistic Private-Key Encryption. In Proc. of the 32nd STOC. ACM Press, New York, 2000.Google Scholar
- 11.L. Lamport. Constructing Digital Signatures from a One-Way Function. Technical Report CSL 98, SRI Intl., 1979.Google Scholar
- 12.M. Luby. Pseudorandomness and Cryptographic Applications, Princeton University Press, page 27, 1996.Google Scholar
- 13.R. Merkle. A Certified Digital Signature. In Crypto’ 89, LNCS 435, pages 218–238. Springer-Verlag, Berlin, 1990.Google Scholar
- 14.S. Micali. Certified e-Mail with Invisible Post Offices. Presented at the 1997 RSA Security Conference, 1997.Google Scholar
- 15.A. C. Yao. Protocols for Secure Computations. In Proc. of the 22nd FOCS, pages 160–164. IEEE, New York, 1982.Google Scholar