Information publishing system and method

By splitting the key decryption information into multiple shares and storing them based on terminal identifiers and random number index values, the security problem of transmitting key decryption information in open channels is solved, achieving higher information transmission security and decryption operation security.

CN112597522BActive Publication Date: 2024-11-12MAXIO TECHNOLOGY (HANGZHOU) CO LTD
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202011605896.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-12-30
Publication Date
2024-11-12
Estimated Expiration
2040-12-30

AI Technical Summary

Technical Problem

In one-to-many communication, the key information for decryption is transmitted through an open channel, which makes it difficult to guarantee its security, and attackers can obtain the key information for decryption.

Method used

The key information for decryption is split into multiple shares, and the index value of each share is calculated based on the terminal identifier and a random number. These shares are stored in a decryption information table. The terminal reads the key information from the table using the index value to decrypt the information, and verification data is used to ensure the integrity of the information.

Benefits of technology

It improves the security of decrypted key information, prevents attackers from obtaining the decrypted key information, and enhances the security of information transmission.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112597522B_ABST
    Figure CN112597522B_ABST
Patent Text Reader

Abstract

Provided is an information publishing system and method, the system includes a central server and multiple terminals, the central server constructs multiple decryption key information, wherein each decryption key information corresponds to one of the multiple terminals; each decryption key information is split into multiple shares, and the serial number of each share is determined; the index value of each share is calculated based on the terminal identification and the random number to determine the specified row, the specified column is determined according to the serial number of each share, and each share is stored in the specified row and specified column in the decryption information table; the decryption information table and the random number are sent to each terminal; each terminal calculates the index value of each share according to its own terminal identification and the random number generated by the central server, determines the serial number of each share, and then reads each share from the specified row and specified column in the decryption information table according to the index value and serial number of each share, so as to obtain its own decryption key information and decrypt the encrypted resources. The system can improve the security of decryption key information.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of network communication technology, and more specifically, to an information publishing system and method. Background Art

[0002] With the rapid development of network technology, more and more important information has been transmitted on the Internet, and people are paying more and more attention to the security of information transmission. According to the different transmission objects, Internet communication can be divided into three situations: one-to-one, one-to-many, and many-to-many. Different types of Internet communication achieve the security of information transmission based on different methods.

[0003] In one-to-many (1:n) communication, the central server generates decryption key information and provides it to each terminal. Each terminal decrypts the encrypted resources based on the decryption key information. The resources here can be software release packages, audio and video files, internal confidential information, etc. Figure 1 It is a schematic diagram of a one-to-many (1:n) information publishing system. As shown in the figure, the information publishing system 10 includes a central server 11 and multiple terminals U1 to Un connected to the central server 11 through the Internet. The central server 11 publishes information to multiple terminals U1 to Un, thereby realizing one-to-many (1:n) communication. Before establishing a secure channel for transmitting sensitive information, all terminals U1 to Un send terminal identifiers Id1 to Idn to the central server 11 through an open channel. After receiving the terminal identifiers Id1 to Idn, the central server 11 generates decryption key information A1 to An such as a symmetric key and a verification code, and sends the decryption key information A1 to An to the terminals U1 to Un through the open channel. At this point, secure communication is established between the central server 11 and the terminals U1 to Un. The central receiver 11 can encrypt resources with decryption key information, and send the encrypted resources M1 to Mn to the terminals U1 to Un respectively. The terminals U1 to Un decrypt according to their respective decryption key information A1 to An.

[0004] However, in this process, the decryption key information is transmitted through an open channel, and attackers can obtain the decryption key information by attacking the network transmission. Therefore, the security of the decryption key information is difficult to guarantee. Summary of the invention

[0005] In view of this, the present invention provides an information publishing system and method to improve the transmission security of decryption key information.

[0006] According to a first aspect of the present invention, there is provided an information publishing system, the system comprising a central server and a plurality of terminals, wherein the central server performs the following steps:

[0007] Constructing a plurality of decryption key information, wherein each of the decryption key information corresponds to a terminal among the plurality of terminals;

[0008] Splitting the decryption key information of each terminal into 1st to Nth shares, and determining the serial number of each share, where N is an integer greater than or equal to 2;

[0009] For the 1st to Nth shares of the decryption key information of each terminal, an index value of each share is calculated based on the terminal identifier and the random number, and each share is stored in a designated row and a designated column in the decryption information table, wherein the designated row is determined by the index value of each share, and the designated column is determined by the sequence number of each share;

[0010] Sending the decryption information table and the random number to a corresponding terminal;

[0011] Each of the plurality of terminals performs the following steps:

[0012] Calculate the index value of each share according to its own terminal identification and the random number generated by the central server, and determine the sequence number of each share;

[0013] Read each share from a designated row and designated column in a decryption information table to obtain its own decryption key information, and decrypt the encrypted resource based on its own decryption key information, wherein the designated row is determined by the index value of each share, and the designated column is determined by the serial number of each share.

