Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Information Assurance and Security

Fair online gambling scheme and TTP-free mental poker protocols

Weiliang Zhao, Vijay Varadharajan

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

Online gambling allows users to participate in mental games and bet over the Internet. It can open new opportunities for casinos to make more money; however, at the same time, there are a lot of security challenges. In this paper, we describe our scheme for secure online gambling and secure mental poker protocols over the Internet based on our previous researches. Our scheme provides both the fairness of online gambling processes and secure linking of the online gambling with payment. A unique link between payments and gambling outcome is provided so that the winner can be ensured to get the payment. The gambling games are generic in our fair online gambling scheme. Mental poker is one of most popular games of online gambling. In this paper, efficient and secure mental poker protocols are provided. These mental poker protocols are based on multiple encryption and decryption of individual cards. These protocols satisfy all major security requirements of a real mental poker. The card salesman has been got rid of and the minimal effect due to collusion has been guaranteed. These protocols are more efficient compared with other known protocols. The strategies of players can be kept confidential with the introduction of a dealer. These mental poker protocols are suitable for implementation in an online card game.

Related papers

Efficient Electronic Gambling: An Extended Implementation of the Toolbox for Mental Card Games.

Heiko Stamer

Abstract: There are many wonderful protocols in cryptography which are still waiting for their realization. Here we consider efficient solutions for secure electronic card games. Our contribution seems to be the first known practical implementation that requires no trusted third-party and simultaneously keeps the players ’ strategies confidential. The provided open source library LibTMCG can be used for creating secure peer-to-peer games and furthermore for some unusual applications, e.g., secure multiparty computation or simple electronic voting schemes.

•Jan 1, 2005•5 citations

Efficient TTP-free mental poker protocols

Weiliang Zhao, Vijay Varadharajan

Zhao et al proposed an efficient mental poker protocol which did not require using a trusted third party (TTP). The protocol is efficient and suitable for any number of players but it introduces a security flaw. In this paper, we propose two mental poker protocols based on Zhao's previous work. The security flaw has been removed and the additional computing cost is small.

International Conference on Information Technology: Coding and Computing (ITCC)•Jan 1, 2005•7 citations

Security protocol for P2P card games

Jia Cao

Unlike real world and C/S model,it is difficult for P2P games to guarantee security and fairness because it lacks of a Trusted Third-party(TTP).In this paper,a secure scheme for P2P poker games is proposed,which is based on common operations,such as permutation and symmetric cryptography.The logic security analysis manifests that it is secure and fair.On the other hand,the communication costs of the scheme is low so that it can be used to wireless hand-hold devices.

Computer Engineering and Applications Journal•Jan 1, 2011•2 citations

A fast mental poker protocol

Tzer-jen Wei, Lih-Chung Wang

Abstract. In this paper, we present a fast and secure mental poker protocol. The basic structure is the same as Barnett & Smart's and Castellà-Roca's protocols but our encryption scheme is different. With this alternative encryption scheme, our shuffle is not only twice as fast, but it also has different security properties. As such, Barnett & Smart's and Castellà-Roca's security proof cannot be applied to our protocol directly. Nevertheless, our protocol is still provably secure under the DDH assumption. The only weak point of our protocol is that reshuffling a small subset of cards might take longer than Barnett & Smart's and Castellà-Roca's protocols. Therefore, our protocol is more suitable for card games such as bridge, most poker games, mahjong, hearts, or black jack, which do not require much partial reshuffling.

Journal of Mathematical Cryptology•May 2, 2012•7 citations

A Modified Three-party Poker Protocol

Fan Xiang-kui

Poker protocol realizes the fairness of poker games without the third party's participation.However,the conventional three-party protocol without the presence of the fourth-party could cause unfair poker games if the two players collaborate with each other.In view of this situation,a modified three-party protocol is proposed.Based on the new protocol,all players use their own public keys to encrypt the 54 cards during the first cycling,then duding the second cycling,all players obtain their own cards and decrypt step by step the cards of the opponent on the left,then during the third cycling,all the cards could be decrypted in order to testify the reliability of the algorithm.The comparison experiment of the modified protocol and the conventional protocol shows that the modified protocol could effectively solve the problem of fairness.

Communications technology•Jan 1, 2010•0 citations

On the security of an efficient TTP-free mental poker protocol

Jordi Castellà‐Roca, Josep Domingo‐Ferrer

Using commutative cryptosystems is a way to obtain efficient mental poker protocols which do not require using a trusted third party (TTP). However, the security of such protocols depends on the particular cryptosystem used. We show that a TTP-free mental poker protocol using an ElGamal-like commutative cryptosystem is insecure.

International Conference on Information Technology: Coding and Computing (ITCC)•Jan 1, 2004•7 citations
Online gambling allows users to participate in mental games and bet over the Internet. It can open new opportunities for casinos to make more money; however, at the same time, there are a lot of security challenges. In this paper, we describe our scheme for secure online gambling and secure mental poker protocols over the Internet based on our previous researches. Our scheme provides both the fairness of online gambling processes and secure linking of the online gambling with payment. A unique link between payments and gambling outcome is provided so that the winner can be ensured to get the payment. The gambling games are generic in our fair online gambling scheme. Mental poker is one of most popular games of online gambling. In this paper, efficient and secure mental poker protocols are provided. These mental poker protocols are based on multiple encryption and decryption of individual cards. These protocols satisfy all major security requirements of a real mental poker. The card salesman has been got rid of and the minimal effect due to collusion has been guaranteed. These protocols are more efficient compared with other known protocols. The strategies of players can be kept confidential with the introduction of a dealer. These mental poker protocols are suitable for implementation in an online card game.
Abstract: There are many wonderful protocols in cryptography which are still waiting for their realization. Here we consider efficient solutions for secure electronic card games. Our contribution seems to be the first known practical implementation that requires no trusted third-party and simultaneously keeps the players ’ strategies confidential. The provided open source library LibTMCG can be used for creating secure peer-to-peer games and furthermore for some unusual applications, e.g., secure multiparty computation or simple electronic voting schemes.
Abstract. In this paper, we present a fast and secure mental poker protocol. The basic structure is the same as Barnett & Smart's and Castellà-Roca's protocols but our encryption scheme is different. With this alternative encryption scheme, our shuffle is not only twice as fast, but it also has different security properties. As such, Barnett & Smart's and Castellà-Roca's security proof cannot be applied to our protocol directly. Nevertheless, our protocol is still provably secure under the DDH assumption. The only weak point of our protocol is that reshuffling a small subset of cards might take longer than Barnett & Smart's and Castellà-Roca's protocols. Therefore, our protocol is more suitable for card games such as bridge, most poker games, mahjong, hearts, or black jack, which do not require much partial reshuffling.
Poker protocol realizes the fairness of poker games without the third party's participation.However,the conventional three-party protocol without the presence of the fourth-party could cause unfair poker games if the two players collaborate with each other.In view of this situation,a modified three-party protocol is proposed.Based on the new protocol,all players use their own public keys to encrypt the 54 cards during the first cycling,then duding the second cycling,all players obtain their own cards and decrypt step by step the cards of the opponent on the left,then during the third cycling,all the cards could be decrypted in order to testify the reliability of the algorithm.The comparison experiment of the modified protocol and the conventional protocol shows that the modified protocol could effectively solve the problem of fairness.