A data verification method, device, equipment and medium

Abstract

The application relates to the technical field of data processing, in particular to a data verification method and device, equipment and medium, which are used to solve the problem that the data verification method in the prior art cannot guarantee data security in the data verification process. The method is applied to a first end and comprises the following steps of: in response to a data verification instruction, determining a first to-be-verified string indicated by the data verification instruction, and notifying a second end to determine a verification bit string of a second to-be-verified string corresponding to the first to-be-verified string; performing at least one round of verification bit string generation process on the first to-be-verified string; and determining a verification result of the first to-be-verified string according to a first verification bit string obtained in the last round and a second verification bit string determined by the second end or sending a hash value of the first verification bit string obtained in the last round to the second end, so as to determine a verification result of the second to-be-verified string. The data privacy and security in the data verification process are effectively guaranteed.

Description

Technical Field

[0001] This application relates to the field of data processing technology, specifically to a data verification method, apparatus, device, and medium. Background Technology

[0002] Currently, the most common data type for production data is string data, which includes strings composed of Chinese characters, English characters, symbols, numbers, etc., such as ID card numbers, names, addresses, account names, etc. When the sending end reports production data to the receiving end, the receiving end often encounters problems such as inaccurate data or human tampering. These problems may lead to incorrect decisions and resource allocation. Therefore, the receiving end needs to verify the production data reported by the sending end with the current production data of the sending end to ensure the authenticity and consistency of the data previously reported by the sending end.

[0003] However, existing data verification methods typically employ the method of directly calculating the hash value of a specified string. This method poses a security risk of leaking the preimage information of the hash value. Therefore, existing data verification methods cannot guarantee data security during the data verification process. Summary of the Invention

[0004] This application provides a data verification method, apparatus, device, and medium to address the problem that existing data verification methods cannot guarantee data security during the data verification process.

[0005] In a first aspect, this application provides a data verification method applied to a first end, the method comprising:

[0006] In response to a data verification instruction, the first string to be verified indicated by the data verification instruction is determined, and the second end is notified to determine the verification bit string of the second string to be verified corresponding to the first string to be verified.

[0007] Perform at least one round of verification bit string generation process on the first string to be verified, and determine the verification result of the first string to be verified based on the first verification bit string obtained in the last round and the second verification bit string determined by the second end, or send the hash value of the first verification bit string obtained in the last round to the second end to determine the verification result of the second string to be verified.

[0008] The process of generating the verification bit string in any round includes the following steps:

[0009] The initial bit string of this round is XORed with the random bit string generated in this round to obtain the intermediate bit string. If this round is the first round, the initial bit string is determined based on the first string to be verified. If this round is not the first round, the initial bit string is determined based on the verification bit string obtained in the previous round.

[0010] The intermediate bit string is XORed with the random bit string randomly generated in this round by the second end to obtain the verification bit string for this round, wherein the number of bits in the random bit string is the same as the number of bits in the initial bit string; and the random bit string randomly generated in this round is sent to the second end so that the second end can determine the verification bit string for this round.

[0011] In one possible embodiment, the initial bit string for the first round is generated in the following manner:

[0012] Based on the first string to be verified and the preset character binary encoding rules, determine the binary bit representation corresponding to each character in the first string to be verified;

[0013] The initial bit string is determined based on the binary bit representation of each character in the first string to be verified.

[0014] In one possible embodiment, before determining the binary bit representation corresponding to each character in the first string to be verified based on the first string to be verified and a preset character binary encoding rule, the method further includes:

[0015] It is determined that the character length of the first string to be verified is less than the preset character length.

[0016] In one possible embodiment, after determining the initial bit string, the method further includes:

[0017] Determine whether the number of bits in the initial bit string meets the preset number of bits;

[0018] If the number of bits in the initial bit string is less than the preset number of bits, then based on the preset bit code, the preset bit code is padded to the beginning of the initial bit string until the number of bits in the padded initial bit string is equal to the preset number of bits.

[0019] In one possible embodiment, the method for determining the verification result of the first string to be verified based on the first verification bit string obtained in the last round and the second verification bit string determined by the second end includes:

[0020] Receive the hash value of the second verification bit string sent by the second end;

[0021] Compare the hash value of the first verification bit string with the hash value of the second verification bit string;

[0022] If the hash value of the first verification bit string is equal to the hash value of the second verification bit string, then the verification result of the first string to be verified is determined to be verified successfully.

[0023] If the hash value of the first verification bit string is not equal to the hash value of the second verification bit string, then the verification result of the first string to be verified is determined to be verification failure.

[0024] In one possible embodiment, the first end is a receiving end and the second end is a sending end; the first string to be verified is part or all of the production data sent by the second end to the first end; the second string to be verified is the target production data in the production data of the second end that corresponds to the first string to be verified; or

[0025] If the first end is the sending end and the second end is the receiving end, then the first string to be verified is part or all of the production data of the first end, and the second string to be verified is the target production data in the production data sent by the first end to the second end that corresponds to the first string to be verified.

[0026] Secondly, this application provides a data verification device, configured at a first end, the device comprising:

[0027] The determination module is used to determine the first string to be verified indicated by the data verification instruction in response to the data verification instruction, and to notify the second end to determine the verification bit string of the second string to be verified corresponding to the first string to be verified.

[0028] The verification module is used to perform at least one round of verification bit string generation process on the first string to be verified, and determine the verification result of the first string to be verified based on the first verification bit string obtained in the last round and the second verification bit string determined by the second end, or send the hash value of the first verification bit string obtained in the last round to the second end to determine the verification result of the second string to be verified.

[0029] The process of generating the verification bit string in any round includes the following steps:

[0030] The initial bit string of this round is XORed with the random bit string generated in this round to obtain the intermediate bit string. If this round is the first round, the initial bit string is determined based on the first string to be verified. If this round is not the first round, the initial bit string is determined based on the verification bit string obtained in the previous round.

[0031] The intermediate bit string is XORed with the random bit string randomly generated in this round by the second end to obtain the verification bit string for this round, wherein the number of bits in the random bit string is the same as the number of bits in the initial bit string; and the random bit string randomly generated in this round is sent to the second end so that the second end can determine the verification bit string for this round.