[0014] Optionally, for the first to Nth shares of the decryption key information of each terminal, calculating the index value of each share based on the terminal identifier and the random number includes:

[0015] Generate a first random number, and calculate an index value of a first share according to the terminal identifier and the first random number;

[0016] For the index value of the Kth share among the 2nd to Nth shares, a specific operation is performed using the (K-1)th random number and the (K-1)th share to obtain the Kth random number, and the Kth random number and the terminal identifier are used to calculate the index value of the Kth share, where K is greater than or equal to 2 and K is less than or equal to N.

[0017] Optionally, each terminal further performs the following steps: sending its own terminal identification to the central server via a secure channel.

[0018] Optionally, the central server further performs the following steps: encrypting the resources to be sent based on the decryption key information of each terminal, obtaining the encrypted resources and sending the encrypted resources to each terminal.

[0019] Optionally, the central server further performs the following steps:

[0020] Generate verification data for decryption key information of each terminal;

[0021] storing each verification data in a corresponding row in the decryption information table, the corresponding row being determined by the index value of the Nth share of the decryption key information corresponding to the verification data;

[0022] Each terminal also performs the following steps:

[0023] Reading verification data from the decryption information table;

[0024] Verify the decryption key information based on the verification data.

[0025] Optionally, the central server further performs the following operations:

[0026] The unoccupied storage space in the decryption information table is filled with a random value. In the decryption information table, a plurality of storage spaces of set sizes are allocated to a plurality of decryption key information. The storage space of the set size is larger than the storage space actually required for each decryption key information.

[0027] Optionally, calculating the index value of each share based on the terminal identifier and the random number includes:

[0028] When the calculated index value of the specific share is the same as any previously calculated index value, a new random number is repeatedly obtained, and a new index value is calculated based on the new random number and the terminal identifier until the new index value is different from any previously calculated index value.

[0029] Optionally, calculating the index value of each share based on the terminal identifier and the random number includes:

[0030] For each share, two index values ​​are calculated;

[0031] If one of the index values ​​is not occupied, the unoccupied index value is used as the index value of the share;

[0032] If both index values ​​are occupied, then for the first other share occupying one of the index values, determine whether the other index value is occupied; if not, move the first other share to the specified row of the other index value of the first other share; if yes, then for the second other share occupying the other index value of the first other share, perform the operation of determining whether the other index value is occupied until the index value of one of the two index values ​​is not occupied.

[0033] Optionally, the two index values ​​include a primary index value and a backup index value, and if one of the index values ​​is not occupied, using the unoccupied index value as the index value of the share includes:

[0034] If the primary index value is not occupied, use the primary index value as the index value of the share;

[0035] In the case where the primary index value is occupied, the backup index value is used as the index value of the share.

[0036] Optionally, the specific operation is an XOR operation, and the index value of the Kth share is calculated based on a hash algorithm using the Kth random number and the terminal identifier.

[0037] According to a second aspect of the present invention, there is provided an information publishing method, the method being applied to a central server and a plurality of terminals, wherein the central server performs the following steps:

[0038] Constructing a plurality of decryption key information, wherein each of the decryption key information corresponds to a terminal among the plurality of terminals;

[0039] Splitting the decryption key information of each terminal into 1st to Nth shares, and determining the serial number of each share, where N is an integer greater than or equal to 2;

[0040] For the 1st to Nth shares of the decryption key information of each terminal, an index value of each share is calculated based on the terminal identifier and the random number, and each share is stored in a designated row and a designated column in the decryption information table, wherein the designated row is determined by the index value of each share, and the designated column is determined by the sequence number of each share;

[0041] Sending the decryption information table and the random number to a corresponding terminal;

[0042] Each of the plurality of terminals performs the following steps:

[0043] Calculate the index value of each share according to its own terminal identification and the random number generated by the central server, and determine the sequence number of each share;

[0044] Read each share from a designated row and designated column in a decryption information table to obtain its own decryption key information, and decrypt the encrypted resource based on its own decryption key information, wherein the designated row is determined by the index value of each share, and the designated column is determined by the serial number of each share.

[0045] Optionally, for the first to Nth shares of the decryption key information of each terminal, calculating the index value of each share based on the terminal identifier and the random number includes:

[0046] Generate a first random number, and calculate an index value of a first share according to the terminal identifier and the first random number;

[0047] For the index value of the Kth share among the 2nd to Nth shares, a specific operation is performed using the (K-1)th random number and the (K-1)th share to obtain the Kth random number, and the Kth random number and the terminal identifier are used to calculate the index value of the Kth share, where K is greater than or equal to 2 and K is less than or equal to N.

[0048] Optionally, each terminal further performs the following steps: sending its own terminal identification to the central server via a secure channel.

[0049] Optionally, the central server further performs the following steps: encrypting the resources to be sent based on the decryption key information of each terminal, obtaining the encrypted resources and sending the encrypted resources to each terminal.

