On the Security of a Repaired Mental Poker Protocol

Castellà‐Roca, Jordi; Domingo‐Ferrer, Josep; Sebé, Francesc

doi:10.1109/itng.2006.103

Cited by 7 publications

(7 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, Zhao and Vadaharajan introduced in 2005 [10] a revised version of the system. But, Castella and Roca in 2006 [11] indicated that the revised version was insecure and resembled the RSA system. In 2008, Chun and Chao [12] introduced a poker protocol to accomplish the distribution of encryption, detection and verification in an entirely distributed manner.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Poker Protocol for Shuffling and Dealing Cards

Aboud*¹,

Jabbar²

2019

IJITEE

View full text Add to dashboard Cite

This paper proposes a new card game and dealing system, designed specifically for poker games. The proposed method benefits from two poker characteristics games that are ignored by public card systems. First, cards are dealt in poker games in the form of rounds, betting with them, instead of all at once. Second, the total number of cards dealt in poker game cards is depending on the number of players but is usually less than half the total. With these remarks in mind, the proposed method distributes the computing cost of dealing cards evenly across the rounds. Compared to systems that provide a full introduction to the deck, the proposed approach provides a significant reduction in the total cost of computing. Also, it’s fair and strong. It perfectly fits hardware such as smartphones. The presented system is fast and secure mental poker protocol. It is twice as fast as similar protocols.

show abstract

Section: Related Workmentioning

confidence: 99%

An Efficient Poker Protocol for Shuffling and Dealing Cards

Aboud*¹,

Jabbar²

2019

IJITEE

View full text Add to dashboard Cite

show abstract

“…Zhao et al [14] revised the original scheme to remove the security aw pointed out in [3]. However, the revised version introduced another security aw pointed out in [4]. Soo et al [11] proposed a scheme based on optimized arbitrarysized Benes permutation networks to shuf e the deck.…”

Section: Related Workmentioning

confidence: 99%

Secure and Verifiable P2P Card Games

Yeh

2008

2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing

View full text Add to dashboard Cite

This paper presents the design of secure and veri able P2P card games. An ef cient scheme was proposed to achieve secret encoding, distribution, revealing, and verication in a fully distributed way. The proposed card shufing scheme is based on lightweight operations such as permutation and modular addition. Compared with most of previous approaches basing on public key cryptosystems and their alike, the proposed scheme is simple and fast. This unique feature makes the proposed scheme more feasible for those resource limited mobile devices, such as PDAs and smartphones.

show abstract

“…Solving this issue has inspired a long line of research on mental poker, i.e. playing poker among distrustful players without relying on a trusted third party [3,38,19,20,31,28,17,24,37,30,33,32]. Nevertheless, the aforementioned mental poker protocols did not provide formal security definitions or proofs.…”

Section: Introductionmentioning

confidence: 99%

“…In fact, concrete flaws in the protocols of [38,37] (resp. [3,17]) have been identified in [30] (resp. [22]).…”

Section: Introductionmentioning

confidence: 99%

ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement

David

Dowsley

Larangeira

2019

Financial Cryptography and Data Security

View full text Add to dashboard Cite

While many tailor made card game protocols are known, the vast majority of those lack three important features: mechanisms for distributing financial rewards and punishing cheaters, composability guarantees and flexibility, focusing on the specific game of poker. Even though folklore holds that poker protocols can be used to play any card game, this conjecture remains unproven and, in fact, does not hold for a number of protocols (including recent results). We both tackle the problem of constructing protocols for general card games and initiate a treatment of such protocols in the Universal Composability (UC) framework, introducing an ideal functionality that captures card games that use a set of core card operations. Based on this formalism, we introduce Royale, the first UC-secure general card games which supports financial rewards/penalties enforcement. We remark that Royale also yields the first UC-secure poker protocol. Interestingly, Royale performs better than most previous works (that do not have composability guarantees), which we highlight through a detailed concrete complexity analysis and benchmarks from a prototype implementation.

show abstract

On the Security of a Repaired Mental Poker Protocol

Cited by 7 publications

References 8 publications

An Efficient Poker Protocol for Shuffling and Dealing Cards

An Efficient Poker Protocol for Shuffling and Dealing Cards

Secure and Verifiable P2P Card Games

ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement

Contact Info

Product

Resources

About