[0032] In one possible embodiment, the verification module generates the initial bit string for the first round in the following manner:

[0033] Based on the first string to be verified and the preset character binary encoding rules, determine the binary bit representation corresponding to each character in the first string to be verified;

[0034] The initial bit string is determined based on the binary bit representation of each character in the first string to be verified.

[0035] In one possible embodiment, before the verification module determines the binary bit representation corresponding to each character in the first string to be verified based on the first string to be verified and a preset character binary encoding rule, the verification module is further configured to:

[0036] It is determined that the character length of the first string to be verified is less than the preset character length.

[0037] In one possible embodiment, after the verification module determines the initial bit string, the verification module is further configured to:

[0038] Determine whether the number of bits in the initial bit string meets the preset number of bits;

[0039] If the number of bits in the initial bit string is less than the preset number of bits, then based on the preset bit code, the preset bit code is padded to the beginning of the initial bit string until the number of bits in the padded initial bit string is equal to the preset number of bits.

[0040] In one possible embodiment, the verification module is specifically used for:

[0041] Receive the hash value of the second verification bit string sent by the second end;

[0042] Compare the hash value of the first verification bit string with the hash value of the second verification bit string;

[0043] If the hash value of the first verification bit string is equal to the hash value of the second verification bit string, then the verification result of the first string to be verified is determined to be verified successfully.

[0044] If the hash value of the first verification bit string is not equal to the hash value of the second verification bit string, then the verification result of the first string to be verified is determined to be verification failure.

[0045] In one possible embodiment, the first end is a receiving end and the second end is a sending end; the first string to be verified is part or all of the production data sent by the second end to the first end; the second string to be verified is the target production data in the production data of the second end that corresponds to the first string to be verified; or

[0046] If the first end is the sending end and the second end is the receiving end, then the first string to be verified is part or all of the production data of the first end, and the second string to be verified is the target production data in the production data sent by the first end to the second end that corresponds to the first string to be verified.

[0047] Thirdly, this application provides an electronic device, comprising:

[0048] Memory, used to store program instructions;

[0049] A processor is configured to invoke program instructions stored in the memory and execute the steps of the method described in any one of the first aspects according to the obtained program instructions.

[0050] Fourthly, this application provides a computer-readable storage medium storing a computer program, the computer program including program instructions, which, when executed by a computer, cause the computer to perform the method described in any one of the first aspects.

[0051] Fifthly, this application provides a computer program product comprising: computer program code, which, when run on a computer, causes the computer to perform the method described in any one of the first aspects.

[0052] The beneficial effects of this application are as follows:

[0053] In this embodiment, the first end responds to a data verification command, determines the first string to be verified indicated by the data verification command, and notifies the second end to determine the verification bit string of the second string to be verified corresponding to the first string to be verified; performs at least one round of verification bit string generation process on the first string to be verified, and determines the verification result of the first string to be verified based on the first verification bit string obtained in the last round and the second verification bit string determined by the second end, or sends the hash value of the first verification bit string obtained in the last round to the second end to determine the verification result of the second string to be verified; wherein, any round of verification bit string generation process includes... The next steps are as follows: XOR the initial bit string of this round with the randomly generated bit string of this round to obtain the intermediate bit string. If this round is the first round, the initial bit string is determined based on the first verification string; if this round is not the first round, the initial bit string is determined based on the verification bit string obtained in the previous round. XOR the intermediate bit string with the randomly generated bit string received from the second end in this round to obtain the verification bit string of this round. The number of bits in the random bit string is the same as the number of bits in the initial bit string. Finally, the randomly generated bit string of this round is sent to the second end so that the second end can determine the verification bit string for this round. The generation processes of the intermediate bit string and the verification bit string in this application are both random. Then, the verification result of the first string to be verified is determined based on the first verification bit string obtained in the last round and the second verification bit string determined by the second end, or the hash value of the first verification bit string obtained in the last round is sent to the second end to determine the verification result of the second string to be verified. Due to the irreversible nature of hash values, the two ends cannot deduce the verification bit string or the intermediate bit string from the hash value, which effectively ensures data privacy and security in the data verification process.

[0054] Other features and advantages of the invention will be set forth in the description which follows, and will be apparent in part from the description, or may be learned by practicing the invention. The objects and other advantages of the invention may be realized and obtained by means of the structures particularly pointed out in the written description, claims, and drawings. Attached Figure Description

[0055] Figure 1 This is a schematic diagram illustrating an application scenario of a data verification method provided in an embodiment of this application.

[0056] Figure 2 A flowchart of a data verification method provided in an embodiment of this application;

[0057] Figure 3 A flowchart illustrating the verification bit string generation process provided in this application embodiment;

[0058] Figure 4A flowchart of the initial bit string generation process provided in this application embodiment;

[0059] Figure 5 A flowchart illustrating another verification bit string generation process provided in this application embodiment;

[0060] Figure 6 A structural diagram of a data verification device provided in an embodiment of this application;

[0061] Figure 7 This is a structural diagram of an electronic device provided in an embodiment of this application. Detailed Implementation

[0062] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of them. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application. Unless otherwise specified, the embodiments and features in the embodiments of this application can be arbitrarily combined with each other. Furthermore, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than that shown here.

[0063] The terms "first" and "second" in the specification, claims, and accompanying drawings of this application are used to distinguish different objects, not to describe a specific order. Furthermore, the term "comprising" and any variations thereof are intended to cover non-exclusive protection. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or devices. The term "multiple" in this application can mean at least two, for example, two, three, or more, and the embodiments of this application do not impose limitations.

[0064] The following description, in conjunction with the accompanying drawings, illustrates exemplary embodiments of this application, including various details to aid understanding. These embodiments should be considered merely exemplary. Therefore, those skilled in the art should recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope of this application. Similarly, for clarity and brevity, descriptions of well-known functions and structures are omitted in the following description. It should be noted that in the embodiments of this application, certain existing industry solutions such as software, components, and models may be mentioned. These should be considered exemplary, intended only to illustrate the feasibility of implementing the technical solutions of this application, and do not imply that the applicant has already used or necessarily used such solutions.

