EP1741477A2

EP1741477A2 - System for implementing a game of chance over a communications network

Info

Publication number: EP1741477A2
Application number: EP06015875A
Authority: EP
Inventors: Andreu Riera Jorba; Joan Borrell Viader; Jordi Castella Roca; Joan Miquel Bardera Bosch; Christophe Primault
Original assignee: Kinamik Data Integrity SL; Scytl Online World Security SA
Current assignee: Kinamik Data Integrity SL
Priority date: 2003-08-27
Filing date: 2003-08-27
Publication date: 2007-01-10
Also published as: AU2003262579A1; WO2005021118A1; EP1669115A1; EP1741477A3

Abstract

The recommended system comprises a set of programs through which one or more players participates in said game cooperating in the generation of chance events.

Description

Field of the invention

This invention describes a system for implementing games of chance over a communication network.
The summary of this invention contains material that may be protected by Copyright. The owners of said Copyright do not object at all to third parties reproducing the description of this patent application in its published or final version in Patent Offices, but they reserve all rights regarding the Copyright in other aspects that can be derived from said document.

Background to the invention

Gaming remotely or online gaming, offers players a series of advantages, since it gives them independence in terms of location (they do not need to be physically), and time-. Owing to these advantages, the deployment of remote gaming has increased rapidly.
The players see on site all the actions taking place during the game and Legislative Authorities periodically audits all the elements used for the gaming. This auditing guarantees that there are no mechanisms altering the random nature of the result. In the online gaming, the results are usually generated by the online casino using a pseudo random generator. However, the online casino can discard the result of said generator and choose a result that benefits it.
Some prior inventions relate to systems and/or methods for remote gaming over a communications network. A first group of inventions are described in US 4.926.327 , US 4.958.835 , US 5.038.022 , US 6.196.920 , GB 2307184 , US 5.755.621 and US 5.823.879 . Currently peer relationship models, also known as P2P (peer to peer), are becoming increasingly popular on the Internet. In this gaming model, the players can play without involving a casino. The most significant proposals in this field are the following patents, US 5.984.779 and US 6.152.824 . The first invention relates to a game machine that allows playing on a casino without the need of an intermediary, also introducing the possibility that the machines can be connected remotely over a communication network such as the Internet. The players hire the machines and all the prizes are distributed among the game participants. It does not describe the methods for generating the random factor, nor the security or honesty of the gaming system. The second invention describes the architecture of an Online Casino which allows the game to be played with a central figure who distributes the messages without intervening in the game. Said system encrypts the communications among the game participants to ensure their privacy. Also it does not describe any method for protecting the information generated during the game, so there is no tamperproof evidence that the game was played honestly. Players are vulnerable to the collaboration between the system operator and one of the players on their benefit.
The present invention relates to a game of chance system, preferably remote, which according to the distributions of its elements allows a gaming with or without an intermediary. When the game is implemented with an intermediary, the latter takes an active part in the game. Typically, the intermediary would be an online casino. In the second organisation, the players play directly among themselves, according to a P2P model.

Brief summary of the invention

This invention describes a system for implementing a game of chance. The system includes a set of programs and/or implementing platforms forming a Player Agent 101 through which at least one of said players participates in said game.
According to an embodiment example, the preferred system also includes a set of programs and/or implementing platforms forming a Croupier Agent 109, intended to perform the actions corresponding to a Croupier in a casino game.
The invention proposes the game events be generated with the cooperation of the Croupier Agent and/or one or more Player Agent(s).
Other aspects and details of the invention are referenced in the detailed summary thereof, with reference to the figures.

Brief description of the Figures

Figure 1 represents the elements making up the system for implementing an impartial game of chance over a communications network.
Figure 2 represents an example of how the elements of said system of this invention interact together by means of a Communications Network 201.
Figure 3 represents the game stages for a player..
Figure 4 represents the stages involved in the development of the game.

Detailed description of the invention