[0050] Optionally, the central server further performs the following steps:

[0051] Generate verification data for decryption key information of each terminal;

[0052] storing each verification data in a corresponding row in the decryption information table, the corresponding row being determined by the index value of the Nth share of the decryption key information corresponding to the verification data;

[0053] Each terminal also performs the following steps:

[0054] Reading verification data from the decryption information table;

[0055] Verify the decryption key information based on the verification data.

[0056] Optionally, the central server further performs the following operations:

[0057] The unoccupied storage space in the decryption information table is filled with a random value. In the decryption information table, a plurality of storage spaces of set sizes are allocated to a plurality of decryption key information. The storage space of the set size is larger than the storage space actually required for each decryption key information.

[0058] Optionally, calculating the index value of each share based on the terminal identifier and the random number includes:

[0059] When the calculated index value of the specific share is the same as any previously calculated index value, a new random number is repeatedly obtained, and a new index value is calculated based on the new random number and the terminal identifier until the new index value is different from any previously calculated index value.

[0060] Optionally, calculating the index value of each share based on the terminal identifier and the random number includes:

[0061] For each share, two index values ​​are calculated;

[0062] If one of the index values ​​is not occupied, the unoccupied index value is used as the index value of the share;

[0063] If both index values ​​are occupied, then for the first other share occupying one of the index values, determine whether the other index value is occupied; if not, move the first other share to the specified row of the other index value of the first other share; if yes, then for the second other share occupying the other index value of the first other share, perform the operation of determining whether the other index value is occupied until the index value of one of the two index values ​​is not occupied.

[0064] Optionally, the two index values ​​include a primary index value and a backup index value, and if one of the index values ​​is not occupied, using the unoccupied index value as the index value of the share includes:

[0065] If the primary index value is not occupied, use the primary index value as the index value of the share;

[0066] In the case where the primary index value is occupied, the backup index value is used as the index value of the share.

[0067] Optionally, the specific operation is an XOR operation, and the index value of the Kth share is calculated based on a hash algorithm using the Kth random number and the terminal identifier.

[0068] The information publishing method and system provided by the present invention are used to publish key decryption information and can provide security for the key decryption information. BRIEF DESCRIPTION OF THE DRAWINGS

[0069] The above and other objects, features and advantages of the present invention will become more apparent through the description of the embodiments of the present invention with reference to the following drawings, in which:

[0070] Figure 1 A schematic block diagram showing a one-machine to multiple-machine information publishing system;

[0071] Figure 2 A schematic block diagram of an information publishing system provided by a first embodiment of the present invention is shown;

[0072] Figure 3 An interactive schematic diagram showing an information publishing system provided by a first embodiment of the present invention;

[0073] Figure 4 is a schematic diagram of the data structure of the decryption information table used in the first embodiment of the present invention;

[0074] Figure 5 is a schematic diagram of the data structure of the decryption information table used in the second embodiment of the present invention;

[0075] Figure 6 This is an example diagram of the verification data;

[0076] Figure 7 It is an interactive schematic diagram of the software package publishing system of the first embodiment of the present invention. DETAILED DESCRIPTION

[0077] The present invention is described below based on embodiments, but the present invention is not limited to these embodiments. In the detailed description of the present invention below, some specific details are described in detail. It is possible for a person skilled in the art to fully understand the present invention without the description of these details. In order to avoid confusing the essence of the present invention, known methods, processes, and procedures are not described in detail. In addition, the drawings are not necessarily drawn to scale.

[0078] The flowcharts and block diagrams in the accompanying drawings illustrate the possible system frameworks, functions and operations of the systems, methods and devices of the embodiments of the present invention. The boxes on the flowcharts and block diagrams can represent a module, a program segment or just a piece of code, and the modules, program segments and codes are all executable instructions for implementing the specified logical functions. It should also be noted that the executable instructions for implementing the specified logical functions can be recombined to generate new modules and program segments. Therefore, the boxes and the order of the boxes in the accompanying drawings are only used to better illustrate the process and steps of the embodiments, and should not be used as a limitation on the invention itself.

[0079] This application uses the following terminology.

[0080] Open channel: Any user can send and receive information on this channel.

[0081] Brute force attack: Try all possible keys to find the correct one.

[0082] Decryption information table: published by the information publishing platform to the open channel, it stores all users' decryption key information in a dispersed manner, and is eventually accepted by the user, from which the corresponding decryption key information is extracted.

[0083] Unless otherwise defined, all the techniques and terms used herein have the same meanings as those commonly understood by those skilled in the art of the present invention. The terms used in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention.

[0084] It should be understood that the various steps in the flowchart of the present application are displayed in sequence according to the indication of the arrows, but these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless there is a clear description in this article, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least a part of the steps in the figure may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these sub-steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the sub-steps or stages of other steps.