[0065] The acquisition, transmission, storage, and use of data in this application all comply with the requirements of relevant national laws and regulations.

[0066] Before introducing the data verification method provided in the embodiments of this application, for ease of understanding, the technical background of the embodiments of this application will be described in detail below.

[0067] Currently, the most common data type for production data is string data, which includes strings composed of Chinese characters, English characters, symbols, numbers, etc., such as ID card numbers, names, addresses, account names, etc. When the sending end reports production data to the receiving end, the receiving end often encounters problems such as inaccurate data or human tampering. These problems may lead to incorrect decisions and resource allocation. Therefore, the receiving end needs to verify the production data reported by the sending end with the current production data of the sending end to ensure the authenticity and consistency of the data previously reported by the sending end.

[0068] However, existing data verification methods typically employ the method of directly calculating the hash value of a specified string, which poses a security risk of leaking the preimage information of the hash value.

[0069] In view of this, and in order to address the problem that existing data verification methods cannot guarantee data security during the data verification process, this application provides a data verification method, apparatus, device, and medium. Some preferred embodiments of this application will be described below with reference to the accompanying drawings.

[0070] The application scenarios of the embodiments of this application are described below.

[0071] See Figure 1 , Figure 1 This is a schematic diagram of an application scenario for a data verification method provided in an embodiment of this application, including a first end 10 and a second end 20.

[0072] The first terminal 10, in response to the data verification instruction, determines the first string to be verified indicated by the data verification instruction, and notifies the second terminal 20 to determine the verification bit string of the second string to be verified corresponding to the first string to be verified; performs at least one round of verification bit string generation process on the first string to be verified, and determines the verification result of the first string to be verified based on the first verification bit string obtained in the last round and the second verification bit string determined by the second terminal 20, or sends the hash value of the first verification bit string obtained in the last round to the second terminal 20 to determine the verification result of the second string to be verified.

[0073] The process of generating the verification bit string in any round includes the following steps:

[0074] The initial bit string of this round is XORed with the random bit string generated in this round to obtain the intermediate bit string. If this round is the first round, the initial bit string is determined based on the first string to be verified. If this round is not the first round, the initial bit string is determined based on the verification bit string obtained in the previous round.

[0075] The intermediate bit string is XORed with the random bit string randomly generated in this round by the second end 20 to obtain the verification bit string for this round, wherein the number of bits in the random bit string is the same as the number of bits in the initial bit string; and the random bit string randomly generated in this round is sent to the second end 20 so that the second end 20 can determine the verification bit string for this round.

[0076] Where, when the first end 10 is the receiving end and the second end 20 is the sending end, then the first string to be verified is part or all of the production data sent from the second end 20 to the first end 10; the second string to be verified is the target production data in the production data of the second end 20 that corresponds to the first string to be verified; or

[0077] When the first end 10 is the sending end and the second end 20 is the receiving end, the first string to be verified is part or all of the production data in the first end 10, and the second string to be verified is the target production data in the production data sent from the first end 10 to the second end 20 that corresponds to the first string to be verified.

[0078] The first end 10 and the second end 20 are connected via the Internet to enable communication between them. Optionally, the Internet uses standard communication technologies and / or protocols. The Internet is typically the Internet, but can also be any network, including but not limited to any combination of Local Area Networks (LANs), Metropolitan Area Networks (MANs), Wide Area Networks (WANs), mobile, wired or wireless networks, private networks, or Virtual Private Networks. In some embodiments, technologies and / or formats including HyperText Markup Language (HTML), Extensible Markup Language (XML), etc., are used to represent data exchanged over the network. Furthermore, conventional encryption technologies such as Secure Socket Layer (SSL), Transport Layer Security (TLS), Virtual Private Network (VPN), and Internet Protocol Security (IPsec) can be used to encrypt all or some links. In other embodiments, customized and / or dedicated data communication technologies can be used to replace or supplement the aforementioned data communication technologies.

[0079] It should be noted that, Figure 1 This is merely an example of an application scenario and does not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the emergence of new application scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0080] The data verification method provided by exemplary embodiments of this application will now be described with reference to the accompanying drawings.

[0081] Please refer to Figure 2 This is a flowchart of a data verification method provided in an embodiment of this application. The method is applied to... Figure 1 The first end 10 includes the following steps.

[0082] In step 201, in response to the data verification instruction, the first string to be verified indicated by the data verification instruction is determined, and the second end is notified to determine the verification bit string of the second string to be verified corresponding to the first string to be verified.

[0083] In practice, if the first end is the receiving end and the second end is the sending end, then the first string to be verified is part or all of the production data sent from the second end to the first end; the second string to be verified is the target production data in the production data of the second end that corresponds to the first string to be verified.

[0084] For example, if the production data at the second end is data1, data2, data3, and data4, and the second end sends data1 and data2 to the first end, then the first string to be verified can be data1, data2, or data1 and data2. Taking data1 as the first string to be verified as the first string to be verified, then the target production data corresponding to the first string to be verified in the production data at the second end is data1, that is, the second string to be verified is data1.

[0085] In practice, if the first end is the sending end and the second end is the receiving end, then the first string to be verified is part or all of the production data of the first end, and the second string to be verified is the target production data in the production data sent from the first end to the second end that corresponds to the first string to be verified.

[0086] For example, if the production data at the first end is data 1, data 2, data 3, and data 4, and the first end sends data 3 and data 4 to the second end, then the first string to be verified can be data 3, data 4, or data 3 and data 4. Taking data 3 as the first string to be verified, then the target production data corresponding to the first string to be verified in the production data sent from the first end to the second end is data 3, that is, the second string to be verified is data 3.

[0087] In practice, the same string to be verified can be identified in the first and second ends. If there are multiple strings to be verified, the order of each string to be verified can be the same in the first and second ends.

[0088] In practice, the data verification instruction can be generated by the first end based on the received user operation instruction, or it can be automatically triggered when the preset verification period arrives. This application does not limit this.

