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

Electronics Letters

Bounded-to-unbounded poker game

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

Published Feb 3, 2000• 5 citations
Publisher

Abstract

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.
DOI
10.1049/el:20000239

Related papers

Quantized Poker

Steven A. Bleiler

Poker has become a popular pastime all over the world. At any given moment one can find tens, if not hundreds, of thousands of players playing poker via their computers on the major on-line gaming sites. Indeed, according to the Vancouver, B.C. based pokerpulse.com estimates, more than 190 million US dollars daily is bet in on-line poker rooms. But communication and computation are changing as the relentless application of Moore's Law brings computation and information into the quantum realm. The quantum theory of games concerns the behavior of classical games when played in the coming quantum computing environment or when played with quantum information. In almost all cases, the "quantized" versions of these games afford many new strategic options to the players. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer \cite{Meyer} published in Physics Review Letters in 1999. The ensuing near decade has seen an explosion of contributions and controversy over what exactly a quantized game really is and if there is indeed anything new for game theory. With the settling of some of these controversies \cite{Bleiler}, it is now possible to fully analyze some of the basic endgame models from the game theory of Poker and predict with confidence just how the optimal play of Poker will change when played in the coming quantum computation environment. The analysis here shows that for certain players, "entangled" poker will allow results that outperform those available to players "in real life".

arXiv:0902.2196•Feb 12, 2009•0 citations

A secure mental poker protocol over the Internet

Weiliang Zhao, Weiliang Zhao, Vijay Varadharajan +1 more

An efficient and secure mental poker scheme is proposed in this paper. It is based on multiple encryption and decryption of individual cards. The protocol satisfies all major security requirements of a real mental poker. It gets rid of the Card Salesman and guarantees minimal effect due to collusion of players. The protocol is secure and more efficient compared with other known protocols. The strategies of players can be kept confidential with the introduction of a Dealer. The protocol is suitable to be implemented in an on-line card game.

•Jan 1, 2003•21 citations

Quantized Poker

Steven A. Bleiler

Poker has become a popular pastime all over the world. At any given moment one can find tens, if not hundreds, of thousands of players playing poker via their computers on the major on-line gaming sites. Indeed, according to the Vancouver, B.C. based pokerpulse.com estimates, more than 190 million US dollars daily is bet on-line poker rooms. But communication and computation are changing as the relentless application of Moore's Law brings computation and information into the quantum realm. The quantum theory of games concerns the behavior of classical games when played the coming quantum computing environment or when played with quantum information. In almost all cases, the versions of these games afford many new strategic options to the players. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer \cite{Meyer} published Physics Review Letters 1999. The ensuing near decade has seen an explosion of contributions and controversy over what exactly a quantized game really is and if there is indeed anything new for game theory. With the settling of some of these controversies \cite{Bleiler}, it is now possible to fully analyze some of the basic endgame models from the game theory of Poker and predict with confidence just how the optimal play of Poker will change when played the coming quantum computation environment. The analysis here shows that for certain players, entangled poker will allow results that outperform those available to players in real life.

•Feb 12, 2009•2 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

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

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
Poker has become a popular pastime all over the world. At any given moment one can find tens, if not hundreds, of thousands of players playing poker via their computers on the major on-line gaming sites. Indeed, according to the Vancouver, B.C. based pokerpulse.com estimates, more than 190 million US dollars daily is bet in on-line poker rooms. But communication and computation are changing as the relentless application of Moore's Law brings computation and information into the quantum realm. The quantum theory of games concerns the behavior of classical games when played in the coming quantum computing environment or when played with quantum information. In almost all cases, the "quantized" versions of these games afford many new strategic options to the players. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer \cite{Meyer} published in Physics Review Letters in 1999. The ensuing near decade has seen an explosion of contributions and controversy over what exactly a quantized game really is and if there is indeed anything new for game theory. With the settling of some of these controversies \cite{Bleiler}, it is now possible to fully analyze some of the basic endgame models from the game theory of Poker and predict with confidence just how the optimal play of Poker will change when played in the coming quantum computation environment. The analysis here shows that for certain players, "entangled" poker will allow results that outperform those available to players "in real life".
An efficient and secure mental poker scheme is proposed in this paper. It is based on multiple encryption and decryption of individual cards. The protocol satisfies all major security requirements of a real mental poker. It gets rid of the Card Salesman and guarantees minimal effect due to collusion of players. The protocol is secure and more efficient compared with other known protocols. The strategies of players can be kept confidential with the introduction of a Dealer. The protocol is suitable to be implemented in an on-line card game.
Poker has become a popular pastime all over the world. At any given moment one can find tens, if not hundreds, of thousands of players playing poker via their computers on the major on-line gaming sites. Indeed, according to the Vancouver, B.C. based pokerpulse.com estimates, more than 190 million US dollars daily is bet on-line poker rooms. But communication and computation are changing as the relentless application of Moore's Law brings computation and information into the quantum realm. The quantum theory of games concerns the behavior of classical games when played the coming quantum computing environment or when played with quantum information. In almost all cases, the versions of these games afford many new strategic options to the players. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer \cite{Meyer} published Physics Review Letters 1999. The ensuing near decade has seen an explosion of contributions and controversy over what exactly a quantized game really is and if there is indeed anything new for game theory. With the settling of some of these controversies \cite{Bleiler}, it is now possible to fully analyze some of the basic endgame models from the game theory of Poker and predict with confidence just how the optimal play of Poker will change when played the coming quantum computation environment. The analysis here shows that for certain players, entangled poker will allow results that outperform those available to players in real life.
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.