[0085] Figure 3 The interactive diagram of the information publishing method provided by an embodiment of the present invention is shown. The information publishing method is implemented based on a computer program and can be implemented in Figure 2 The information publishing system 20 shown in FIG. Figure 3 As shown,

[0086] Step S01 is that the terminal 22 sends a terminal identification to the central server 21 through a secure channel.

[0087] Step S02 is that the central server 21 collects the terminal identifications of the multiple terminals 22. Figure 2 The terminals U1 to Un are shown in FIG. 1 , where n is greater than or equal to 2. The terminal identifiers received by the central server 21 here may be unique terminal identifiers of some of the terminals U1 to Un, but must be greater than or equal to 2.

[0088] Step S03 is that the central server 21 calculates a decryption key information corresponding to each terminal. The multiple decryption key information can be the same or different. The terminal identifications of the multiple terminals 22 can be used to generate the decryption key information, but this is not necessary.

[0089] Step S04 is that the central server 21 establishes a decryption information table, generates a random number, and stores the decryption key information calculated in the previous step into the decryption information table based on the terminal identification and the random number.

[0090] Step S05 is that the central server 21 sends the decryption information table and the random number to the terminal 22. The random number here is a random number generated and used when calculating the index value of each decryption key information in the decryption information table.

[0091] Step S06 is that the terminal 22 calculates the index value of its own decryption key information according to the random number generated by the central server and the decryption information table.

[0092] In step S07, the terminal 22 retrieves its own decryption key information from the decryption information table according to the index value.

[0093] Step S08 is that the terminal 22 decrypts the encrypted resource based on its own decryption key information. The encrypted resource can be transmitted from the central server 21 to each terminal 22, or transmitted from the central server 21 to a resource server and downloaded by each terminal 22.

[0094] In this embodiment, the decryption key information may include an activation code, a shared key, etc., and the resource to be sent may be a software release package, an audio and video playback file, an internal confidential information, etc. The central server 21 encrypts the resource to be sent based on the decryption key information of each terminal to obtain an encrypted resource. For example, the central server 21 may use a shared key to encrypt the resource to be sent, and when the terminal 22 receives the shared key, it may use the shared key to decrypt the encrypted resource. The central server 21 may also periodically send an activation code to the terminal 22, and the terminal 22 must regularly input the latest activation code for the downloaded software package in order to use it normally.

[0095] In this embodiment, step S03 uses a second-order matrix equation in a finite field to calculate the decryption key information, and the calculated decryption key information a has the following characteristics: the terminal can easily obtain the shared key k of the symmetric encryption algorithm based on the terminal identification (the unique identification of the terminal) and the decryption key information, and the shared key k of the symmetric encryption algorithm can only be obtained by brute force cracking without the terminal identification. The user can obtain the right to use the software based on the decryption key information a and the terminal identification.

[0096] The key difference from the prior art is that the prior art directly sends each decryption key information on an open channel, but in this embodiment, the terminal sends the terminal identification to the central server through a secure channel. The central server constructs a decryption information table with multiple decryption key information based on the terminal identification and the random number, and then uses the open channel to send the decryption information table and the random number. The step of constructing the decryption information table is step S04. Figure 4 and Figure 5 Describe this step in detail.

[0097] Figure 4 The data structure of the decryption information table of the first embodiment is shown. As shown in the figure, the decryption information table organizes data (including decryption key information and verification data) based on an index, and data can be retrieved through the index, but the storage order of multiple decryption key information is not fixed, that is, the index of the decryption key information of each terminal (equivalent to terminal 12) in the decryption information table is not fixed, but the index of the decryption key information of each terminal can be obtained based on its own terminal identification and random number.

[0098] In one embodiment, the terminal identification of each terminal and the random number generated by the central server are substituted into a hash algorithm to obtain the index value of the terminal's decryption key information in the decryption information table. The algorithm can be expressed as formula (1):

[0099] index=H([Vi],r) Formula (1)

[0100] Where H is the set hash function, [Vi] is the terminal identifier, and r is a random number. In other words, the decryption key information a is stored in the decryption information table A[index] with index as the address. It can be explained by rows and columns. Figure 4 In the decryption information table, the index index points out the row where the decryption key information a is stored.

[0101] In one embodiment, when the index value calculated using formula (1) is the same as the previously calculated index value, the following steps are repeated until an index value different from any previously calculated index value is obtained: a new random number is obtained, and a new index value is calculated based on the new random number and formula (1).

[0102] In one embodiment, the following method can also be used to solve the problem of the same index value calculated by formula (1). The core idea is: for each share of the same decryption key information, two index values ​​are calculated as the primary index and the backup index;

[0103] If one of the index values ​​(primary index or backup index) is not occupied, the unoccupied index value is used as the index value of the share;

[0104] If both index values ​​are occupied, for the first other share that occupies one of the index values, determine whether the other index value is occupied. If not, move the first other share to the specified row of the other index value; if yes, for the second other share that occupies the other index value of the first other share, perform the operation of determining whether the other index value is occupied, until the index value of one of the two index values ​​is not occupied. For example, for n shares A1, A2 to An of decryption key information, n is greater than or equal to 2, Ak is the kth share of decryption key information, k is greater than or equal to 1 and k is less than or equal to n. index1 Ak and index2 Ak It is the primary index and backup index calculated for Ak. Ak If it is not occupied, the primary index value index1 Ak As the index value of Ak, in the main index value index1 Ak If it is occupied, the backup index value index2 AkAs the index value of Ak. If both index values ​​are occupied, index1 Ak For example, assume that the share occupied is A(k+j1), j1 is an integer greater than 0, and (k+j1) is less than or equal to n. Then A(k+j1) must have another index (primary index or backup index). If the other index of A(k+j1) is not occupied, move A(k+j1) to the other index of A(k+j1), so that index1 is vacant. Ak Used by Ak. But if another index of A(k+j1) is also occupied, assume that the other index occupying another index of A(k+j1) is A(k+j2), j2 is an integer greater than 0 and not equal to j1, and (k+j2) is less than or equal to n. A(k+j2) also has another index, then determine whether the other index value of A(k+j2) is occupied. If the other index value of A(k+j2) is not occupied, move A(k+j2) to another index of A(k+j2), and move A(k+j1) to another index of A(k+j1), so that index1 is vacant. Ak Used by Ak. If another index value of A(k+j2) is occupied, then for the other indexes that occupy another index value of A(k+j2), the operation of determining whether the other index value of the other index is occupied is performed until index1 is vacated. Ak Used by Ak.

[0105] When obtaining the decryption key information, since two hash functions are used to generate two index values, two decryption key information will be found using these two index values. It is necessary to find the correct decryption key information by verifying the data.

[0106] Continue to refer Figure 4 As shown, from Figure 4 It can be seen that when constructing the decryption information table, verification data can also be added to each decryption key information. The verification data can be used to verify the integrity of the decryption key information. The verification data of the decryption key information of each terminal can be related to the terminal identification. Figure 4 As shown, the verification data and its corresponding decryption key information are located in the same row of the decryption information table. When the terminal takes out its own decryption key information and verification data from the decryption information table, it can verify whether the taken out decryption key information is damaged or tampered with through the verification data.

[0107] refer to Figure 4As shown, in one embodiment, a fixed-length storage space can be set for each terminal (including decryption key information, verification data and index value). If this information is not enough to fill the storage space, random information can be filled to increase the difficulty of parsing the decryption information table. For example, useful data including decryption key information, verification data and index values ​​and random information can be stored in a 1:1 ratio; in another embodiment, a specific separator can be used to separate each useful information consisting of decryption key information, verification data and index value, and the specific separator is, for example, a semicolon, a '$' symbol, etc.

[0108] According to the above embodiment, each decryption key information is taken as a whole, and an index value of each decryption key information is generated based on the terminal identification and the random number. All the decryption key information is organized in the decryption information table in the form of an index organization, and transmitted to the terminal through an open channel. At the same time, the terminal will receive the random number used to generate the decryption key information through the open channel, so that the terminal can obtain the index value of its own decryption key information in the decryption information table according to the user's unique terminal identification and the received random number, and then take out its own decryption key information for decryption operations, thereby improving the security of the decryption key information, and then improving the security of decryption operations based on the decryption key information.

[0109] Figure 5 A schematic diagram showing the data structure of the decryption information table of the second embodiment is shown.

[0110] like Figure 5 As shown, the decryption information table 50 is a storage space for storing 4 decryption key information. The number of decryption key information is schematic and can be any integer greater than or equal to 2. Figure 4 The same is that the decryption key information 50 is also stored in an index organization manner, but Figure 4 The difference is that Figure 5 Each decryption key information in is divided into N shares, and the serial number of each share is recorded from 1 to N. The index value of each share in the decryption key information from 1 to N is calculated, and the index value of (4*N) shares can be obtained. Based on the index value of each share and the serial number of each share, all shares can be organized and stored in the decryption information table. If we understand it in terms of rows and columns Figure 5The decryption information table shown can be described as follows: determine the specified row of a share in the decryption information table according to the index value of the share, and determine the specified column of the share in the decryption information table by the serial number of the share, that is, the arrangement order of multiple different shares in the same row. For example, the data corresponding to the index value of 1 in the figure is: the 1st share of the decryption key information of terminal 3, ..., the (N-1)th share of the decryption key information of terminal 1, and the Nth share of the decryption key information of terminal 4. By shuffling the decryption key information of each terminal in different rows of the decryption information table, it is prevented that the decryption key information of each terminal is cracked by brute force as a whole, and the security of the decryption key information is further improved.

[0111] The following takes terminal 1 as an example to explain in detail how to fill the decryption key information of terminal 1 into the decryption information table, and how terminal 1 retrieves the decryption key information from the decryption information table.