[0089] In practice, the first end responds to the data verification command and can determine the first string to be verified indicated by the data verification command. Then, the first end can send the identifier of the first string to be verified to the second end. The second end finds the verification bit string of the corresponding second string to be verified based on the identifier and determines the verification bit string of the second string to be verified.

[0090] In step 202, at least one round of verification bit string generation process is performed on the first string to be verified, and the verification result of the first string to be verified is determined based on the first verification bit string obtained in the last round and the second verification bit string determined by the second end, or the hash value of the first verification bit string obtained in the last round is sent to the second end to determine the verification result of the second string to be verified.

[0091] For specific implementation, please refer to Figure 3 This is a flowchart of a verification bit string generation process provided in an embodiment of this application. The method is applied to... Figure 1 The first end 10 includes the following steps.

[0092] In step 301, the initial bit string of this round is XORed with the random bit string generated in this round to obtain the intermediate bit string.

[0093] If this round is the first round, the initial bit string is determined based on the first string to be verified; if this round is not the first round, the initial bit string is determined based on the verification bit string obtained in the previous round.

[0094] Please refer to Figure 4 This is a flowchart of a first-round initial bit string generation process provided in an embodiment of this application. The method is applied to... Figure 1 The first end 10 includes the following steps.

[0095] In step 401, based on the first string to be verified and the preset character binary encoding rules, the binary bit representation corresponding to each character in the first string to be verified is determined.

[0096] In practice, based on the first string to be verified and the preset character binary encoding rules, before determining the binary bit representation corresponding to each character in the first string to be verified, it can be determined whether the character length of the first string to be verified is less than the preset character length. For example, the preset character length can be set to 32 characters. The specific character length can be determined according to the actual character length of the string data in the actual application. In this way, by stipulating that the string to be verified does not exceed the preset character length, it can be further ensured that any string to be verified can be verified normally, thereby further improving the accuracy of verification.

[0097] Among them, the preset character binary encoding rules are, for example, the American Standard Code for Information Interchange (ASCII). ASCII encoding uses a specified combination of 7 or 8 bits of binary numbers to represent 128 or 256 possible characters, including English letters, numbers, punctuation marks, and some control characters, or UTF-8, etc.

[0098] Taking the preset character binary encoding rule as ASCII encoding as an example, assuming the first string to be verified is (Hello,World!), then the binary bit representation of each character according to the ASCII encoding rule is as follows:

[0099] H: Decimal value: 72, corresponding binary value: 01001000;

[0100] e: Decimal: 101, corresponding to binary: 01100101;

[0101] l: Decimal: 108, corresponding to binary: 01101100;

[0102] l: Decimal: 108, corresponding to binary: 01101100;

[0103] o: Decimal: 111, corresponding to binary: 01101111;

[0104] ,: The decimal value is 44, and the corresponding binary value is: 00101100;

[0105] Space: Decimal value 32, corresponding to binary value: 00100000;

[0106] W: Decimal value is 87, corresponding to binary value: 01010111;

[0107] o: Decimal: 111, corresponding to binary: 01101111;

[0108] r: 114 in decimal, corresponding to 01110010 in binary;

[0109] l: Decimal: 108, corresponding to binary: 01101100;

[0110] d: 100 in decimal, corresponding to 01100100 in binary;

[0111] !: The decimal value is 33, and the corresponding binary value is 00100001;

[0112] ASCII encoding uses one byte (8 bits) to represent each character, meaning that the binary representation of each character consists of 8 bits.

[0113] In step 402, an initial bit string is determined based on the binary bit representation of each character in the first string to be verified.

[0114] In specific implementation, based on the binary bit representation of each character in the string (Hello, World!) under ASCII encoding, the initial bit string is (010010000110010101101100011011000110111100101100001000000101011101101111011101110010011011000110010000100001).

[0115] In practice, after determining the initial bit string, it is further possible to determine whether the number of bits in the initial bit string meets the preset number of bits. For example, the preset number of bits is 256 bits. If the number of bits in the initial bit string is less than the preset number of bits, then based on the preset bit code, the preset bit code is padded to the front of the initial bit string until the number of bits in the padded initial bit string is equal to the preset number of bits. The preset bit code can be 0 or 1.

[0116] Since each string has a different character length, the number of bits in the generated initial bit string is also different. Therefore, the initial bit string can be padded to a preset number of bits before generating the corresponding random bit string, which facilitates XOR processing.

[0117] For example, assuming the preset bit length is 256 bits and the preset bit code is 0, taking the initial bit string of the string (Hello, World!) as (01001000011001010110110001101100011011110010110000100000010101110110111101110010011011000110010000100001), since the initial bit string has 104 bits, which is less than 256, we can pad the beginning of the initial bit string with 152 zeros.

[0118] Next, based on the length of the initial bit string for this round, a random number is generated for each bit position. This random number can be 0 or 1. Then, these random arrays are combined into a new bit string, which is the random bit string generated in this round. Therefore, the number of bits in the random bit string is the same as the number of bits in the initial bit string.

[0119] Then, the initial bit string of this round is XORed with the randomly generated bit string of this round to obtain the intermediate bit string.

[0120] In practice, the XOR operation is a bitwise operator. For two bits, the result is 0 if they are the same, and 1 if they are different. For example, 0 XOR 0 = 0; 0 XOR 1 = 1; 1 XOR 0 = 1; 1 XOR 1 = 0. The initial bit string of this round is XORed with the corresponding bits in the randomly generated bit string of this round to obtain the intermediate bit string. Therefore, the number of bits in the intermediate bit string is the same as the number of bits in the random bit string and the number of bits in the initial bit string.

[0121] Suppose that the initial bit string for this round is initial bit string A (0100100001100101), and the randomly generated bit string for this round is random bit string B (0110010001101100). Perform an XOR operation between the initial bit string A and the random bit string B, i.e., 0 XOR 0 = 0, 1 XOR 1 = 0, 0 XOR 1 = 1, 0 XOR 0 = 0, 1 XOR 0 = 1 in sequence, and the resulting intermediate bit string C is (0010110000001001).

