This application claims the benefit under 35 U.S.C. § 365 of International Application PCT/FR00/03382, filed Dec. 5, 2000, which claims the benefit of French Application No. 9915950, filed Dec. 17, 1999.
The present invention relates to a secure method of remote game management between a game management center and remote game terminals.
The organizers of games are increasingly exploiting open networks, such as the Internet, or possibilities offered by interactive television to organize remote games.
Document U.S. Pat. No. 5,850,447 describes in particular a system for participating in interactive televised games with means for verifying the chronology of the events connected with the games.
The main problems posed by remote games are:
The solutions currently proposed for guaranteeing security in remote games consist in players registering with the organizer of the game, before playing. In this case they receive an identifier and an associated secret code which they must then use whenever they wish to play.
Having to register before being able to play implies that the player cannot play impulsively. Another drawback of this system is that the anonymity of the player is not guaranteed since he always plays under an identifier.
An aim of the present invention is to solve the aforesaid problems by proposing a novel method of remote game management allowing players to play impulsively, without any prior registration phase, and anonymously, while guaranteeing security, both from the point of view of the organizer of the game and that of the player.
To this end, the invention relates, according to a first aspect, to a secure method of remote game management between a game management center and at least one remote game terminal which comprises the following steps implemented by the remote game terminal.
The first step consists in receiving from said game management center a first message containing a game identifier as well as a question.
The second step consists in constructing a response message containing the game identifier and the response of a player using said game terminal to said question; the third step consists in blinding the response message with a secret; and the fourth step consists in transmitting the blinded response message to the game management center.
The fifth step consists in receiving from said game management center an acknowledgement of receipt when the player's response sent during the fourth step has been taken into account by the game management center.
By virtue of the method of the invention, the player can play impulsively since he need not be preregistered with the game management center. Moreover, sending his response in a blinded form guarantees his anonymity and at the same time the security of the transmission of his response.
According to a first embodiment of the invention, the third step consists in generating a secret random number; in applying a one-way function to this secret number so as to generate a public blinding number and in using the public blinding number to blind the response message.
According to a second embodiment of the invention, the third step consists in enciphering the response message with the aid of a symmetric secret key generated by said remote game terminal.
According to a particular embodiment, the first message sent during the first step furthermore comprises: an identifier of the game management center; a certificate, delivered by a certification authority to the game management center, decipherable with the aid of a public key of the certification authority, yielding the public key of the game management center corresponding to the identifier of said game management center; and a signature of part or of the whole of said message with the aid of the private key associated with the public key of the game management center.
This advantageously makes it possible to authenticate the game management center and, in particular, to ensure that the question posed does indeed originate from a game organizer accredited by the certification authority and has not been altered during transmission by a hacker.
According to another aspect of this particular embodiment, each remote game terminal contains the public key of the certification authority and, during the second step, the remote game terminal undertakes, before constructing the response message, the verification of the authenticity of the game management center with the aid of said public key of the certification authority.
According to another particular embodiment of the invention, the response message constructed in the second step by the remote game terminal furthermore contains auxiliary customization data. This can comprise the name of the player, his address, his telephone number, etc. These data are of course transmitted in hidden form by virtue of the public blinding number so as to guarantee the anonymity of the player and will not be disclosed other than in the case where the player wins and wishes to obtain his prize.
According to another preferred embodiment of the invention, the blinded response message is transmitted during the fourth step in a form enciphered with the aid of the public key of the game management center. This offers a second level of security, in addition to the blinding of the response.
According to another embodiment of the invention, the acknowledgement of receipt sent during the fifth step comprises a signature, with the aid of the private key associated with the public key of the game management center, of a message formed of the concatenation of the game identifier and of the blinded response message sent by the remote game terminal.
According to another aspect of the invention, the method comprises a following additional step of claiming the prize won by a player when the player's response sent during the fourth step is the right answer to the question contained in the first message received during the first step.
The sixth step consists, in respect of the remote game terminal used by the winning player, in sending the game management center a message claiming the prize containing at least: the acknowledgement of receipt received from the game management center in the fifth step; and an item proving that said game terminal is in possession of the secret used to blind the response message in the third step.
If the response message has been blinded during the third step according to the first embodiment of the invention, then the item transmitted in the sixth step comprises, in a first variant, the public blinding number and the secret random number which were generated in the third step.
In a second variant, the item transmitted in the sixth step comprises the public blinding number and a means of proving, via a zero-knowledge protocol, that the terminal is moreover in possession of the secret random number used to generate said public blinding number.
If the response message has been blinded during the third step according to the second embodiment of the invention, then the item transmitted in the sixth step comprises the symmetric secret key.
The invention also relates to a remote game terminal capable of implementing at least one of steps 1 to 6 of the method hereinabove.
The invention also relates, according to a second aspect, to a secure method of remote game management between a game management center and at least one remote game terminal which comprises the following steps implemented by the game management center.
The first step consists in sending the remote game terminal a first message containing a game identifier as well as a question.
The second step consists in receiving from said remote game terminal the response of a player in a response message blinded with a secret known only to the remote game terminal.
The third step consists in verifying that the blinded response message is received at an instant prior to that of the broadcasting of the response to the question posed in the first step.
The fourth step consists, in case of positive verification during the third step, in sending an acknowledgement of receipt to said remote game terminal.
The fifth step consists in broadcasting the response to the question posed in the first step to said remote game terminal.
In a particular embodiment of this aspect of the invention, the game management center is linked to all the remote game terminals by a first bidirectional communication path and by a second monodirectional communication path from the management center to the terminals. According to this embodiment, the first message is sent during the first step, via said monodirectional communication path. It may for example be a path for broadcasting over the airwaves, by cable or by satellite.
According to another aspect of this embodiment, the broadcasting of the response during the fifth step is performed via the monodirectional communication path.
According to another particular embodiment of this second aspect of the invention, the method comprises additional steps, implemented by the game management center, of dispatching the prize to a winning player.
The sixth step consists in receiving from a remote game terminal used by the winning player a message claiming the prize containing at least: the acknowledgement of receipt sent in the fourth step; and an item proving that said remote game terminal is in possession of the secret used to blind the response message received in the second step.
The seventh step consists in verifying the validity of the response received in said message claiming the prize.
The eighth step consists, in case of positive verification during the seventh step, in implementing means for dispatching the prize to the winning player.
The invention furthermore relates to a game management center capable of implementing at least one of steps 1 to 8 of the method hereinabove.
Other characteristics and advantages of the invention will emerge from the following detailed description, taken by way of nonlimiting example, with reference to the appended drawings in which:
The method of remote game management which will be detailed hereinbelow can be implemented in various types of environments. It is more especially adapted to applications of games on the Internet or within the framework of interactive television.
Represented in
The remote game terminals may for example be television receivers comprising a module furnished with a microprocessor in which a game application corresponding to that executed in the server 1 is executed. They may also be decoders of digital or analog televised signals transmitted by cable or by satellite or even game consoles. The remote game terminals comprise a user interface consisting in particular of a display screen making it possible to depict questions posed by the organizer of the game, of a keypad or of any other means making it possible to enter an answer in response to the question posed (in particular a remote control).
In the example of
For example, in the case where the organizer of the game is a distributor of televised programs, the broadcasting center 11 is that via which he already broadcasts his programs. The monodirectional network 31 is for example a network for broadcasting over the airwaves, by cable or by satellite, digital or analog televised signals. It makes it possible to transmit items of information simultaneously from the game management center 1 to all the remote game terminals 21, 22, 23 to which it is linked.
The first bidirectional network 30 is for example formed of the telephone lines of the Switched Telephone Network or else of higher speed special-purpose digital lines. In the case where the game method is implemented within the framework of interactive television, the bidirectional network 30 forms the return path for the interactive programs. This network 30 makes it possible to establish individual communications in both directions between each remote game terminal and the game management center.
In a second type of environment for implementing the game method according to the invention, represented in
In this exemplary application, the remote game terminals consist for example of personal computers located at users forming potential players.
We shall now describe the game management method proper in conjunction with
The game management method of the invention is especially adapted to games in which a question is posed to the players, giving them a certain time in which to respond. It may involve a meaningful question requiring particular knowledge in order to answer it. In the case of a lottery, the question may invite the players to bet on a future random draw. In this case, the expected response will be the result of the lottery draw.
Illustrated diagrammatically in
The first part of the game management method which will be described relates to the actual game, that is to say the act of posing a question and the manner of answering it anonymously.
During the first step 50, a question is sent by the game management center to all the remote game terminals to which it is linked. As was seen above, this question may be posed during a televised game (for example in the form of a message appearing overlaid on the screen) or else on an Internet site. The actual manner in which the question is posed does not form the subject of the present invention and will not be described further below.
In practice, the question posed is transmitted from the game management center to each remote game terminal in the form of a message MQ which is sent preferably via the monodirectional communication path 31 (
The message MQ whose content is represented diagrammatically in
Optionally, the game management center can also send, in the message, authentication elements allowing the remote game terminals to verify that the question posed originates from a game management center accredited by a certification authority and has not been altered during transmission.
To do this, the message MQ preferably contains a number identifying the game management center ID_CJ, this number being different for each game management center and being allocated by a certification authority uniquely to each game management center. The certification authority also allocates each game management center a certificate which enables the identifier of the game management center ID_CJ and its public key KPUB
In the present application, use will preferably be made of a certificate established according to the ITU-T standard, Recommendation X.509/ISO/IEC 9594-8 to which reference may be made for further details.
The certificate is transmitted in the message MQ (“CERTIFICATE”—
where “∥” represents the concatenation operator and “Sign” is a known mathematical function, such as a hash function, which is such that there exists a corresponding function “Verif” satisfying:
where M1, M2 are any messages.
This makes it possible to verify that a message does indeed originate from the game management center and has not been altered during transmission thereof.
The next step 51 of the method consists, in respect of the remote game terminal 2, in verifying the authenticity of the game management center.
To do this, as was seen above, each game terminal distributed to users contains the public key of the certification authority. By virtue of this public key, the game terminal verifies the content of the CERTIFICATE and recovers the public key KPUB
In the next step 52 it is assumed that a player using the remote game terminal 2 has responded with an answer to the question contained in the message MQ and has entered it with the aid of the user interface of the game terminal. The game terminal then constructs a message MR, whose content is illustrated in
According to the principle of the invention, this message is then blinded with the aid of a secret, during step 53, so as to guarantee the anonymity of the player when he sends his answer.
To do this, according to a preferred embodiment, the remote game terminal generates a random number x. This number can for example emanate from a pseudo-random generator as is known to the person skilled in the art. This number must remain secret and may not be communicated outside of the game terminal. It will subsequently serve to prove that the player did indeed give the right answer if he wins the game.
The game terminal 2 then uses this secret random number x to create a public blinding number y, which will form the secret used to blind the response message MR. This public blinding number y must be created from the secret number x in such a way that it is impossible to retrieve x, knowing y and the function used to form y from x.
A one-way function f is therefore used to calculate y from x.
A function based on a discrete logarithm will preferably be used as function f, and is described in particular in the ISO 9796 standard, part 4 and which is defined by the following relation (3):
y=gx mod p (3)
where p and g are known values, p being a large prime number (with a minimum of 512 bits), g being a generator of Z/pZ (Z being the set of rational integers) and “mod” being the modulo function.
With the aid of this public blinding number y, the remote game terminal 2 then performs the following calculation (4) to create the blinded response message W:
W=y ⊕ MR (4)
where ⊕ represents the “exclusive OR” function (or “XOR”).
Other calculations are obviously possible for blinding the response message MR with the aid of the number y, in particular it will be possible to perform a multiplication of the two terms, modulo p.
In a second embodiment of the invention, the blinding of the message MR is performed by enciphering with the aid of a symmetric secret key Ky generated by the remote game terminal, preferably according to the DES standard (Data Encryption Standard).
During the next step 54, the remote game terminal 2 sends the blinded response message W to the game management center.
In accordance with the aim of the invention, the player's response is made secure and anonymous since it is impossible, without knowing y or Ky, to retrieve the player's response from the message W alone.
Nevertheless, it is possible in a variant embodiment to add an additional level of security by sending the message W in a form enciphered with the aid of the public key of the game management center KPUB
The game management center receives the message W at an instant TW. During the next step 55 it verifies that this instant TW is indeed prior to that TB of the broadcasting of the response to the question posed during step 50. This makes it possible to guarantee that the player has not cheated and has not sent his answer after the right answer was broadcast by the organizer of the game.
The game management center then sends the game terminal, during step 56, an acknowledgement of receipt R guaranteeing to the player that his blinded response has indeed been registered by the organizer of the game. The acknowledgement of receipt is, according to a preferred embodiment, calculated as follows:
that is to say by calculating the digital signature, with the aid of the private key KPRI
Finally, the first part of the game management method terminates with the broadcasting of the right answer by the game management center, at the instant TD (step 57). Preferably, the broadcasting of the answer is performed via the monodirectional network 31 (
Among the steps just described, it is obvious that steps 51 to 56 may be performed for each remote game terminal to which the management center is linked.
The second part of the game management method relates to the case where a player has given the right answer to the question posed and claims his prize. It is assumed that the second part begins when the player has verified that the answer broadcast in step 57 corresponded to the answer which he gave during step 52 and that he has issued an instruction, by virtue of the user interface of the game terminal 2, to claim his prize from the organizer of the game.
The game terminal 2 must then prove to the game management center that the layer did indeed give the right answer when he played (in steps 52 to 54). It must also prove that it knows the secret which served to blind the response. This makes it possible to guarantee that only the authentic winner can receive a prize.
To do this, the game terminal 2 will use the acknowledgement of receipt R which was sent by the game management center in step 56 as proof of the registering of the player's answer with the game organizer.
During a first step 58, the remote game terminal 2 firstly verifies the validity of the acknowledgement of receipt R with the aid of the public key KPUB
When the verification is positive, thereby proving that the acknowledgement of receipt R has not been altered by a third party, the game terminal sends (step 59) the game management center a message MP proving that the player had given the right answer and that the latter did indeed emanate from him.
When the response message MR has been blinded in step 53 according to the first, preferred, embodiment of the invention, the message MP contains the acknowledgement of receipt R as well as the number y which served to blind the message MR so as to form the message W. The acknowledgement of receipt makes it possible to prove that the game terminal had indeed sent the blinded response W in step 54.
To prove that the blinded response message W did indeed emanate from the remote game terminal 2, it is also necessary to prove that the latter knew the secret number x which served to calculate y. Still in this first embodiment, according to a first variant, the message MP therefore moreover contains the secret random number x.
In a second variant of the first embodiment, the message MP contains the acknowledgement of receipt R and the public blinding number y but it does not contain the secret number x. In this preferred variant embodiment, a zero-knowledge protocol is used to prove to the game management center that the remote game terminal 2 knew the secret number x without directly revealing this number x.
When the one-way function defined by relation (3) hereinabove has been used to calculate y from x, the Schnorr authentication protocol will preferably be used to prove the knowledge of x without transmitting x directly. This protocol runs as follows:
1. The remote game terminal 2 generates a random number r1 from which it calculates a number z1 according to relation (6) hereinbelow and it sends this number z1 in the message MP;
z1=gr
2. The game management center sends a binary number b1 (equal to 0 or 1) to the game terminal 2 in response;
3. The game terminal 2 calculates the value u1 according to relation (7) hereinbelow and sends it to the game management center;
u1=r1−b1×x (7)
4. The game management center verifies that relation (8) hereinbelow is true:
gu
These steps 1. to 4. must be repeated several times with different numbers rj, zj, bj and uj so as to convince the game management center that the game terminal 2 knows x.
When the response message MR has been blinded in step 53 according to the second embodiment of the invention, the message MP sent in step 59 contains the acknowledgement of receipt R as well as the secret key Ky. The acknowledgement of receipt makes it possible to prove that the game terminal did indeed send the blinded response W in step 54 and the key Ky makes it possible to prove that the terminal knows the secret which served to blind the response message.
Advantageously, so as to further improve the security of the exchanges, all the messages exchanged between the game management center and the remote game terminal 2 are enciphered. Thus, the message MP sent in the first variant of the first embodiment (or in the second embodiment) is transmitted in a form enciphered with the aid of the public key KPUB
In step 60, the game management center verifies the authenticity of the winner, that is to say it verifies, on sight of the message MP alone in the first variant of the first embodiment (or in the second embodiment), or else on sight of the messages exchanged according to the Schnorr authentication protocol in the second variant of the first embodiment, that the player's response was the right answer and that it did indeed emanate from him.
In the case where the verification is positive, a prize win certificate is sent to the remote game terminal 2 in step 61 so as to enable the player to receive his prize on presentation of this certificate.
Any appropriate means may be implemented for dispatching the prize to the winner.
Number | Date | Country | Kind |
---|---|---|---|
99 15950 | Dec 1999 | FR | national |
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/FR00/03382 | 12/5/2000 | WO | 00 | 6/17/2002 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO01/45025 | 6/21/2001 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
4218582 | Hellman et al. | Aug 1980 | A |
4572509 | Sitrick | Feb 1986 | A |
5007649 | Richardson | Apr 1991 | A |
5179517 | Sarbin et al. | Jan 1993 | A |
5470079 | LeStrange et al. | Nov 1995 | A |
5497479 | Hornbuckle | Mar 1996 | A |
5547202 | Tsumura | Aug 1996 | A |
5577735 | Reed et al. | Nov 1996 | A |
5599231 | Hibino et al. | Feb 1997 | A |
5643086 | Alcorn et al. | Jul 1997 | A |
5664778 | Kikuchi et al. | Sep 1997 | A |
5695400 | Fennell et al. | Dec 1997 | A |
5768382 | Schneier et al. | Jun 1998 | A |
5850447 | Peyret | Dec 1998 | A |
5970143 | Schneier et al. | Oct 1999 | A |
6001016 | Walker et al. | Dec 1999 | A |
6030288 | Davis et al. | Feb 2000 | A |
6099408 | Schneier et al. | Aug 2000 | A |
6106396 | Alcorn et al. | Aug 2000 | A |
6149522 | Alcorn et al. | Nov 2000 | A |
6264557 | Schneier et al. | Jul 2001 | B1 |
6280325 | Fisk | Aug 2001 | B1 |
6368219 | Szrek et al. | Apr 2002 | B1 |
6595855 | Sako | Jul 2003 | B2 |
6805634 | Wells et al. | Oct 2004 | B1 |
Number | Date | Country |
---|---|---|
552 822 | Jul 1993 | EP |
9719537 | May 1997 | WO |
9840140 | Sep 1998 | WO |
Number | Date | Country | |
---|---|---|---|
20030054886 A1 | Mar 2003 | US |