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

6Citations
Citations of this article
48Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

David, B., Dowsley, R., & Larangeira, M. (2018). Kaleidoscope: An Efficient Poker Protocol with Payment Distribution and Penalty Enforcement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10957 LNCS, pp. 500–519). Springer Verlag. https://doi.org/10.1007/978-3-662-58387-6_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free