Article

Kaleidoscope: An Efficient Poker Protocol with Payment Distribution and Penalty Enforcement

Authors:

Bernardo David,

Rafael Dowsley, and

Mario LarangeiraAuthors Info & Claims

Financial Cryptography and Data Security: 22nd International Conference, FC 2018, Nieuwpoort, Curaçao, February 26 – March 2, 2018, Revised Selected Papers

February 2018

Pages 500 - 519

https://doi.org/10.1007/978-3-662-58387-6_27

Published: 26 February 2018 Publication History

Abstract

The two main challenges in deploying real world secure poker protocols lie in enforcing the distribution of rewards and dealing with misbehaving/aborting parties. Using recent advances in cryptocurrencies and blockchain techniques, Kumaresan et al. (CCS 2015) and Bentov et al. (ASIACRYPT 2017) were able to solve those problems for the general case of secure multiparty computation. However, in the specific case of secure poker, they leave major open problems in terms of efficiency and security. This work tackles these problems by presenting the first full-fledged simulation-based security definition for secure poker and the first fully-simulatable secure poker protocol that provably realizes such a security definition. Our protocol provably enforces rewards distribution and penalties for misbehaving parties, while achieving efficiency comparable to previous tailor-made poker protocols, which do not have formal security proofs and rewards/penalties enforcement. Moreover, our protocol achieves reduced on-chain storage requirements for the penalties and rewards enforcement mechanism.

References

[1]

Ahmed, M.: How UK beat the odds to win at online gambling (2017). https://www.ft.com/content/044a3d9e-7d1a-11e7-9108-edda0bcbc928. Accessed 29 Aug 2017

[2]

Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 443–458. IEEE Computer Society Press, May 2014

[3]

Barnett A and Smart NP Paterson KG Mental poker revisited Cryptography and Coding 2003 Heidelberg Springer 370-383

[4]

Bayer S and Groth J Pointcheval D and Johansson T Efficient zero-knowledge argument for correctness of a shuffle Advances in Cryptology – EUROCRYPT 2012 2012 Heidelberg Springer 263-280

[5]

Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Ashby, V. (ed.) ACM CCS 1993, pp. 62–73. ACM Press, November 1993

[6]

Bentov I and Kumaresan R Garay JA and Gennaro R How to use bitcoin to design fair protocols Advances in Cryptology – CRYPTO 2014 2014 Heidelberg Springer 421-439

[7]

Bentov I, Kumaresan R, and Miller A Takagi T and Peyrin T Instantaneous decentralized poker Advances in Cryptology – ASIACRYPT 2017 2017 Cham Springer 410-440

[8]

Buterin, V.: White paper (2013). https://github.com/ethereum/wiki/wiki/White-Paper. Accessed 5 Dec 2017

[9]

Castellà-Roca J, Sebé F, and Domingo-Ferrer J Katsikas S, López J, and Pernul G Dropout-tolerant TTP-free mental poker Trust, Privacy, and Security in Digital Business 2005 Heidelberg Springer 30-40

[10]

Chaum D and Pedersen TP Brickell EF Wallet databases with observers Advances in Cryptology — CRYPTO 92 1993 Heidelberg Springer 89-105

[11]

Crépeau C Odlyzko AM A zero-knowledge Poker protocol that achieves confidentiality of the players’ strategy or how to achieve an electronic Poker face Advances in Cryptology — CRYPTO 86 1987 Heidelberg Springer 239-247

[12]

David, B., Dowsley, R., Larangeira, M.: Kaleidoscope: an efficient poker protocol with payment distribution and penalty enforcement. Cryptology ePrint Archive, Report 2017/899 (2017). https://eprint.iacr.org/2017/899

[13]

Desmedt Y Pomerance C Society and group oriented cryptography: a new concept Advances in Cryptology — CRYPTO 87 1988 Heidelberg Springer 120-127

[14]

Desmedt Y and Frankel Y Brassard G Threshold cryptosystems Advances in Cryptology — CRYPTO 89 Proceedings 1990 New York Springer 307-315

[15]

The Economist: A Big Deal (2007). http://www.economist.com/node/10281315#print. Accessed 24 Aug 2017

[16]

ElGamal T Blakley GR and Chaum D A public key cryptosystem and a signature scheme based on discrete logarithms Advances in Cryptology 1985 Heidelberg Springer 10-18

[17]

Fiat A and Shamir A Odlyzko AM How To prove yourself: practical solutions to identification and signature problems Advances in Cryptology — CRYPTO 86 1987 Heidelberg Springer 186-194

[18]

IMDb: Kaleidoscope (2017). http://www.imdb.com/title/tt0060581/. Accessed 12 Sept 2017

[19]

Johnson D, Menezes A, and Vanstone S The elliptic curve digital signature algorithm (ECDSA) Int. J. Inf. Secur. 2001 1 1 36-63

[20]

Kumaresan, R., Moran, T., Bentov, I.: How to use bitcoin to play decentralized poker. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 195–206. ACM Press, October 2015

[21]

Pedersen TP Davies DW A threshold cryptosystem without a trusted party Advances in Cryptology — EUROCRYPT 91 1991 Heidelberg Springer 522-526

[22]

Pointcheval D and Stern J Maurer U Security proofs for signature schemes Advances in Cryptology — EUROCRYPT 96 1996 Heidelberg Springer 387-398

[23]

Reitwiessner, C.: EIP 196 (2017). https://github.com/ethereum/EIPs/blob/master/EIPS/eip-196.md. Accessed 13 Dec 2017

[24]

Schnorr CP Efficient signature generation by smart cards J. Cryptol. 1991 4 3 161-174