[0122] In step 302, the intermediate bit string is XORed with the received random bit string randomly generated in this round from the second end to obtain the verification bit string for this round.

[0123] In specific implementation, assuming the intermediate bit string is intermediate bit string C (0010110000001001) and the random bit string randomly generated by the second end in this round is random bit string D (1001101010000011), then the intermediate bit string C and the random bit string D are XORed to obtain the verification bit string for this round (1011011010001010).

[0124] In step 303, the randomly generated bit string for this round is sent to the second end so that the second end can determine the verification bit string for this round.

[0125] In practice, the first end sends the randomly generated bit string B to the second end so that the second end can determine the verification bit string for this round.

[0126] It should be noted that after the second end determines the second string to be verified corresponding to the first string to be verified, it can perform at least one round of verification bit string generation process on the second string to be verified. Please refer to [link / reference]. Figure 5 This is a flowchart of another verification bit string generation process provided in an embodiment of this application. The method is applied to... Figure 1 The second end 20 includes the following steps.

[0127] In step 501, the initial bit string of this round is XORed with the random bit string generated in this round to obtain the intermediate bit string.

[0128] In this process, if this round is the first round, the initial bit string is determined based on the second string to be verified. If this round is not the first round, the initial bit string is determined based on the verification bit string obtained in the previous round. For example, the verification bit string obtained in the previous round can be directly used as the initial bit string for this round. In this way, after multiple rounds of calculation, it is beneficial to further improve the data security in the data verification process.

[0129] For the specific implementation process, please refer to step 301, which will not be repeated here.

[0130] In step 502, the intermediate bit string is XORed with the received random bit string randomly generated in this round from the first end to obtain the verification bit string for this round.

[0131] For the specific implementation process, please refer to step 302, which will not be elaborated here.

[0132] In step 503, the randomly generated bit string for this round is sent to the first end so that the first end can determine the verification bit string for this round.

[0133] In practice, the verification result of the first string to be verified is determined based on the first verification bit string obtained in the last round and the second verification bit string determined by the second end. This can be achieved by receiving the hash value of the second verification bit string sent by the second end and comparing the hash value of the first verification bit string with the hash value of the second verification bit string to determine the verification result of the first string to be verified.

[0134] Specifically, if the hash value of the first verification bit string is equal to the hash value of the second verification bit string, the verification result of the first string to be verified is determined to be verified successfully; if the hash value of the first verification bit string is not equal to the hash value of the second verification bit string, the verification result of the first string to be verified is determined to be verified unsuccessfully.

[0135] Suppose that the first end contains the verification bit string A, the string to be verified A, the initial bit string A, the random bit string A, and the intermediate bit string A, and the second end contains the verification bit string B, the string to be verified B, the initial bit string B, the random bit string B, and the intermediate bit string B.

[0136] Therefore, the verification bit string A = the intermediate bit string A XOR the random bit string B. Since the intermediate bit string A = the initial bit string A XOR the random bit string A, the verification bit string A = the initial bit string A XOR the random bit string A XOR the random bit string B. Furthermore, the initial bit string A is determined based on the string A to be verified.

[0137] The verification bit string B = intermediate bit string B XOR random bit string A. Since the intermediate bit string B = initial bit string B XOR random bit string B, the verification bit string B = initial bit string B XOR random bit string B XOR random bit string A. Furthermore, the initial bit string B is determined based on the string B to be verified. Therefore, both the verification bit string A and the verification bit string B contain random bit string A XOR random bit string B. If the verification bit string B is the same as the verification bit string A, it means that the string B to be verified is the same as the string A to be verified; otherwise, it means that the string B to be verified is the same as the string A to be verified.

[0138] Thus, the generation processes of both the intermediate bit string and the verification bit string in this scheme are random. Verification is then performed based on the hash values ​​of their respective verification bit strings. Due to the irreversible nature of hash values, neither end can deduce the verification bit string or the intermediate bit string from the hash value, effectively ensuring data privacy and security during the data verification process. Furthermore, compared to existing methods for string data privacy verification, such as directly calculating the hash and sending it to the other party, while the other party cannot directly invert the hash, they can continuously collect sample information and perform hash calculations and matching, thus posing a risk of data leakage. The present invention addresses several security vulnerabilities in hash preimage information, including: the need for obfuscated circuits to calculate and transmit truth tables for each bit of data (resulting in extremely high communication volume and unacceptable performance requirements); the need for homomorphic encryption to encrypt all data before sending it to the recipient node (posing a potential risk of ciphertext out-of-domain transmission); and the need for secret sharing for equality verification, which requires additional steps such as generating multiplication triples and sharing multiplication secrets, leading to significant computational performance overhead. Therefore, this solution avoids complex operations like obfuscated circuits and homomorphic encryption, and eliminates the need for pre-computation work such as multiplication triples, thus improving performance while protecting data privacy.

[0139] The following example illustrates the data verification method of this application, using the hash value of the second verification bit string received by the first end from the second end to verify the verification result of the first string to be verified at the first end.

[0140] Suppose that the first string to be verified at the first end is (tom), the second string to be verified at the second end is (tom), the binary encoding rule is ASCII encoding, and 8 bits (i.e. one byte) are used to represent each ASCII character, the preset bit length is set to 24, and one round of verification bit string generation process is set to be executed.

[0141] The first to fourth steps of the first-end execution of the verification bit string generation process are as follows:

[0142] Step 1: Based on (tom) and ASCII encoding rules, determine the binary bit representation of each character in (tom) as follows: t: decimal: 116, binary: 01110100; o: decimal: 111, binary: 01101111; m: decimal: 109, binary: 01101101. Generate the initial bit string A as (0111010001101111101101101), which meets the preset number of bits.

[0143] Step 2: Generate a random bit string A with the same number of bits as the initial bit string A. Assume that the random bit string A is (110001101100100100100111).

[0144] Step 3: Perform an XOR operation between the initial bit string A and the random bit string A to obtain the intermediate bit string A.

[0145] In practice, each bit of the initial bit string A is XORed with each bit of the random bit string A. The result of XORing the same bits is 0, and the result of XORing different bits is 1. Then the intermediate bit string A is (011101000110111101101101) XOR (110001101100100100100111) = (101100101010011001001010).

[0146] Step 4: Send random bit string A to the second end and receive random bit string B sent by the second end.

[0147] Similarly, the first to fourth steps of the verification bit string generation process at the second end are as follows:

[0148] Step 1: Based on (tom) and ASCII encoding rules, determine the binary bit representation of each character in (tom) and generate the initial bit string B as (011101000110111101101101), which satisfies the preset number of bits.

[0149] Step 2: Generate a random bit string B with the same number of bits as the initial bit string B. Assume that the random bit string B is (011111000010011110001010).

[0150] Step 3: Perform an XOR operation between the initial bit string B and the random bit string B to obtain the intermediate bit string B.

[0151] In practice, each bit of the initial bit string B is XORed with each bit of the random bit string B. The result of XORing the same bits is 0, and the result of XORing different bits is 1. Then the intermediate bit string B is (011101000110111101101101) XOR (011111000010011110001010) = (000010000100100011100111).

[0152] Step 4: Send the random bit string B to the first end and receive the random bit string A (110001101100100100100111) sent by the first end.

[0153] Step 5: Perform an XOR operation between the intermediate bit string B and the random bit string A to obtain the verification bit string B.

[0154] In practice, each bit in the intermediate bit string B is XORed with each bit in the random bit string A. Then, the verification bit string B = (000010000100100011100111) XOR (110001101100100100100111) = (110011101000000111000000).

[0155] Step 6: Calculate the hash value of the verification bit string B and send it to the first end.

[0156] The fifth to seventh steps of the first-end verification bit string generation process are as follows:

[0157] Step 5: Perform an XOR operation between the intermediate bit string A and the random bit string B to obtain the verification bit string A.

[0158] In practice, each bit in the intermediate bit string A is XORed with each bit in the random bit string B. Then, the verification bit string A = (101100101010011001001010) XOR (011111000010011110001010) = (110011101000000111000000).

[0159] Step 6: Calculate the hash value of verification bit string A and receive the hash value of verification bit string B sent by the first end.

[0160] Step 7: Compare the hash value of verification bit string A with the hash value of verification bit string B to determine the verification result of the first string to be verified.

[0161] Since the verification bit string A is the same as the verification bit string B, the resulting hash values ​​must be the same. Therefore, the verification result of the first string to be verified is determined to be verified successfully.

[0162] Let's assume that the first string to be verified at the first end is (tom), the second string to be verified at the second end is (Tom), the binary encoding rule is ASCII encoding, and 8 bits (i.e., one byte) are used to represent each ASCII character, the preset bit length is set to 24, and one round of verification bit string generation process is set to be executed.

[0163] The first to fourth steps of the first-end execution of the verification bit string generation process are as follows:

[0164] Step 1: Based on (tom) and ASCII encoding rules, determine the binary bit representation of each character in (tom) as follows: t: decimal: 116, binary: 01110100; o: decimal: 111, binary: 01101111; m: decimal: 109, binary: 01101101. Generate the initial bit string A as (0111010001101111101101101), which meets the preset number of bits.

[0165] Step 2: Generate a random bit string A with the same number of bits as the initial bit string A. Assume that the random bit string A is (110001101100100100100111).

[0166] Step 3: Perform an XOR operation between the initial bit string A and the random bit string A to obtain the intermediate bit string A.

[0167] In practice, each bit of the initial bit string A is XORed with each bit of the random bit string A. The result of XORing the same bits is 0, and the result of XORing different bits is 1. Then the intermediate bit string A is (011101000110111101101101) XOR (110001101100100100100111) = (101100101010011001001010).

[0168] Step 4: Send random bit string A to the second end and receive random bit string B sent by the second end.

[0169] Similarly, the first to fourth steps of the verification bit string generation process at the second end are as follows:

[0170] Step 1: Based on (Tom) and ASCII encoding rules, determine the binary bit representation of each character in (tom): T: decimal: 84, binary: 01010100; o: decimal: 111, binary: 01101111; m: decimal: 109, binary: 01101101. Generate the initial bit string B as (010101000110111101101101), which satisfies the preset number of bits.

[0171] Step 2: Generate a random bit string B with the same number of bits as the initial bit string B. Assume that the random bit string B is (011111000010011110001010).

[0172] Step 3: Perform an XOR operation between the initial bit string B and the random bit string B to obtain the intermediate bit string B.

[0173] In practice, each bit of the initial bit string B is XORed with each bit of the random bit string B. The result of XORing the same bits is 0, and the result of XORing different bits is 1. Then the intermediate bit string B is (010101000110111101101101) XOR (011111000010011110001010) = (001010000100100011100111).

[0174] Step 4: Send the random bit string B to the first end and receive the random bit string A (110001101100100100100111) sent by the first end.

[0175] Step 5: Perform an XOR operation between the intermediate bit string B and the random bit string A to obtain the verification bit string B.

[0176] In practice, each bit in the intermediate bit string B is XORed with each bit in the random bit string A. Then, the verification bit string B = (001010000100100011100111) XOR (110001101100100100100111) = (111011101000000111000000).

[0177] Step 6: Calculate the hash value of the verification bit string B and send it to the first end.

[0178] The fifth to seventh steps of the first-end verification bit string generation process are as follows:

[0179] Step 5: Perform an XOR operation between the intermediate bit string A and the random bit string B to obtain the verification bit string A.

[0180] In practice, each bit in the intermediate bit string A is XORed with each bit in the random bit string B. Then, the verification bit string A = (101100101010011001001010) XOR (011111000010011110001010) = (110011101000000111000000).

[0181] Step 6: Calculate the hash value of verification bit string A and receive the hash value of verification bit string B sent by the first end.

[0182] Step 7: Compare the hash value of verification bit string A with the hash value of verification bit string B to determine the verification result of the first string to be verified.

[0183] Since the verification bit string A = (110011101000000111000000) and the verification bit string B = (111011101000000111000000), and the verification bit string A and the verification bit string B are different, the resulting hash values ​​must be different. Therefore, it can be determined that the verification result of the first string to be verified is that the verification failed.

[0184] Based on the same inventive concept, embodiments of this application provide a data verification device, please refer to... Figure 6 The device includes:

[0185] The determining module 601 is configured to, in response to a data verification instruction, determine the first string to be verified indicated by the data verification instruction, and notify the second end to determine the verification bit string of the second string to be verified corresponding to the first string to be verified.

[0186] The verification module 602 is used to perform at least one round of verification bit string generation process on the first string to be verified, and determine the verification result of the first string to be verified based on the first verification bit string obtained in the last round and the second verification bit string determined by the second end, or send the hash value of the first verification bit string obtained in the last round to the second end to determine the verification result of the second string to be verified.

[0187] The process of generating the verification bit string in any round includes the following steps:

[0188] The initial bit string of this round is XORed with the random bit string generated in this round to obtain the intermediate bit string. If this round is the first round, the initial bit string is determined based on the first string to be verified. If this round is not the first round, the initial bit string is determined based on the verification bit string obtained in the previous round.

[0189] The intermediate bit string is XORed with the random bit string randomly generated in this round by the second end to obtain the verification bit string for this round, wherein the number of bits in the random bit string is the same as the number of bits in the initial bit string; and the random bit string randomly generated in this round is sent to the second end so that the second end can determine the verification bit string for this round.

[0190] In one possible embodiment, the verification module 602 generates the initial bit string for the first round in the following manner:

[0191] Based on the first string to be verified and the preset character binary encoding rules, determine the binary bit representation corresponding to each character in the first string to be verified;

[0192] The initial bit string is determined based on the binary bit representation of each character in the first string to be verified.

[0193] In one possible embodiment, before the verification module 602 determines the binary bit representation corresponding to each character in the first string to be verified based on the first string to be verified and a preset character binary encoding rule, the verification module 602 is further configured to:

[0194] It is determined that the character length of the first string to be verified is less than the preset character length.

[0195] In one possible embodiment, after the verification module 602 determines the initial bit string, the verification module 602 is further configured to:

[0196] Determine whether the number of bits in the initial bit string meets the preset number of bits;

[0197] If the number of bits in the initial bit string is less than the preset number of bits, then based on the preset bit code, the preset bit code is padded to the beginning of the initial bit string until the number of bits in the padded initial bit string is equal to the preset number of bits.

[0198] In one possible embodiment, the verification module 602 is specifically used for:

[0199] Receive the hash value of the second verification bit string sent by the second end;

[0200] Compare the hash value of the first verification bit string with the hash value of the second verification bit string;

[0201] If the hash value of the first verification bit string is equal to the hash value of the second verification bit string, then the verification result of the first string to be verified is determined to be verified successfully.

[0202] If the hash value of the first verification bit string is not equal to the hash value of the second verification bit string, then the verification result of the first string to be verified is determined to be verification failure.

[0203] In one possible embodiment, the first end is a receiving end and the second end is a sending end; the first string to be verified is part or all of the production data sent by the second end to the first end; the second string to be verified is the target production data in the production data of the second end that corresponds to the first string to be verified; or

[0204] If the first end is the sending end and the second end is the receiving end, then the first string to be verified is part or all of the production data of the first end, and the second string to be verified is the target production data in the production data sent by the first end to the second end that corresponds to the first string to be verified.

[0205] Based on the same inventive concept, this application provides an electronic device that can realize the functions of the data verification device described above. Please refer to... Figure 7 The device includes a memory 701, one or more processors 702, and a bus 703.

[0206] The memory 701 is used to store computer programs executed by the processor 701. The memory 701 may mainly include a program storage area and a data storage area. The program storage area may store the operating system and programs required to run instant messaging functions, etc.; the data storage area may store various instant messaging information and operation instruction sets, etc.

[0207] Memory 701 may be volatile memory, such as random-access memory (RAM); memory 701 may also be non-volatile memory, such as read-only memory, flash memory, hard disk drive (HDD), or solid-state drive (SSD); or memory 701 may be any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but is not limited thereto. Memory 701 may be a combination of the above-mentioned memories.

[0208] The processor 702 may include one or more central processing units (CPUs) or digital processing units, etc. The processor 702 is used to implement the data verification method described in the above embodiments when it invokes a computer program stored in the memory 702.

[0209] This application embodiment does not limit the specific connection medium between the memory 701 and the processor 702 described above. This application embodiment... Figure 7 The memory 701 and the processor 702 are connected via a bus 703, and the bus 703 is in Figure 7 The connections between other components are shown in bold lines only and are not intended to be limiting. The 703 bus can be divided into address bus, data bus, control bus, etc. For ease of illustration, Figure 7The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0210] Based on the same inventive concept, embodiments of this application provide a computer-readable storage medium. The computer program product includes computer program code, which, when executed on a computer, causes the computer to perform any of the data verification methods discussed above. Since the principle by which the computer-readable storage medium solves the problem is similar to that of the data verification method, the implementation of the computer-readable storage medium can be found in the implementation of the method; repeated details will not be elaborated further.

[0211] Based on the same inventive concept, this application also provides a computer program product, which includes computer program code. When the computer program code is run on a computer, it causes the computer to execute any of the data verification methods discussed above. Since the principle by which the above-described computer program product solves the problem is similar to that of the data verification method, the implementation of the above-described computer program product can be referred to the implementation of the method, and repeated details will not be described again.

[0212] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0213] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0214] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0215] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of user-operated steps to be executed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0216] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the spirit and scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