[0112] First, calculate index1=H(V, r1), where H() represents a hash function, V represents the unique terminal identifier of terminal 1, and r1 is a randomly generated 128-bit first random number. r1 will be transmitted to terminal 1 on the open channel together with the decryption information table. The decryption key information of terminal 1 is divided into N shares, and each share is called the first share to the Nth share in sequence. Then the first share is placed in the first column position of the specified row corresponding to index1 in the decryption information table. Then obtain the second random number r2, where r2=r1 XOR (the first share of the decryption key information of terminal 1). Then calculate index2=H(V, r2), and place the second share of the decryption key information of terminal 1 in the second column position of the specified row corresponding to index2 in the decryption information table, and then update the third random number r3, r3=r2 XOR (the second share of the decryption key information of terminal 1). And so on, until the first to Nth shares of the decryption key information of terminal 1 are filled into the decryption information table. According to the above steps, the decryption key information of multiple terminals can be filled into the decryption information table. Then, several bits of verification data of the decryption key information of terminal 1 are generated and stored in the decryption information table. The verification data can be stored after the Nth share in the corresponding row corresponding to indexN in the decryption information table, or rN can be XORed (the Nth share of the decryption key information of terminal 1) to calculate r(N+1), and then index(N+1)=H(V, r(N+1)) is calculated, and the verification information is stored after all shares in the corresponding row corresponding to index(N+1) in the decryption information table.

[0113] In this embodiment, the first random number of each terminal is the same. Since the unique terminal identifiers of each terminal are different, the index values ​​of the first shares of the decryption key information of each terminal are different. In some other embodiments, the first random number of each terminal can be different, and each first random number has a corresponding terminal tag. Each first random number and its terminal tag will be transmitted to each terminal on an open channel together with the decryption information table, which can further improve the security of the decryption key information.

[0114] Of course, it is not necessary that all N-th shares of decryption key information are stored in the N-th column. It is also possible that the N-th share is stored in the (N-1)-th column, and the (N-1)-th share is stored in the N-th column, and so on. However, the premise of doing so is that all shares of the same serial number of the decryption key information should be stored in the same column.

[0115] Figure 6 is an exemplary verification data. The exemplary verification data includes n sub-verification data, from sub-verification data 1 to N respectively Figure 5 Of course, even if a decryption key information is divided into N shares, it can still be Figure 4 As shown, only one verification data is generated for each decryption key information, and the verification data can be stored in the same row with one of the shares. For example, for a decryption key information, its corresponding verification data is stored in the row where its Nth share is located. If there are two or more verification data on one row, the two or more verification data can be separated by a separator, and the correspondence between the verification data and the decryption key information can be specified by, for example, markings.

[0116] When filling the verification data into the decryption information table, there can be multiple filling methods. For example, the filling method of the verification data into the decryption information table is associated with the terminal receiving the decryption information table. For example, in the decryption information table received by terminal 1, only the verification data related to each share of the decryption key information of terminal 1 is filled.

[0117] After the decryption information table is filled, the central server 11 can send the decryption information table and the random number generated by the central server to multiple terminals. When terminal 1 obtains the decryption information table and r1 from the open channel, r1 and the terminal identifier V unique to terminal 1 are first hashed: index1 = H (V, r1), and the first column of data indexed as index1 from the decryption information table is used as the first share of the decryption key information of terminal 1. Then update r2 = r1 XOR (the first share of the decryption key information of terminal 1), calculate index2 = H (V, r2), and use the second column of index2 from the decryption information table as the second share of the decryption key information of terminal 1. By analogy, all the decryption key information of terminal 1 can be extracted, and at the same time, based on the verification data at the location of indexn, the decryption key information of terminal 1 can be verified to be correct based on the verification data.

[0118] The above method of splitting the decryption key information into multiple shares and storing them in the decryption information table further improves the security of the decryption key information, thereby improving the security of the decryption operation based on the decryption key information.

[0119] Based on the above embodiments, the inventors have thought of applying the above technical solution to the release of software packages. Due to the modifiability and reproducibility of software, the software can be copied to unauthorized devices or installed on authorized devices after being modified, causing software users to run vulnerable programs. In order to avoid this risk, software developers will encrypt the software package before publishing it to the resource server, and software users need to apply for a key from the software developer before they can download the encrypted software package from the resource server and decrypt it.

[0120] Figure 7 FIG. 1 is an interactive diagram of the software package publishing system of the first embodiment of the present invention. As shown in the figure, steps S11 to S17 are Figure 3 Steps S01 to S07 in are exactly the same and will not be repeated here.

[0121] Step S18 is that the central server 71 encrypts the software package to be released.

[0122] Step S19 is that the central server 71 publishes the encrypted software package to the resource server.