[25]

Sebe, F., Domingo-Ferrer, J., Castella-Roca, J.: On the security of a repaired mental poker protocol. In: Third International Conference on Information Technology: New Generations, pp. 664–668 (2006)

[26]

Shamir A, Rivest RL, and Adleman LM Klarner DA Mental poker The Mathematical Gardner 1981 Heidelberg Springer 37-43

[27]

Szabo, N.: Smart contracts: building blocks for digital markets (1996). http://www.fon.hum.uva.nl/rob/Courses/InformationInSpeech/CDROM/Literature/LOTwinterschool2006/szabo.best.vwh.net/smart_contracts_2.html. Accessed 5 Dec 2017

[28]

Wei TJ Secure and practical constant round mental poker Inf. Sci. 2014 273 352-386

[29]

Wei, T.J., Wang, L.C.: A fast mental poker protocol. J. Math. Cryptol. 6(1), 39–68 (2012)

[30]

Wikipedia: Online Poker (2017). https://en.wikipedia.org/wiki/Online_poker. Accessed 29 Aug 2017

[31]

Wood, G.: Ethereum: a secure decentralized transaction ledger (2014). http://gavwood.com/paper.pdf. Accessed 5 Dec 2017

[32]

Zhao, W., Varadharajan, V.: Efficient TTP-free mental poker protocols. In: ITCC 2005 - Volume II, vol. 1, pp. 745–750, April 2005

[33]

Zhao, W., Varadharajan, V., Mu, Y.: A secure mental poker protocol over the internet. In: ACSW Frontiers 2003, pp. 105–109. Australian Computer Society Inc., Darlinghurst (2003)

Cited By

Golob SPentyala SDowsley RDavid BLarangeira MDe Cock MNascimento A(2023)A Decentralized Information Marketplace Preserving Input and Output PrivacyProceedings of the Second ACM Data Economy Workshop10.1145/3600046.3600047(1-6)Online publication date: 18-Jun-2023
https://dl.acm.org/doi/10.1145/3600046.3600047
Baum CChiang JDavid BFrederiksen T(2023)Eagle: Efficient Privacy Preserving Smart ContractsFinancial Cryptography and Data Security10.1007/978-3-031-47754-6_16(270-288)Online publication date: 1-May-2023
https://dl.acm.org/doi/10.1007/978-3-031-47754-6_16
David BGentile LPourpouneh M(2022)FAST: Fair Auctions via Secret TransactionsApplied Cryptography and Network Security10.1007/978-3-031-09234-3_36(727-747)Online publication date: 20-Jun-2022
https://dl.acm.org/doi/10.1007/978-3-031-09234-3_36
Show More Cited By

Index Terms

Kaleidoscope: An Efficient Poker Protocol with Payment Distribution and Penalty Enforcement
1. Security and privacy
  1. Human and societal aspects of security and privacy
2. Theory of computation

Index terms have been assigned to the content through auto-classification.

Recommendations

An efficient certified email protocol
ISC'07: Proceedings of the 10th international conference on Information Security

A certified email protocol, also known as a nonrepudiation protocol, allows a message to be exchanged for an acknowledgement of reception in a fair manner: a sender Alice sends a message to a receiver Bob if and only if Alice receives a receipt from ...
Read More
An efficient fair UC-secure protocol for two-party computation

With the development of modern Internet and mobile networks, there is an increasing need for collaborative privacy-preserving applications. Secure multi-party computation SMPC gives a general solution to these applications and has become a hot topic. ...
Read More
Fairness electronic payment protocol

Abuse-freeness is one of the most interesting new problems in the electronic payment security today. It is an effective supplementary for the fairness. It is confusing to researchers how to get real abuse-freeness in electronic payment. An abuse-...
Read More

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Financial Cryptography and Data Security: 22nd International Conference, FC 2018, Nieuwpoort, Curaçao, February 26 – March 2, 2018, Revised Selected Papers

Feb 2018

557 pages

ISBN:978-3-662-58386-9

DOI:10.1007/978-3-662-58387-6

Editors:
Sarah Meiklejohn
Department of Computer Science, University College London, London, UK
,
Kazue Sako
Security Research Laboratories, NEC, Kawasaki, Japan

© International Financial Cryptography Association 2018.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 26 February 2018

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Golob SPentyala SDowsley RDavid BLarangeira MDe Cock MNascimento A(2023)A Decentralized Information Marketplace Preserving Input and Output PrivacyProceedings of the Second ACM Data Economy Workshop10.1145/3600046.3600047(1-6)Online publication date: 18-Jun-2023
https://dl.acm.org/doi/10.1145/3600046.3600047
Baum CChiang JDavid BFrederiksen T(2023)Eagle: Efficient Privacy Preserving Smart ContractsFinancial Cryptography and Data Security10.1007/978-3-031-47754-6_16(270-288)Online publication date: 1-May-2023
https://dl.acm.org/doi/10.1007/978-3-031-47754-6_16
David BGentile LPourpouneh M(2022)FAST: Fair Auctions via Secret TransactionsApplied Cryptography and Network Security10.1007/978-3-031-09234-3_36(727-747)Online publication date: 20-Jun-2022
https://dl.acm.org/doi/10.1007/978-3-031-09234-3_36
Bultel XLafourcade P(2019)Secure Trick-Taking Game ProtocolsFinancial Cryptography and Data Security10.1007/978-3-030-32101-7_17(265-281)Online publication date: 18-Feb-2019
https://dl.acm.org/doi/10.1007/978-3-030-32101-7_17

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents