WO2012100661A1

WO2012100661A1 - Method for electronic blind card verification

Info

Publication number: WO2012100661A1
Application number: PCT/CN2012/000128
Authority: WO
Inventors: 郭君艳
Original assignee: Guo Junyan
Priority date: 2011-01-24
Filing date: 2012-01-29
Publication date: 2012-08-02
Also published as: CN102143167B; CN102143167A

Abstract

A method for electronic blind card verification comprises the following steps： (1)one or more client terminals receive a request message for dealing cards from users, and send the request message to a server;(2)the server receives the request message, and generates random shuffling cards according to the request message;(3)the server generates a password for every card, and saves it in a password book;(4)the server splits the password into password segments according to the number of the client terminals;(5)the server sends the cards with password segments and the password book to every client terminal;(6)the client terminals receive the cards with password segments and the password book;(7)the client terminals select cards and control them;(8)once the client terminals have finished the selecting and controlling of the cards, they display the card values to users and combine the password segments. The card values corresponding to the password combined from the password segments are compared with the original card values corresponding to the same password in the password book. The verification succeeds if the card values are the same, otherwise, the verification fails.

Description

Electronic dark card verification method

The present invention relates to an electronic dark card system, and more particularly to an electronic dark card verification method. Background technique

"Dark card", as the name implies, is the card facing down, and the card can be known after the user makes a selection. For example, "grabbing", board games, etc., are all familiar systems.

In recent years, with the rapid development of computer technology and Internet technology, more and more dark card systems have been developed into electronic system platforms and widely spread on the Internet.

The widespread use of such electronic dark card systems has greatly improved the processing speed and randomness of the system; on the other hand, it has also led more and more users to question the true randomness of the system. Because in theory, the system randomly sends "dark cards" to the user interface, waiting for the user to choose; but in practice, before the user opens the "dark card", there is no way to know the true card value of the cards for their choice. Therefore, it is impossible to know whether the cards for their choice are truly random cards, and perhaps these cards have been pre-set by the system to a specific card value. Therefore, how to verify the randomness of the system's dark cards, thereby ensuring the true randomness of the system's licensing and avoiding system cheating has become an urgent problem. Summary of the invention

Accordingly, it is an object of the present invention to provide a method of verifying an electronic dark card in an electronic dark card system. By using this method, the randomness of the system's dark cards can be verified, thereby ensuring the true randomness of the system's licensing and avoiding system cheating; at the same time, the user obtains a good user by verifying the authenticity of the card selected by himself. Experience and thus willing to continue to trust and use the system.

According to an aspect of the present invention, an electronic dark card verification method is provided, comprising the steps of:

(1) one or more clients receive a card request message from the user and send the card request message to the server; (2) the server receives the card request message from the client, according to the The card request message generates a randomly scrambled card; (3) the server generates a password for each card, and saves the password to the password book; (4) the server is according to the client The number divides the card's password into a password segment; (5) the server sends the card carrying the password segment and the codebook to each of the clients; (6) the client from Receiving, by the server, the card carrying the cipher segment and the codebook; (7) selecting the card by the client and manipulating the selected card; (8) if the client has completed the card selection and is selected Controlling the card, displaying the card value to the user and splicing the code segment, and comparing the card value corresponding to the password formed by the combination of the password segments with the original card value corresponding to the same password in the password book, If the card values are the same, the verification is successful, otherwise the verification fails.

Preferably, the server and the client are located on the same device or on different devices.

Preferably, the client is a browser.

Preferably, the codebook adopts one or several of the following file formats: a text file, an email or a short message.

Preferably, the password is selected from one or more of a number, a letter, a picture, a special symbol, a formula or an inequality.

Preferably, the step of the server splitting the password of the card into the password segment according to the number of the clients further comprises: performing password splitting according to the number of the clients according to a random ratio, the ratio is between 30 Between % and 70%, including end values.

Advantageously, said server transmits a card carrying said cryptogram and said codebook to each of said clients, wherein: said card of said card carrying said cryptographic segment transmitted to said respective said client The values are the same and the cipher fragments are different. DRAWINGS

The invention will be further described, by way of example only, with reference to the accompanying drawings,

1A-1C are schematic diagrams showing configurations of a plurality of exemplary electronic hash systems; and Fig. 2 is a flow chart illustrating electronic dark card verification in accordance with one embodiment of the present invention;

Figure 3A is a schematic diagram illustrating a Parker card in accordance with one embodiment of the present invention; Figure 3B is a schematic diagram illustrating the codebook of the Parker card of Figure 3A, in accordance with one embodiment of the present invention;

FIG. 4A- ⁴ E on the display device is a sample screen provided on the device in accordance with a Embodiments of the present invention perform verification of Parker's cards. detailed description

In the following description, for the purposes of illustration However, it is apparent to those skilled in the art that the present invention may be carried out in other equivalent or alternative manners without departing from the spirit and scope of the invention.

Referring to Figures 1A through 1C, schematic views of the configuration of a plurality of exemplary electronic dark card systems are shown. In Fig. 1A, an example configuration is shown in which the electronic hash system 10a includes a single device 20. Device 20 includes a display 22 in which cards are displayed to the user along with other outputs. Display 22 can also include a touch screen adapted to receive input from a user. An image of the control button (not shown) can be displayed on the touch screen, and a button pressed by the user through the touch screen can be detected. Alternatively, device 20 may provide the user with a physical control key. It will be understood that device 20 will also include other components not shown in the figures. For example, include a card reader.

In FIG. 1B, another example configuration is shown in which system 10b includes a plurality of devices 20 (e.g., device 20 in FIG. 1A) within network 30. In this example configuration, each device 20 is connected to a central server 32 in network 30 that controls the dark card system provided to device 20.

In one embodiment, device 20 and central server 32 communicate with one another in a known manner to provide a hidden card system for user manipulation. For example, central server 32 can communicate data generated by it representing the status or results of the processing phase to device 20. This data is processed by the client application executing on device 20 to display the appropriate output from the hidden system to the user.

Devices 20 in a dark card system (e.g., system 10b) may be located at the same physical location. Alternatively, devices 20 in a dark card system may be distributed across multiple physical locations.

Figure 1C illustrates yet another example configuration in which the hidden card system 10c packages a plurality of sub-networks 34, wherein each sub-network 34 can be established at a different physical location. Subnetworks 34 are connected together by network 30.

With regard to the example configurations illustrated in Figures IB and 1C, in one embodiment, devices 20 in the hidden card system 10b and/or the hidden card system 10c may constitute a wide area network, where 20 is a personal computer connected together via the Internet, a corporate intranet or other network, and is monitored by the central server 32. For example, the personal computer can be a desktop computer, a laptop computer, or some other computing device. The user can download the client application system to the personal computer from the website of an electronic dark card system operator via the Internet, or copy the client application system from the compact disk or other medium to the personal computer, and execute the client application system for corresponding processing. Alternatively, the user can connect to the central server 32 for processing directly through the browser without executing the client application system. The user's input can be received by a mouse or other input device connected to the personal computer in a known manner.

It will be appreciated that the apparatus 20 on which the method of the electronic hash system can be implemented is not limited to video terminals and computing devices, but may also include, for example, other electromechanical machines, interactive televisions, wireless mobile devices, and any other including display and processing devices. A communication device or processing device, wherein the processing device is adapted to perform the steps of providing an electronic dark card system in accordance with an embodiment of the method of the present invention. Those of ordinary skill in the art will be able to implement these methods on any standard microprocessor based machine or device with appropriate changes or modifications.

The configurations shown in Figures 1A through 1C are provided by way of example only, and in various variant implementations may be other configured devices 20. It will be appreciated that the functionality of the central server 32 may also be provided, for example, by one or more devices 20, but not as a separate device.

Referring to Figure 2, a flow diagram of electronic dark card verification in accordance with one embodiment of the present invention is shown. In step 42, the user enters a deal request message on a respective client, such as device 20-1, requesting the card system 10a, 10b or 10c to deal. In step 44, the client receives the card request message and sends the message to a server, such as central server 32, requesting the server to provide the service. In step 46, the server receives a deal request message, and generates a randomly scrambled card based on the request message. In step 48, the server generates a unique password for each card, and the generated password can be, for example, a number, letter, picture, special symbol, formula, inequality, or any combination of the above, and save the password to the password. The password book can be, for example, a text file, an email or a short message, or any combination of the above. In step 50, the server splits the password into password segments. When splitting, the server can split according to the number of users requested, for example, with 3 users, then the ratio can be: 30%, 30 % and 40%, 10%, 20% and 70%, 0%, 10% and 90% or any other suitable ratio between 0% and 100%. Preferably, the split ratio is between 30% and 70%, inclusive. In step 52, the server sends the card carrying the cipher segment and the code book to the client. The cipher fragments carried may be the same or different. Preferably, the cryptographic fragments carried are different. In addition, when the codebook is sent to the client, it can be sent simultaneously with the card carrying the cryptogram, so that the user can see both the card and the codebook at the same time. Alternatively, the codebook can be sent to the client as an encrypted package. After the client completes the card selection and the manipulation of the card, the server sends a key to the client for decrypting the encrypted package containing the password book, so that the user Delayed to see the password book. In step 54, the client receives the card carrying the cryptogram and the codebook. In step 56, the client selects the card and manipulates the selected card, the client can select one or more cards in turn according to the need, and then manipulate the selected card; or first select a portion of the cards in turn and control the selected card. Then take turns to select the cards and then control the selected cards. In step 58, a determination is made as to whether the client has completed the card selection and manipulation, and if so, proceeds to step 60, otherwise returns to step 56 to continue the card selection and manipulate the selected card. In step 60, the client displays the card value to the user and stitches together the cipher segments corresponding to the same card value of each client. In step 62, the client compares the card value corresponding to the password formed by the combination of the cipher segments from the respective clients with the original card value corresponding to the same cipher in the cipher book. In step 64, it is determined whether the card values are the same. If they are the same, then the process proceeds to step 66, and the success indicates that the system is completely randomly licensed, and there is no cheating; otherwise, the verification fails, indicating that the system does not randomly issue cards, and there is cheating behavior.

In the following, the invention will be explained in further detail in connection with specific embodiments. In order to more clearly describe the present invention, those skilled in the art will fully understand the technical realization process of the present invention, and will be discussed by taking the Parker card which is well known to the public as an example. However, these examples are for illustrative purposes only and are not intended to limit the scope of the invention.

Referring to Figure 3A, Figure 3A illustrates a schematic representation of a hack card in accordance with one embodiment of the present invention. Among them, a total of 22 Parker cards are shown, including: cards with values of 10, J, Q, K, and A. The colors are spades, hearts, plums, and squares, as well as the kings and kings without colors. Next, the 22 cards or parts thereof will be used as an example to describe the technical implementation process of detailed dark card verification.

Definition card

Here, for the sake of simplicity, a card is represented by a 2-digit hexadecimal number. The basic representation is: 0x00, as shown in Table 1: Ox 0 0

Hexadecimal indicator High level Low Table 1 Here, the card value is defined as 2 minimum, A is the largest, the color is the smallest, and the spade is the largest. The arrangement is as follows:

The high position indicates the card value, and the data is arranged in order from small to large:

High value 1: indicates the card value 2;

High value 2: indicates the card value 3;

High value 3: indicates the card value 4;

High value 4: indicates the card value 5;

High value 5: indicates the card value 6;

High value 6: indicates the value of the card 7;

High value 7: indicates the card value 8;

High value 8: indicates the card value 9;

High value 9: indicates the value of the card 10;

High value a: indicates the card value J;

High value b: indicates the card value Q;

High value c: indicates the card value K;

High value d: indicates the card value. The low position indicates the suit color of the card. The data is arranged from small to large in order of color:

Low value 1: indicates a square;

Low value 2: indicates plum blossom;

Low value 3: indicates the red heart;

Low value 4: indicates spades. Xiao Wang Da Wang has no suit color, the high position is e and f, and the low position is 0. The definition and arrangement of the above-mentioned card values and suits are only for the examples, and those skilled in the art Any other suitable means of defining cards suitable for computer processing are possible, such as: index representations, double index representations, object representations, and the like. According to the definition of the above card, the 22 cards in Fig. 3A are defined as the format shown in Table 2:

Table 2

2. Define a password book

The codebook is a comparison table between the card value and the password. Each card has a corresponding password, and all the passwords are stored in the code book.

Referring to Figure 3B, Figure 3B is a schematic diagram illustrating the codebook of the Parker card of Figure 3A, in accordance with one embodiment of the present invention. Each of the 22 Parker cards shown has a password in digital form.

The codebook can be generated in one or several formats, such as text files, emails, or short messages. Of course, any other suitable format suitable for computer processing ciphers known to those skilled in the art is possible.

3. Randomized cards

According to the card definition, the hexadecimal values corresponding to the cards are placed in an array. The hexadecimal value is 9-f, and the corresponding decimal value is 9-15. When traversing, starting from the number 9 and ending at 13, the values are shifted to the left by four bits to get the high value, that is, 9. 10, J, Q, K and Α these cards (brand value), while writing 1-4 in the low position, that is, get the square, plum, red Heart and spades these colors. Each time you traverse, you get 4 values. Finally, the hexadecimal values corresponding to Xiao Wang and Da Wang are also placed in the array, which is an array like this:

0x91, 0x92, 0x93, 0x94,

Oxal, 0xa2, 0xa3, 0xa4,

Oxbl, 0xb2, 0xb3, 0xb4,