1. A data verification method, characterized in that, Applied to the first end, the method includes: In response to a data verification instruction, the first string to be verified indicated by the data verification instruction is determined, and the second end is notified to determine the verification bit string of the second string to be verified corresponding to the first string to be verified. Perform at least one round of verification bit string generation process on the first string to be verified, and determine the verification result of the first string to be verified based on the first verification bit string obtained in the last round and the second verification bit string determined by the second end, or send the hash value of the first verification bit string obtained in the last round to the second end to determine the verification result of the second string to be verified. The process of generating the verification bit string in any round includes the following steps: The initial bit string of this round is XORed with the random bit string generated in this round to obtain the intermediate bit string. If this round is the first round, the initial bit string is determined based on the first string to be verified. If this round is not the first round, the initial bit string is determined based on the verification bit string obtained in the previous round. The intermediate bit string is XORed with the random bit string randomly generated in this round by the second end to obtain the verification bit string for this round, wherein the number of bits in the random bit string is the same as the number of bits in the initial bit string; and the random bit string randomly generated in this round is sent to the second end so that the second end can determine the verification bit string for this round.

2. The method as described in claim 1, characterized in that, The initial bit string for the first round is generated in the following way: Based on the first string to be verified and the preset character binary encoding rules, determine the binary bit representation corresponding to each character in the first string to be verified; The initial bit string is determined based on the binary bit representation of each character in the first string to be verified.

3. The method as described in claim 2, characterized in that, Before determining the binary bit representation of each character in the first string to be verified based on the first string to be verified and a preset character binary encoding rule, the method further includes: It is determined that the character length of the first string to be verified is less than the preset character length.

4. The method as described in claim 2, characterized in that, After determining the initial bit string, the method further includes: Determine whether the number of bits in the initial bit string meets the preset number of bits; If the number of bits in the initial bit string is less than the preset number of bits, then based on the preset bit code, the preset bit code is padded to the beginning of the initial bit string until the number of bits in the padded initial bit string is equal to the preset number of bits.

5. The method as described in claim 1, characterized in that, The method for determining the verification result of the first string to be verified based on the first verification bit string obtained in the last round and the second verification bit string determined by the second end includes: Receive the hash value of the second verification bit string sent by the second end; Compare the hash value of the first verification bit string with the hash value of the second verification bit string; If the hash value of the first verification bit string is equal to the hash value of the second verification bit string, then the verification result of the first string to be verified is determined to be verified successfully. If the hash value of the first verification bit string is not equal to the hash value of the second verification bit string, then the verification result of the first string to be verified is determined to be verification failure.

6. The method according to any one of claims 1 to 5, characterized in that, If the first end is the receiving end and the second end is the sending end, then the first string to be verified is part or all of the production data sent by the second end to the first end; the second string to be verified is the target production data in the production data of the second end that corresponds to the first string to be verified. or If the first end is the sending end and the second end is the receiving end, then the first string to be verified is part or all of the production data of the first end, and the second string to be verified is the target production data in the production data sent by the first end to the second end that corresponds to the first string to be verified.

7. A data verification device, characterized in that, The device, configured at the first end, includes: The determination module is used to determine the first string to be verified indicated by the data verification instruction in response to the data verification instruction, and to notify the second end to determine the verification bit string of the second string to be verified corresponding to the first string to be verified. The verification module is used to perform at least one round of verification bit string generation process on the first string to be verified, and determine the verification result of the first string to be verified based on the first verification bit string obtained in the last round and the second verification bit string determined by the second end, or send the hash value of the first verification bit string obtained in the last round to the second end to determine the verification result of the second string to be verified. The process of generating the verification bit string in any round includes the following steps: The initial bit string of this round is XORed with the random bit string generated in this round to obtain the intermediate bit string. If this round is the first round, the initial bit string is determined based on the first string to be verified. If this round is not the first round, the initial bit string is determined based on the verification bit string obtained in the previous round. The intermediate bit string is XORed with the random bit string randomly generated in this round by the second end to obtain the verification bit string for this round, wherein the number of bits in the random bit string is the same as the number of bits in the initial bit string; and the random bit string randomly generated in this round is sent to the second end so that the second end can determine the verification bit string for this round.

8. The apparatus as claimed in claim 7, characterized in that, The verification module generates the initial bit string for the first round in the following manner: Based on the first string to be verified and the preset character binary encoding rules, determine the binary bit representation corresponding to each character in the first string to be verified; The initial bit string is determined based on the binary bit representation of each character in the first string to be verified.

9. The apparatus as claimed in claim 8, characterized in that, Before the verification module determines the binary bit representation of each character in the first string to be verified based on the first string to be verified and the preset character binary encoding rules, the verification module is further configured to: It is determined that the character length of the first string to be verified is less than the preset character length.

10. The apparatus as claimed in claim 8, characterized in that, After determining the initial bit string, the verification module is further configured to: Determine whether the number of bits in the initial bit string meets the preset number of bits; If the number of bits in the initial bit string is less than the preset number of bits, then based on the preset bit code, the preset bit code is padded to the beginning of the initial bit string until the number of bits in the padded initial bit string is equal to the preset number of bits.

11. The apparatus as claimed in claim 7, characterized in that, The verification module is specifically used for: Receive the hash value of the second verification bit string sent by the second end; Compare the hash value of the first verification bit string with the hash value of the second verification bit string; If the hash value of the first verification bit string is equal to the hash value of the second verification bit string, then the verification result of the first string to be verified is determined to be verified successfully. If the hash value of the first verification bit string is not equal to the hash value of the second verification bit string, then the verification result of the first string to be verified is determined to be verification failure.

12. The apparatus according to any one of claims 7 to 11, characterized in that, If the first end is the receiving end and the second end is the sending end, then the first string to be verified is part or all of the production data sent by the second end to the first end; the second string to be verified is the target production data in the production data of the second end that corresponds to the first string to be verified. or If the first end is the sending end and the second end is the receiving end, then the first string to be verified is part or all of the production data of the first end, and the second string to be verified is the target production data in the production data sent by the first end to the second end that corresponds to the first string to be verified.

13. An electronic device, characterized in that, include: Memory, used to store program instructions; A processor is configured to invoke program instructions stored in the memory and execute the steps of the method according to any one of claims 1-6 in accordance with the obtained program instructions.

14. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, the computer program including program instructions that, when executed by a computer, cause the computer to perform the method as described in any one of claims 1-6.

15. A computer program product, characterized in that, The computer program product includes: computer program code, which, when run on a computer, causes the computer to perform the method described in any one of claims 1-6.

Images