[0123] Step S20 is that the terminal 72 obtains the encrypted software package from the resource server and decrypts the encrypted software package according to the decryption key information. The central server 71 can also send the encrypted software package to each terminal 72. After receiving the software package, the terminal 72 obtains the right to use the software package by decrypting it.

[0124] The term "module" as used herein may refer to, be part of, or include an application specific integrated circuit (ASIC), an electronic circuit, a processor (shared, dedicated, or group) and / or memory (shared, dedicated, or group) that executes one or more software or firmware programs, a combinational logic circuit, and / or other suitable components that provide the described functionality.

[0125] Those skilled in the art will appreciate that each module or unit of the data processing system according to the present invention can be implemented by hardware, firmware or software. Software, for example, includes a coding program formed by various programming languages ​​such as JAVA, C / C++ / C#, SQL, etc. Although the steps and the order of the steps of the embodiment of the present invention are given in the method and the method legend, the executable instructions for implementing the specified logical functions of the steps can be recombined to generate new steps. The order of the steps should not be limited to the order of the steps in the method and the method legend, and can be adjusted at any time according to the needs of the function. For example, some of the steps are executed in parallel or in reverse order.

[0126] The data processing system and method according to the present invention can be deployed on a single or multiple servers. For example, different modules can be deployed on different servers to form dedicated servers. Alternatively, the same functional units, modules or systems can be deployed in a distributed manner on multiple servers to reduce load pressure. The servers include but are not limited to multiple PCs, PC servers, blade computers, supercomputers, etc. in the same local area network and connected via the Internet.

[0127] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. An information publishing system, characterized in that: The system includes a central server and a plurality of terminals, wherein the central server performs the following steps: Constructing a plurality of decryption key information, wherein each of the decryption key information corresponds to a terminal among the plurality of terminals; Splitting the decryption key information of each terminal into 1st to Nth shares, and determining the serial number of each share, where N is an integer greater than or equal to 2; For the 1st to Nth shares of the decryption key information of each terminal, an index value of each share is calculated based on the terminal identifier and the random number, and each share is stored in a designated row and a designated column in the decryption information table, wherein the designated row is determined by the index value of each share, and the designated column is determined by the sequence number of each share; Sending the decryption information table and the random number to a corresponding terminal; Each of the plurality of terminals performs the following steps: Calculate the index value of each share according to its own terminal identification and the random number generated by the central server, and determine the sequence number of each share; Reading each share from a designated row and a designated column in the decryption information table to obtain its own decryption key information, and decrypting the encrypted resource based on the own decryption key information, wherein the designated row is determined by the index value of each share and the designated column is determined by the sequence number of each share; For the first to Nth shares of the decryption key information of each terminal, calculating the index value of each share based on the terminal identifier and the random number includes: Generate a first random number, and calculate an index value of a first share according to the terminal identifier and the first random number; For the index value of the Kth share among the 2nd to Nth shares, a specific operation is performed using the (K-1)th random number and the (K-1)th share to obtain the Kth random number, and the Kth random number and the terminal identifier are used to calculate the index value of the Kth share, where K is greater than or equal to 2 and K is less than or equal to N, and the specific operation is an XOR operation.

2. The information publishing system according to claim 1, characterized in that: Each terminal also performs the following steps: sending its own terminal identification to the central server via a secure channel.

3. The information publishing system according to claim 1, characterized in that: The central server further performs the following steps: encrypting the to-be-sent resource based on the decryption key information of each terminal, obtaining the encrypted resource and sending the encrypted resource to each terminal.

4. The information publishing system according to any one of claims 1 to 3, characterized in that: The central server also performs the following steps: Generate verification data for decryption key information of each terminal; storing each verification data in a corresponding row in the decryption information table, the corresponding row being determined by the index value of the Nth share of the decryption key information corresponding to the verification data; Each terminal also performs the following steps: Reading verification data from the decryption information table; Verify the decryption key information based on the verification data.

5. The information publishing system according to claim 1, characterized in that: The central server also performs the following operations: The unoccupied storage space in the decryption information table is filled with a random value. In the decryption information table, a plurality of storage spaces of set sizes are allocated to a plurality of decryption key information. The storage space of the set size is larger than the storage space actually required for each decryption key information.

6. The information publishing system according to claim 1, characterized in that: The step of calculating the index value of each share based on the terminal identifier and the random number includes: When the calculated index value of the specific share is the same as any previously calculated index value, a new random number is repeatedly obtained, and a new index value is calculated based on the new random number and the terminal identifier until the new index value is different from any previously calculated index value.

7. The information publishing system according to claim 1, characterized in that: The step of calculating the index value of each share based on the terminal identifier and the random number includes: For each share, two index values ​​are calculated; If one of the index values ​​is not occupied, the unoccupied index value is used as the index value of the share; If both index values ​​are occupied, then for the first other share occupying one of the index values, determine whether the other index value is occupied; if not, move the first other share to the specified row of the other index value of the first other share; if yes, then for the second other share occupying the other index value of the first other share, perform the operation of determining whether the other index value is occupied until the index value of one of the two index values ​​is not occupied.