Oxcl, 0xc2, 0xc3, 0xc4,

Oxdl, 0xd2, 0xd3, 0xd4,

OxeO, Oxf 0. Then, loop through the array, each step of the loop first generates a random integer of the length of the array, such as 17, and exchanges the value of the current index of the array with the value of index 17, so that 22 will be generated for this array after the traversal is completed. Secondary position swapping to achieve the purpose of scrambling arrays. Of course, there are many methods for randomizing cards, and any other suitable method for computer-processed randomized cards known to those skilled in the art is possible, such as random extraction, disordered cards, and anti-arrangement. Sequential cards, etc., are briefly described below for the manner in which the two randomized cards are described for the purpose of illustration and are not intended to limit the scope of the invention. Random extraction method for disorderly cards:

Assume that the original array is a and the length is 22; create a new array of b with a length of 0.

When the length of the array a is greater than 0, the loop is entered. Each loop generates a random index. The random index is greater than or equal to 0 and smaller than the length of the array a. The value of the corresponding position is taken from the array a and placed into the array b, and the array is taken from the array. Delete the index in a. The length of the a array is reduced by one cycle, and the length of the b array is increased. After 22 cycles, the length of the a array is 0, and the length of the b array is 22. Since each time is a randomly fetched value, the number of scrambled 22s can be obtained in the array b, thereby realizing the randomization of the cards. Anti-arrangement of cards:

Use two loops to exchange or not swap values in the array to achieve the purpose of scrambling the order.

Enter the second-level loop in the first-level loop. The start value of the first-order loop is 0, and the end value is an array. The length is decremented by 1. The starting value of the secondary loop is the current value of the primary loop plus one, and the ending value is the length of the array minus 2.

Generate a random value of 1 or 0, which is treated as true or false. If this value is true, the current value of the first-order loop in the array and the current value of the second-order loop are exchanged. The loop process will cause the value of each position to be any The value of a position is exchanged to randomize the cards.

4. Generate a password for each card

For example, when the password is in numeric form, you can randomly take a base value, such as: 90, from the base value, loop 22 times, add a value each time, and put them into an array, which will get the following values: 90 , 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113.

The password can also be in the form of characters, such as randomly selecting 22 of the 26 English letters. Alternatively, the password may be in the form of a picture, such as vegetables, fruits, and the like. Alternatively, the password can be a special symbol, formula or inequality. Alternatively, the password can be any combination of the above mentioned forms. The form of the password is varied and any other suitable form of password suitable for computer processing known to those skilled in the art may be employed herein.

5. Split password

When the card is sent to the user, the password of the card is first split according to the number of users, so that each user can only get one password segment of the password, and when all the password segments obtained by the user are combined, You can get the full password. The password will be split according to the number of users in a random ratio, and any suitable ratio from 0% to 100% can be selected. Preferably, the random ratio is between 30% and 70%, inclusive.

For example, the existing two users have obtained the card red heart Q, the password is the number 108, and the random ratio is 0.42. By calculating 108*0.42, the password split value is 45.36, which is rounded to 45, which is the password fragment of user A, and the password fragment of user B is 108-45, that is, 63. When the password is not a number, but a letter, a picture, a special symbol, a formula or an inequality, or any combination of numbers, letters, pictures, special symbols, formulas or inequalities, a similar split can be made as described above. Of course, any other suitable cryptographic splitting method suitable for computer processing that is well known to those skilled in the art can be employed. Next, referring to Figures 4A-4E, an exemplary screen shot of a display of a device is shown on which a verification of a Parker's card is provided in accordance with an embodiment of the present invention.

Fig. 4A shows a codebook containing three cards, which are J, 10 and K, respectively, and corresponding passwords are 42, 69 and 56.

Figure 4B shows the card and the codebook carried by the server that have been randomized and carried with the cipher segment after the three users have issued a card request message to the server through their respective clients. Figure 4B-a, Figure 4B-b, and Figure 4B-C show the card selection interface seen by User A, User B, and User C, respectively. The three cards that the user A sees carry the cipher segments 17, 21 and 11 in sequence; the three cards that the user B sees carry the cipher segments 16, 15 and 23 in sequence; the three cards that the user C sees are carried in turn. There are password segments 09, 33 and 22. User A, User B, and User C see the same password: J, 10, and K, and the corresponding passwords are 42, 69, and 56.

Figure 4C shows the corresponding interface seen after User A, User B, and User C have selected the cards in turn.

4C-al, FIG. 4C-a2 and FIG. 4C-a3 respectively show the selections seen by the user A, the user B, and the user C after the user A selects the first card, that is, the card carrying the cipher segment 17. Card interface. That is, there are two cards remaining on the selection interface, and the two cards seen by the user A carry the password segments 21 and 11 in turn; the two cards seen by the user B carry the password segments 15 and 23 in sequence; the user C sees The two cards carry the cipher segments 33 and 22 in sequence. User A, User B, and User C see the same password: J, 10, and K, and the corresponding passwords are 42, 69, and 56.

4C-bl, FIG. 4C-b2 and FIG. 4C-b3 respectively show the selections seen by the user A, the user B, and the user C after the user B selects the third card, that is, the card carrying the cipher segment 23. Card interface. That is, there is one card left on the card selection interface, and the card that the user A sees carries the password segment 21; the card that the user B sees carries the password segment 15; the card that the user C sees carries the password. Fragment 33. User A, User B, and User C see the same password: J, 10, and K, and the corresponding passwords are 42, 69, and 56.

4C-c shows the card selection interface that the user A, the user B, and the user C see after the user C selects the middle card, that is, the last card, that is, all the cards have been selected, and the interface is air.

FIG. 4D shows the interface of the card back that is seen to be stitched together by the user A, the user B, and the user C after the card is manipulated. As shown in Figure 4D, the back of the first card contains three cipher segments: 17, 16, and 09, and the combined cipher is 42; the back of the second card contains three cipher segments: 21, 15 and 33, the combined password is 69; and the third card The back of the card contains three cryptographic segments: 11, 23, and 22, and the combined password is 56.

Fig. 4E shows the interface of the card corresponding to the password obtained by the combination of the password segments seen by the user A, the user B, and the user C. As shown in Fig. 4E, the first card has three cipher segments 17, 16, and 09, the combined cipher is 42 and the corresponding card value is J; the second card has three cipher segments 21, 15 and 33, the combined password is 69, the corresponding card value is 10; and the third card has three password segments 11, 23 and 22, the combined password is 56, and the corresponding card value is K.

When comparing the above card value with the original card value corresponding to the same password in the code book, it can be obtained that the same card has the same card value, so the verification is successful, the system randomizes the card, and there is no cheating. However, if the same password has different card values, for example, the combined password is 69, and the corresponding card value is Q, the verification fails, indicating that the system has cheating behavior.

Although only the dark card verification process of three cards is described in the above embodiment, the number of dark cards may be any suitable integer value such as 1, 2, 3, 4, 5, 10, 22, 30, 52. The type of the dark card may not be limited to Parker, but may be any form of article as long as it is face down when selected and can know its true value after undergoing selection.

Although the present invention has been described in connection with the preferred embodiments and the specific embodiments, it is not intended to . There may be many variations to the invention described herein, and such variations are not to be construed as a departure from the spirit and scope of the invention. All such changes and modifications that are obvious to those skilled in the art are intended to be included within the scope of the appended claims.

Claims

Claim

1. An electronic dark card verification method, comprising the steps of:

(1) One or more clients receive a card request message from the user and send the card request message to the server;

(2) the server receives the card request message from the client, and generates a randomly scrambled card according to the card request message;

(3) the server generates a password for each card, and saves the password to the password book;

(4) The server splits the password of the card into a password segment according to the number of the clients;

(5) The server transmits the card carrying the ciphertext and the codebook to each of the clients;

(6) the client receives the card carrying the cipher segment and the code book from the server;

(7) the client selects a card and controls the selected card;

(8) If the client has completed the card selection and the manipulation of the selected card, the card value is displayed to the user and the password segment is flattened, and the card corresponding to the password segment is combined. The value is compared with the original card value corresponding to the same password in the code book. If the card value is the same, the verification is successful, otherwise the verification fails.

2. The electronic card verification method according to claim 1, wherein: the server and the client are located on the same device or on different devices.

The electronic card authenticator according to claim 2, wherein the client is a browser.

4. The electronic card verification method according to claim 3, wherein the codebook adopts one or more of the following file formats: a text file, an email, or a short message.

The electronic card verification method according to any one of claims 1 to 4, wherein the password is selected from a number, a letter, a picture, a special symbol, a formula or an inequality. One or more.

The electronic card verification method according to claim 5, wherein the step of splitting the password of the card into a password segment according to the number of the clients, further comprising: according to the client The number of machines is cryptographically split at a random ratio, which is between 30% and 70°/. Between, including the end value.

The electronic card verification method according to claim 5, wherein the server transmits the card carrying the password segment and the codebook to each of the clients, where: The card of the client carrying the cipher segment has the same card value, and the cipher segments are different.