The essence of games of chance is to obtain at least one event (a roulette position, a card in a pack, the face of a die, etc.) in a random way, determining the game result using at least this event. In the on site games the events are obtained by means of a roulette wheel, a pack of cards, or dice for example.
In order to participate in the game over a communications network, the players need a set of programs and/or implementing platforms. Hereinafter this set of programs will be called Player Agent 101, which can be an application able to establish remote secure connections, or a Plug-In for the player's Internet browser. The implementing platform, as its name implies, allows the Player Agent 101 to be deployed, and is able to connect to a communication network. The implementing platform can be a PC, a digital personal assistant, or a mobile telephone terminal, for example.
This invention considers the possibility of an Impartial Entity having a set of programs and/or implementing platforms so that it can take a more active part in the remote game, for example by generating the game events or by making the Player Agent 101 available to the players. Hereinafter, the term Impartial Agent 107 will be applied to this set of programs that preferably form an application that can provide a secure remote connection. The associated implementing platform, as its name implies, allows the Impartial Agent 107 to be implemented. This implementing platform can be a computer, or a secure tamperproof module that can internally execute applications, such as Hardware Secure Module (HSM) nShield by the manufacturer of nCipher [http://www.ncipher.com/nshield, 16/06/2003].
In a remote gaming system, the functions of the croupier can be automated by means of associated communication means and/or programs. Hereinafter this set will be called Croupier Agent 109.
In a first option, the Impartial Agent 107 implements a cryptographic protocol to generate impartial game events, in combination with the Croupier Agent 109. In a second option, the Impartial Agent 107 generates impartial game events. In a third option, the Croupier Agent 109 implements a cryptographic protocol to generate impartial game events, in combination with the Player Agent 101.
In any of the three options mentioned, pseudo random values are obtained. When any random value is obtained during the gaming process, it is obtained via pseudo random number generation routines (PRNG).
As mentioned in a first option, the Croupier Agent 109 applies a cryptographic protocol for the Impartial Generation of Game Events 405, together with the Impartial Agent 107. Five non-limiting embodiments of said first option, are provided below. The embodiments use a commitment cryptographic protocol as a basic tool. A first commitment protocol was introduced by Blum in 1982 [Blum M., Coin flipping by telephone: a protocol for solving impossible problems, Proc. IEEE Computer Conference, pages 133-137, IEEE, 1982]. In a commitment protocol one part, or commitment element, is compromised of certain information X to other parties or commitment verifiers. A commitment protocol C_p is made up of two phases; a commitment phase followed by a commitment release phase. In the commitment phase, the commitment element calculates a transformation T of the information X, T = C_P {X}, and makes T available to the commitment verifiers. In the second phase, the commitment element reveals X and/or the information for verifying the commitment, T == C_P{X}. The procedure can be described with the following physical example: In the first phase each participant places certain information in a box, which he locks and hands to the rest of the participants. In the second phase, he delivers the key for opening the box and recovering the information inside the initial box. The commitment verifiers cannot know anything about X from T, and the committed information X cannot be altered by its owner between the first and second stages. A general overview of the state of the art related to commitment protocols can be found in [Schneier B., Applied Cryptography Second Edition: Protocols, Algorithms, and Source Code in C, Second Edition, John Wiley & Sons, 1996].
In a first embodiment of said first option, the player places a bet A by means of his/her Player Agent 101. The Player Agent 101 is committed to the bet A by means of a cryptographic commitment protocol C_P, and obtains a transformation T, T = C_P{A}. The Player Agent 101 makes this accessible to the Croupier Agent 109. Said Croupier Agent 109 obtains a value V₁ in a random manner from which the result of the game is derived, and makes V₁ accessible to the Player Agent 101. Next the Player Agent 101 makes the player's bet A accessible to the Croupier Agent 109 who checks that the commitment protocol T == C_P {A} is correct.
Said first embodiment of the first option is securer if, in addition, the following steps are taken:

The Croupier Agent 109 digitally signs V₁ with the private component S_C of its pair of keys, X = S_C(V₁) and makes X accessible to the Player Agent 101.
The Player Agent 101 digitally signs A with the private component of a pair of asymmetric keys belonging to said player, such as (P_J, S_J), (P^A _J, S^A _J), (P^P _J, S^P _J), (P^G _J, S^G _J).

A

Player Agent

C_P

T₁, T₁

C_P{A}.

Player Agent

T₁

Croupier Agent

V₁

T₂, T₂

C_P{V₁}.

Croupier Agent

T₁

T₂

Impartial Agent

V₂

S_l

(S_l, P_l)

X₁

{V₂, T₁, T₂}, X₁

S₁

V₂

T₁

T₂

Impartial Agent

V₂

X₁

Croupier Agent

V₁, V₂ and X₁

Player Agent

A

Croupier Agent

Player Agent

V₁

V₂

In a third embodiment of said first option, the Player Agent 101 makes available a player's request to obtain a game event. The Croupier Agent 109 obtains a first value V₁ in a random manner and implements a commitment protocol C_P with V₁ obtaining a transformation T₁, T₁ = C_P{V₁}. The Croupier Agent 109 makes T₁ accessible to the Player Agent 101 and to the Impartial Agent. The Player Agent 101 makes a player's bet A accessible to the Croupier Agent 109. The Impartial Agent 107 obtains a second value V₂ and by means of the private component S_l of the pair of keys corresponding to the Impartial Authority (P_l, S_l), calculates a digital signature X₁ on {V₂, T₁}, X₁ = S_l <V₂ lT₁ >. The Impartial Agent 107 makes V₂ and X₁ accessible to the Croupier Agent 109. The Croupier Agent 109 makes V₁, T₁, V₂ and X₁ accessible to the Player Agent 101. The Croupier Agent 109 and the Player Agent 101 obtain said game event from V₁ and V₂.
In a fourth embodiment of said first option, the Player Agent 101 makes a player's bet A accessible to the Croupier Agent 109. The Croupier Agent 109 obtains a first value V₁ in a random manner and implements a commitment protocol C_P with V₁ obtaining a transformation T₁, T₁ = C_P{V₁}. The Croupier Agent 109 makes T1 and A accessible to the Impartial Agent 107. The Impartial Agent 107 obtains a second value V₂ and by means of the private component S₁ of the pair of keys corresponding to the Impartial Authority (P_l, S_l) calculates a digital signature X₁ on {T₁, V₂,A}, X₁ = S_l<V₂ /T₁ /A>. The Impartial Agent 107 makes V₂ and X₁ accessible to the Croupier Agent 109. The Croupier Agent 109 makes V₁, V₂, T₁ and X₁ available to the Player Agent 101. The Croupier Agent 109 and the Player Agent 101 obtain said game event from V₁ and V₂.
In a fifth embodiment of said first option, the player places a bet A by means of the Player Agent 101. The Player Agent 101 implements a commitment protocol C_P with A, and obtains a transformation T₁, T₁ = C_P{A}. The Player Agent 101 makes T₁ accessible to the Croupier Agent 109. The Croupier Agent 109 obtains a first value V₁ in a random manner and implements a commitment protocol C_P with V₁, obtaining a transformation T₂, T₂ = C_P{V₁}. The Croupier Agent 109 makes T₂ accessible to the Player Agent 101. The Player Agent 101 makes A accessible to the Croupier Agent 109, which makes A and T₂ accessible to the Impartial Agent 107. The Impartial Agent 107 obtains a second value V₂ and by means of the private component S_l of the pair of keys corresponding to the Impartial Authority (P_l, S_l ) calculates a digital signature X₁ on {T₂, A, V₂}, X₁ = S_l <V₂ /T₂ /A>. The Impartial Agent 107 makes V₂ and X₁ accessible to the Croupier Agent 109. The Croupier Agent 109 makes V₁, V₂ , and X₁ available to the Player Agent 101. The Croupier Agent 109 and the Player Agent 101 obtain said game event from V₁ and V₂.
Said second, third, fourth and fifth embodiments of said first option are more secure if, in addition, the following steps are taken:

The Player Agent 101 digitally signs A with the private component of a pair of asymmetric keys belonging to said player, such as (P_j, S_i), (P^A _J, S^A _J), (P^P _J, S^P _J ), (P^G _j, S^G _J ).
The Croupier Agent 109 digitally signs T₁ with the private component S_C of its pair of keys (P_c, S_c), X₀ = S_C< V₁ > and makes X₀ accessible to the Impartial Agent 107. The Impartial Agent 107 includes X ₀ in X₁, X₁ = S_I<V₂ /T₁ /T₂ /X₀>.
The Croupier Agent 109 makes the identifier Id_M of the Virtual Gaming Table 113 accessible to the Impartial Agent 107. The Impartial Agent 107 includes Id_M in the digital signature X₁ , X₁ = S_l<V₂ /T₁ /T₂ /Id_M>.
The Impartial Agent 107 includes a serial number N_i in each digital signature it creates.

Impartial Agent

Player Agent

Menezes, A.J., Oorschot, P.C., Vanstone, S.A., Handbook of Applied Cryptography, CRC Press, 1997

As mentioned in a third option, the Player Agent 101 implements a cryptographic protocol for the Impartial Generation of Game Events 405, together with the Croupier Agent 109. In a first embodiment of the third option, the Player Agent 101 and the Croupier Agent 109 carry out one of the protocols described in the International application [ PCT/ES02/00485 ]. In a second embodiment of the third option, the Player Agent 101 and the Croupier Agent 109 carry out one of the protocols described in the Patent of Invention US 6.264.557 . In a third embodiment of the third option, the Player Agent 101 and the Croupier Agent 109 carry out one of the protocols described in the Patent of Invention US 6.165.072 .
The end of a time period set by the Croupier Agent 109, or the Player Agent 101 performing the croupier's functions, indicates the throw or game hand to be completed,

Claims

System for implementing a game of chance over a communications network, comprising the following elements:
a) a set of programs and/or implementing platforms forming one or more Player Agents (101) through which at least one player participates in said game; and

b) a set of programs and/or implementing platforms forming a Croupier Agent (109), intended to carry out the actions corresponding to a Croupier in a casino type game; and

c) a cryptographic protocol for generating impartial game events such as a position on a roulette wheel, a card in a pack, or a face of a die, with the co-operation of said Croupier Agent (109) and a set of programs and/or implementing platforms forming an Impartial Agent (107).
System according to claim 1, characterised in that said cryptographic protocol for generating impartial game events, such as a position on a roulette wheel, a card in a pack, or a face of a die, generates said impartial game events with the co-operation of at least two of said Player Agents (101), pertaining to two different players.
System according to claim 1, characterised in that said cryptographic protocol for generating impartial game events such as a position on a roulette wheel, a card in a pack, or a face of a die, generates said impartial game events with the co-operation of at least one of said Player Agents (101) and said Croupier Agent (109).
Method for implementing a game of chance comprising an Impartial Agent in charge to generate the chance events and one or more Player Agents through which players participate in chance games; where the chance events are generated with the cooperation of two or more Player Agents or with the cooperation of the Impartial Agent and one or more Player Agents.