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

Computer Engineering and Applications Journal

Security protocol for P2P card games

Jia Cao

Published Jan 1, 2011• 2 citations
OpenAlex

Abstract

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.

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

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

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

Design and verification of a non-repudiation protocol based on receiver-side smart card

Jiajia Liu, Laurent Vigneron

All the existing non-repudiation protocols ensuring strong fairness have to assume that the communication channel between trusted third party (TTP) and each player is resilient at least. Where only unreliable channel can be guaranteed, all these protocols become impractical. In this study, based on smart card on the receiver side, the authors design a fair non-repudiation protocol that needs no assumptions on the communication channel. The smart card takes over the role of an online TTP server. Without a dedicated TTP server, this protocol is ideal for some ad hoc scenarios where no infrastructure is available. This protocol can also be easily modified to support fair exchange of time-sensitive data. Compared with other traditional security protocols, automatic formal verification of fair non-repudiation protocols is much harder to achieve. The authors use meta-reasoning method to prove that the fair exchange property of this protocol can be reduced to three secrecy properties that fall into the scope of today's most automatic verification tools and therefore can be easily verified. The authors also use a recently proposed automatic method to verify the non-repudiation properties and fairness property of our protocol.

IET Information Security•Jan 6, 2010•9 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
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.
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.
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.
All the existing non-repudiation protocols ensuring strong fairness have to assume that the communication channel between trusted third party (TTP) and each player is resilient at least. Where only unreliable channel can be guaranteed, all these protocols become impractical. In this study, based on smart card on the receiver side, the authors design a fair non-repudiation protocol that needs no assumptions on the communication channel. The smart card takes over the role of an online TTP server. Without a dedicated TTP server, this protocol is ideal for some ad hoc scenarios where no infrastructure is available. This protocol can also be easily modified to support fair exchange of time-sensitive data. Compared with other traditional security protocols, automatic formal verification of fair non-repudiation protocols is much harder to achieve. The authors use meta-reasoning method to prove that the fair exchange property of this protocol can be reduced to three secrecy properties that fall into the scope of today's most automatic verification tools and therefore can be easily verified. The authors also use a recently proposed automatic method to verify the non-repudiation properties and fairness property of our protocol.
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.