21 - Bringing Down the Complexity: Fast Composable Protocols for Card Games Without Secret State
21 - Bringing Down the Complexity: Fast Composable Protocols for Card Games Without Secret State
复制标题
21 - 降低复杂性:无需秘密状态的纸牌游戏的快速可组合协议
DOI:
10.1007/978-3-319-93638-3_4
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
Larangeira Mario
中科院分区:
文献类型:
--
作者:
David Bernardo;Dowsley Rafael;Larangeira Mario
While many cryptographic protocols for card games have been proposed, all of them focus on card games where players have some state that must be kept secret from each other,e.gclosed cards and bluffs in Poker. This scenario poses many interesting technical challenges, which are addressed with cryptographic tools that introduce significant computational and communication overheads (e.g.zero-knowledge proofs). In this paper, we consider the case of games that do not require any secret state to be maintained (e.g.Blackjack and Baccarat). Basically, in these games, cards are chosen at random and then publicly advertised, allowing for players to publicly announce their actions (before or after cards are known). We show that protocols for such games can be built from very lightweight primitives such as digital signatures and canonical random oracle commitments, yielding constructions that far outperform all known card game protocols in terms of communication, computational and round complexities. Moreover, in constructing highly efficient protocols, we introduce a new technique based on verifiable random functions for extending coin tossing, which is at the core of our constructions. Besides ensuring that the games are played correctly, our protocols support financial rewards and penalties enforcement, guaranteeing that winners receive their rewards and that cheaters get financially penalized. In order to do so, we build on blockchain-based techniques that leverage the power of stateful smart contracts to ensure fair protocol execution.
登录
查看更多内容
DOI:
--
发表时间:
2005
期刊:
Trust and Privacy in Digital Business
影响因子:
--
作者:
Jordi Castellà;F. Sebé;J. Domingo
通讯作者:
J. Domingo
DOI:
10.1016/j.ins.2014.02.151
发表时间:
2014
期刊:
Inf. Sci.
影响因子:
--
作者:
Tzer
通讯作者:
Tzer
DOI:
10.1515/jmc-2012-0004
发表时间:
2012
期刊:
IACR Cryptol. ePrint Arch.
影响因子:
--
作者:
Tzer;Lih
通讯作者:
Lih
DOI:
10.1109/itng.2006.103
发表时间:
2006
期刊:
Third International Conference on Information Technology: New Generations (ITNG'06)
影响因子:
--
作者:
Jordi Castellà;J. Domingo;F. Sebé
通讯作者:
F. Sebé
DOI:
--
发表时间:
2019
期刊:
影响因子:
--
作者:
Bernardo David;Rafael Dowsley;Mario Larangeira
通讯作者:
Mario Larangeira