8. The information publishing system according to claim 7, characterized in that: The two index values ​​include a primary index value and a standby index value, and if one of the index values ​​is not occupied, using the unoccupied index value as the index value of the share includes: If the primary index value is not occupied, use the primary index value as the index value of the share; In the case where the primary index value is occupied, the backup index value is used as the index value of the share.

9. The information publishing system according to claim 1, characterized in that: The index value of the Kth share is calculated based on a hash algorithm using the Kth random number and the terminal identifier.

10. An information publishing method, characterized in that: The method is applied to a central server and a plurality of terminals, wherein the central server performs the following steps: Constructing a plurality of decryption key information, wherein each of the decryption key information corresponds to a terminal among the plurality of terminals; Splitting the decryption key information of each terminal into 1st to Nth shares, and determining the serial number of each share, where N is an integer greater than or equal to 2; For the 1st to Nth shares of the decryption key information of each terminal, an index value of each share is calculated based on the terminal identifier and the random number, and each share is stored in a designated row and a designated column in the decryption information table, wherein the designated row is determined by the index value of each share, and the designated column is determined by the sequence number of each share; Sending the decryption information table and the random number to a corresponding terminal; Each of the plurality of terminals performs the following steps: Calculate the index value of each share according to its own terminal identification and the random number generated by the central server, and determine the sequence number of each share; Reading each share from a designated row and a designated column in the decryption information table to obtain its own decryption key information, and decrypting the encrypted resource based on the own decryption key information, wherein the designated row is determined by the index value of each share and the designated column is determined by the sequence number of each share; For the first to Nth shares of the decryption key information of each terminal, calculating the index value of each share based on the terminal identifier and the random number includes: Generate a first random number, and calculate an index value of a first share according to the terminal identifier and the first random number; For the index value of the Kth share among the 2nd to Nth shares, a specific operation is performed using the (K-1)th random number and the (K-1)th share to obtain the Kth random number, and the Kth random number and the terminal identifier are used to calculate the index value of the Kth share, where K is greater than or equal to 2 and K is less than or equal to N, and the specific operation is an XOR operation.

11. The information publishing method according to claim 10, characterized in that: Each terminal also performs the following steps: sending its own terminal identification to the central server via a secure channel.

12. The information publishing method according to claim 10, characterized in that: The central server further performs the following steps: encrypting the to-be-sent resource based on the decryption key information of each terminal, obtaining the encrypted resource and sending the encrypted resource to each terminal.

13. The information publishing method according to any one of claims 10 to 12, characterized in that: The central server also performs the following steps: Generate verification data for decryption key information of each terminal; storing each verification data in a corresponding row in the decryption information table, the corresponding row being determined by the index value of the Nth share of the decryption key information corresponding to the verification data; Each terminal also performs the following steps: Reading verification data from the decryption information table; Verify the decryption key information based on the verification data.

14. The information publishing method according to claim 10, characterized in that: The central server also performs the following operations: The unoccupied storage space in the decryption information table is filled with a random value. In the decryption information table, a plurality of storage spaces of set sizes are allocated to a plurality of decryption key information. The storage space of the set size is larger than the storage space actually required for each decryption key information.

15. The information publishing method according to claim 10, characterized in that: The step of calculating the index value of each share based on the terminal identifier and the random number includes: When the calculated index value of the specific share is the same as any previously calculated index value, a new random number is repeatedly obtained, and a new index value is calculated based on the new random number and the terminal identifier until the new index value is different from any previously calculated index value.

16. The information publishing method according to claim 10, characterized in that: The step of calculating the index value of each share based on the terminal identifier and the random number includes: For each share, two index values ​​are calculated; If one of the index values ​​is not occupied, the unoccupied index value is used as the index value of the share; If both index values ​​are occupied, then for the first other share occupying one of the index values, determine whether the other index value is occupied; if not, move the first other share to the specified row of the other index value of the first other share; if yes, then for the second other share occupying the other index value of the first other share, perform the operation of determining whether the other index value is occupied until the index value of one of the two index values ​​is not occupied.

17. The information publishing method according to claim 16, characterized in that: The two index values ​​include a primary index value and a standby index value, and if one of the index values ​​is not occupied, using the unoccupied index value as the index value of the share includes: If the primary index value is not occupied, use the primary index value as the index value of the share; In the case where the primary index value is occupied, the backup index value is used as the index value of the share.

18. The information publishing method according to claim 10, characterized in that: The index value of the Kth share is calculated based on a hash algorithm using the Kth random number and the terminal identifier.

Citation Information

Patent Citations

  • Method and device for Hash lookup table

    CN101692651A

  • Information processing method and device

    CN105450620A

  • Data transmission method and device and key index generation method and device

    CN108270561A

  • File processing method and device based on Internet of Things, equipment and storage medium

    CN110099064A