Abstract
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.
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
M. Abe. Universally Verifiable Mix-Net with VerificationWork Independent of the Number of Mix-Servers. In Eurocrypt’ 98, LNCS 1403, pages 437–447. Springer-Verlag, Berlin, 1998.
N. Asokan, M. Schunter, and M. Waidner. Optimistic Protocols for Fair Exchange. In Proc. of the 4th CCS. ACM Press, New York, 1997.
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.
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.
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.
D. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, 24-(2):84–88, February 1981.
S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences, 28:270–299, 1984.
S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure Against Adaptative Chosen-Message Attacks. SIAM Journal of Computing, 17(2):281–308, April 1988.
M. Jakobsson. Flash Mixing. In Proc. of the 18th PODC, pages 83–89. ACM Press, New York, 1999.
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.
L. Lamport. Constructing Digital Signatures from a One-Way Function. Technical Report CSL 98, SRI Intl., 1979.
M. Luby. Pseudorandomness and Cryptographic Applications, Princeton University Press, page 27, 1996.
R. Merkle. A Certified Digital Signature. In Crypto’ 89, LNCS 435, pages 218–238. Springer-Verlag, Berlin, 1990.
S. Micali. Certified e-Mail with Invisible Post Offices. Presented at the 1997 RSA Security Conference, 1997.
A. C. Yao. Protocols for Secure Computations. In Proc. of the 22nd FOCS, pages 160–164. IEEE, New York, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jakobsson, M., Pointcheval, D., Young, A. (2001). Secure Mobile Gambling. 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_10
Download citation
DOI: https://doi.org/10.1007/3-540-45353-9_10
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