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

Communications technology

A Modified Three-party Poker Protocol

Fan Xiang-kui

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

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.

Related papers

Fair online gambling scheme and TTP-free mental poker protocols

Weiliang Zhao, Vijay Varadharajan

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.

Information Assurance and Security•Jan 1, 2006•0 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

Bounded-to-unbounded poker game

Lein Harn, H.-Y. Lin, Guang Gong

The bounded-to-unbounded poker game is a fair poker game that can be played over the Internet. It allows both dealer and player to distribute cards in a fair and secure manner. In addition, the presented protocol assumes that the player is computationally bounded; however, the dealer is computationally unbounded.

Electronics Letters•Feb 3, 2000•5 citations

POKER GAME BASED ON RSA ENCRYPT ARITHMETIC

Wang Shi-min

Along with the Internet universal,the safe problem of network also increasingly important,we need a kind of legal means urgently to guarantee the communications' safety,protocol appear under this kind of background.Start from self-enforcing protocol that in the code protocol,intelligence poker game based on a fair coin toss protocol hare studied,it was RSA key system that employed in the agreement.The fairness of random number generator communication employed has got the further assurance in the procedure.

Journal of Beijing Technology and Business University•Jan 1, 2007•0 citations

Secure Grouping Protocol Using a Deck of Cards

Yuji HASHIMOTO, Kazumasa Shinagawa, Koji Nuida +2 more

We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members of his/her group, while he/she may not know anything about how the remaining parties are divided (except for certain public predetermined constraints, such as the number of parties in each group). In this paper, we construct an information-theoretically secure protocol using a deck of physical cards to solve the problem, which is jointly executable by the parties themselves without a trusted third party. Despite the non-triviality and the potential usefulness of the secure grouping, our proposed protocol is fairly simple to describe and execute. Our protocol is based on algebraic properties of conjugate permutations. A key ingredient of our protocol is our new techniques to apply multiplication and inverse operations to hidden permutations (i.e., those encoded by using face-down cards), which would be of independent interest and would have various potential applications.

arXiv:1709.07785•IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Aug 31, 2018•25 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
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.
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.
Along with the Internet universal,the safe problem of network also increasingly important,we need a kind of legal means urgently to guarantee the communications' safety,protocol appear under this kind of background.Start from self-enforcing protocol that in the code protocol,intelligence poker game based on a fair coin toss protocol hare studied,it was RSA key system that employed in the agreement.The fairness of random number generator communication employed has got the further assurance in the procedure.
We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members of his/her group, while he/she may not know anything about how the remaining parties are divided (except for certain public predetermined constraints, such as the number of parties in each group). In this paper, we construct an information-theoretically secure protocol using a deck of physical cards to solve the problem, which is jointly executable by the parties themselves without a trusted third party. Despite the non-triviality and the potential usefulness of the secure grouping, our proposed protocol is fairly simple to describe and execute. Our protocol is based on algebraic properties of conjugate permutations. A key ingredient of our protocol is our new techniques to apply multiplication and inverse operations to hidden permutations (i.e., those encoded by using face-down cards), which would be of independent interest and would have various potential applications.