Efficient TTP-free mental poker protocols

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

On the Security of a Repaired Mental Poker Protocol

Castellà‐Roca

Domingo‐Ferrer

Sebé

2006

Third International Conference on Information Technology: New Generations (ITNG'06)

View full text Add to dashboard Cite

In 2003, Zhao, Varadharajan and Mu proposed a mental poker protocol whose security was shown to be flawed in 2004: any player (or any outsider knowing the deck coding) is able to decrypt encrypted cards without knowing the encryption key. In 2005, the first two authors published a repaired version of this TTP-free mental poker protocol. We show here that this second version is also flawed: the first player can find all cleartexts of the final encrypted shuffled deck of cards. Both protocols are similar to Shamir-Rivest-Adleman's mental poker, but they replace an exponential commutative cipher with an ElGamal-like commutative cipher. We conclude that changing the underlying commutative cipher is the reason of their weakness.

show abstract

Efficient TTP-free mental poker protocols

Abstract: Abstract

Cited by 3 publications

References 15 publications

Secure and practical constant round mental poker

Secure and practical constant round mental poker

Secure and Verifiable P2P Card Games

On the Security of a Repaired Mental Poker Protocol

Contact Info

Product

Resources

About