Information table processing method, device, electronic device and computer readable medium

Abstract

The embodiments of the present disclosure disclose an information table processing method, device, electronic device and computer-readable medium. A specific implementation of the method includes: obtaining a target information table, wherein the target information table includes at least one row of cell information; performing a first hashing process on the target information table to generate a first hashed target information table; performing a hashing process on each row of cell information included in the target information table to generate hashed cell information and obtain a hashed cell information sequence; performing a mapping process on the hashed cell information sequence to generate a mapped hashed cell information sequence; and storing the first hashed target information table and the mapped hashed cell information sequence in a target database. This implementation makes it easy to detect tampering of the target information table when the user downloads or browses the target information table, thereby improving the confidentiality of the target information table.

Description

Technical Field

[0001] Embodiments of the present disclosure relate to the computer field, and in particular to an information table processing method, device, electronic device, and computer-readable medium. Background Art

[0002] At present, in order to prevent the information of some sensitive information tables within the business from being tampered with, the commonly used method is: encrypting the sensitive information table or adding a watermark to improve the confidentiality of the sensitive information table.

[0003] However, the above method usually has the following technical problems:

[0004] First, when the sensitive information table is encrypted, it is not convenient for internal personnel to browse it. On the other hand, after the encrypted sensitive information is tampered with, it is impossible to detect the tampered information.

[0005] Second, when some external personnel need to browse the sensitive information table, it is easy to cause the leakage of sensitive data in the sensitive information table, and it is impossible to determine the user who leaked the sensitive data. Summary of the invention

[0006] The content of this disclosure is used to introduce concepts in a brief form, which will be described in detail in the detailed implementation section below. The content of this disclosure is not intended to identify the key features or essential features of the technical solution claimed for protection, nor is it intended to limit the scope of the technical solution claimed for protection.

[0007] Some embodiments of the present disclosure propose information table processing methods, devices, electronic devices, and computer-readable media to solve one or more of the technical problems mentioned in the above background technology section.

[0008] In a first aspect, some embodiments of the present disclosure provide an information table processing method, the method comprising: obtaining a target information table, wherein the target information table includes at least one row of cell information; performing a first hash processing on the target information table to generate a first hash target information table; performing a hash processing on each row of cell information included in the target information table to generate hashed cell information and obtain a hashed cell information sequence; performing a mapping processing on the hashed cell information sequence to generate a mapped hashed cell information sequence; and storing the first hashed target information table and the mapped hashed cell information sequence in a target database.

[0009] In a second aspect, some embodiments of the present disclosure provide an information table processing device, the device comprising: an acquisition unit, configured to acquire a target information table, wherein the target information table comprises at least one row of cell information; a first hash unit, configured to perform a first hash process on the target information table to generate a first hash target information table; a second hash unit, configured to perform a hash process on each row of cell information included in the target information table to generate hashed cell information and obtain a hashed cell information sequence; a mapping unit, configured to perform a mapping process on the hashed cell information sequence to generate a mapped hashed cell information sequence; and a storage unit, configured to store the first hashed target information table and the mapped hashed cell information sequence in a target database.

[0010] In a third aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device on which one or more programs are stored, and when the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any implementation manner of the above-mentioned first aspect.

[0011] In a fourth aspect, some embodiments of the present disclosure provide a computer-readable medium having a computer program stored thereon, wherein when the program is executed by a processor, the method described in any implementation manner of the above-mentioned first aspect is implemented.

[0012] The above-mentioned embodiments of the present disclosure have the following beneficial effects: through the information table processing method of some embodiments of the present disclosure, it is convenient for internal personnel to browse, and when the sensitive information table is tampered with, the tampered sensitive information can be detected. Specifically, the reason why the tampered information cannot be detected is that when the sensitive information table is encrypted, it is not convenient for internal personnel to browse on the one hand, and on the other hand, after the encrypted sensitive information is tampered with, the tampered information cannot be detected. Based on this, the information table processing method of some embodiments of the present disclosure first obtains the target information table, wherein the target information table includes at least one row of cell information. Secondly, the target information table is subjected to a first hashing process to generate a first hash target information table. Thus, it is convenient to detect whether the target information table has been tampered with when the user downloads it later. Then, each row of cell information included in the target information table is subjected to a hashing process to generate hashed cell information and obtain a hashed cell information sequence. Then, the hashed cell information sequence is subjected to a mapping process to generate a mapped hashed cell information sequence. Thus, when it is detected that the target information table has been tampered with, it is convenient to detect the specific tampered information. Finally, the first hash target information table and the mapped hash cell information sequence are stored in the target database, thereby facilitating tampering detection of the target information table when the user downloads or browses the target information table, thereby improving the confidentiality of the target information table. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the accompanying drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and that components and elements are not necessarily drawn to scale.

[0014] Figure 1 is a flowchart of some embodiments of the information table processing method according to the present disclosure;

[0015] Figure 2 are flowcharts of other embodiments of the information table processing method according to the present disclosure;

[0016] Figure 3 is a schematic diagram of the structure of some embodiments of the information table processing device according to the present disclosure;

[0017] Figure 4 It is a schematic diagram of the structure of an electronic device suitable for implementing some embodiments of the present disclosure. DETAILED DESCRIPTION

[0018] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments set forth herein. On the contrary, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0019] It should also be noted that, for ease of description, only the parts related to the invention are shown in the drawings. In the absence of conflict, the embodiments and features in the embodiments of the present disclosure can be combined with each other.

[0020] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0021] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0022] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0023] The present disclosure will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

[0024] Figure 1 1 is a flowchart of some embodiments of the information table processing method according to the present disclosure. It shows a process 100 of some embodiments of the information table processing method according to the present disclosure. The information table processing method comprises the following steps:

[0025] Step 101, obtaining a target information table.

[0026] In some embodiments, the execution subject (e.g., a server or a computing device) of the information table processing method can obtain the target information table from the terminal device by wired connection or wireless connection. The target information table includes at least one row of cell information. Here, the target information table may refer to a sensitive data information table. For example, an information table containing research and development data. Here, the cell information in at least one row of cell information may include a cell field name and a field value corresponding to the cell field name.

[0027] Step 102: Perform a first hash process on the target information table to generate a first hash target information table.

[0028] In some embodiments, the execution subject may perform a first hash process on the target information table to generate a first hash target information table. Here, the first hash process may refer to performing a hash process using a digest algorithm. For example, the digest algorithm may be an MD5 algorithm.

[0029] Step 103: hash each row of cell information included in the target information table to generate hashed cell information and obtain a hashed cell information sequence.

[0030] In some embodiments, the execution subject may perform hash processing on each row of cell information included in the target information table to generate hashed cell information and obtain a hashed cell information sequence. Here, the hash processing method may refer to performing hash processing through a digest algorithm. For example, the digest algorithm may be an MD5 algorithm.

[0031] Step 104: Mapping the above hashed cell information sequence to generate a mapped hashed cell information sequence.

[0032] In some embodiments, the execution subject may map the hash cell information sequence to generate a mapped hash cell information sequence. In practice, first, the execution subject may merge the hash cell information in the hash cell information sequence to obtain merged hash cell information. Then, the merged hash cell information is input into the Bloom filter for mapping to obtain a mapped hash cell information sequence.

[0033] Step 105: store the first hash target information table and the mapped hash cell information sequence into a target database.

[0034] In some embodiments, the execution entity may store the first hash target information table and the mapped hash cell information sequence in a target database, where the target database may be a local database or a pre-set database for storing the first hash target information table and the mapped hash cell information sequence.

[0035] Optionally, in response to receiving a download request for the target information table sent by the target user terminal, a third hash process is performed on the target information table to generate a triple-hash target information table.

[0036] In some embodiments, the execution subject may perform a third hash process on the target information table in response to receiving a download request for the target information table sent by the target user terminal to generate a three-hash target information table. Here, the target user terminal may be a terminal operated by an internal business person. Here, the third hash process may refer to performing a hash process using a digest algorithm. For example, the digest algorithm may be an MD5 algorithm.

[0037] Optionally, it is determined whether the third hash target information table is consistent with the first hash target information table stored in the target database.

[0038] In some embodiments, the execution subject may determine whether the third hash target information table is consistent with the first hash target information table stored in the target database, that is, determine whether the third hash target information table is the same as the first hash target information table stored in the target database.

[0039] Optionally, in response to determining that the third hash target information table is consistent with the first hash target information table, the target information table is sent to the target user terminal.

[0040] In some embodiments, the execution subject may send the target information table to the target user terminal in response to determining that the third hash target information table is consistent with the first hash target information table.

[0041] Optionally, in response to determining that the third hash target information table is inconsistent with the first hash target information table, for each row of cell information included in the target information table, the following processing steps are performed:

[0042] In the first step, the cell information is subjected to a first target hashing process to generate first target hashed cell information. Here, the first target hashing process may refer to a hashing process performed by a digest algorithm. For example, the digest algorithm may be an MD5 algorithm.

[0043] The second step is to determine whether there is mapping hash cell information identical to the first target hash cell information in the mapping hash cell information sequence stored in the target database.

[0044] In a third step, in response to determining that there is no mapped hash cell information identical to the first target hash cell information in the mapped hash cell information sequence stored in the target database, the cell information is marked as abnormal cell information.

[0045] Optionally, the information of each marked abnormal cell is sent to an associated alarm terminal for alarm processing.

[0046] In some embodiments, the execution subject may send the marked abnormal cell information to an associated alarm terminal for alarm processing. Here, the associated alarm terminal may refer to an alarm device that is communicatively connected to the execution subject, and the alarm processing may refer to displaying a warning text indicating that the information has been tampered with or issuing a prompt tone indicating that the information has been tampered with.

[0047] Therefore, when each internal staff browses / downloads the target information table, the target information table can be tampered with and the tampered information can be detected in time.

[0048] The above-mentioned embodiments of the present disclosure have the following beneficial effects: through the information table processing method of some embodiments of the present disclosure, it is convenient for internal personnel to browse, and when the sensitive information table is tampered with, the tampered sensitive information can be detected. Specifically, the reason why the tampered information cannot be detected is that when the sensitive information table is encrypted, it is not convenient for internal personnel to browse on the one hand, and on the other hand, after the encrypted sensitive information is tampered with, the tampered information cannot be detected. Based on this, the information table processing method of some embodiments of the present disclosure first obtains the target information table, wherein the target information table includes at least one row of cell information. Secondly, the target information table is subjected to a first hashing process to generate a first hash target information table. Thus, it is convenient to detect whether the target information table has been tampered with when the user downloads it later. Then, each row of cell information included in the target information table is subjected to a hashing process to generate hashed cell information and obtain a hashed cell information sequence. Then, the hashed cell information sequence is subjected to a mapping process to generate a mapped hashed cell information sequence. Thus, when it is detected that the target information table has been tampered with, it is convenient to detect the specific tampered information. Finally, the first hash target information table and the mapped hash cell information sequence are stored in the target database, thereby facilitating tampering detection of the target information table when the user downloads or browses the target information table, thereby improving the confidentiality of the target information table.

[0049] Further references Figure 2 , showing some other embodiments of the information table processing method according to the present disclosure. The information table processing method comprises the following steps:

[0050] Step 201, obtaining a target information table.

[0051] Step 202: Perform a first hash process on the target information table to generate a first hash target information table.

[0052] Step 203: hash each row of cell information included in the target information table to generate hashed cell information and obtain a hashed cell information sequence.

[0053] Step 204: Mapping the above hashed cell information sequence to generate a mapped hashed cell information sequence.

[0054] Step 205: store the first hash target information table and the mapped hash cell information sequence into a target database.

[0055] In some embodiments, the specific implementation of steps 201-205 and the technical effects brought about can be referred to Figure 1 The corresponding steps 101-105 in the embodiments are not described in detail here.

[0056] Step 206, in response to receiving a download request for the above-mentioned target information table sent by the client, perform a second hashing process on the above-mentioned target information table to generate a second hashed target information table.

[0057] In some embodiments, the execution entity (e.g., a server or a computing device) of the information table processing method may, in response to receiving a download request for the above-mentioned target information table sent by the client, perform a second hashing process on the above-mentioned target information table to generate a second hashed target information table. Here, the client may refer to a computing device controlled by an external person. Here, the manner of the second hashing process may refer to performing a hashing process through a digest algorithm. For example, the digest algorithm may be the MD5 algorithm.

[0058] Step 207, determine whether the above-mentioned second hashed target information table is consistent with the first hashed target information table stored in the above-mentioned target database.

[0059] In some embodiments, the above-mentioned execution entity may determine whether the above-mentioned second hashed target information table is consistent with the first hashed target information table stored in the above-mentioned target database. That is, determine whether the content of the above-mentioned second hashed target information table is the same as the content of the first hashed target information table stored in the above-mentioned target database.

[0060] Step 208, in response to determining that the above-mentioned second hashed target information table is consistent with the above-mentioned first hashed target information table, perform a watermark rendering process on the above-mentioned target information table to generate a watermarked target information table.

[0061] In some embodiments, the above-mentioned execution entity may, in response to determining that the above-mentioned second hashed target information table is consistent with the above-mentioned first hashed target information table, perform a watermark rendering process on the above-mentioned target information table to generate a watermarked target information table.

[0062] In practice, the above-mentioned execution entity may perform a watermark rendering process on the above-mentioned target information table through the following steps to generate a watermarked target information table:

[0063] First step, perform an encoding process on the domain name corresponding to the above-mentioned client to generate an encoded domain name. Here, the encoding process may refer to an international standard encoding. For example, the supply-side domain name may be [Bai Xiang], and perform an international standard encoding process on the supply-side domain name [Bai Xiang] to generate an encoded supply-side domain name [b'\xb0\xd9\xcf\xe3'].

[0064] Second step, perform a radix process on the above-mentioned encoded domain name to generate a radix digital sequence. Here, the radix process may refer to a decimal process.

[0065] The third step is to combine the digits in the above digit sequence to generate a digital watermark. For example, the digit sequence may be [12, 24, 21], and [12, 24, 21] is combined to obtain a digital watermark "122421".

[0066] In a fourth step, the number of cell information included in the at least one row of cell information is determined as the number of cell information.

[0067] Step 5: In response to the number of numerical values ​​included in the digital watermark being equal to the number of cell information, for each cell information in the target information table, the last character of the field value included in the cell information is replaced with the target numerical value. The numerical sequence number corresponding to the target numerical value in the digital watermark is the same as the sequence number of the cell information in the target information table. For example, the last character "3" of the field value "253" included in the first cell information in the target information table can be replaced with the first numerical character "1" in the digital watermark "122421".

[0068] Step 6: determine the replaced target information table as the watermark target information table.

[0069] Optionally, in response to the number of numerical values ​​included in the digital watermark being less than the number of cell information, the sum of the numerical values ​​included in the digital watermark is determined as the marking digital watermark.

[0070] In some embodiments, the execution entity may determine the sum of the values ​​included in the digital watermark as the marking digital watermark in response to the number of values ​​included in the digital watermark being less than the number of cell information.

[0071] Optionally, for each cell information in the above target information table, perform the following watermark rendering steps:

[0072] The first step is to determine whether the serial number corresponding to the cell information is greater than the target number. The target number is the number of values ​​included in the digital watermark. In practice, it can be determined whether the value of the serial number of the cell information in the target information table is greater than the target number.

[0073] In the second step, in response to determining that the serial number corresponding to the cell information is less than or equal to the target number, the last character of the field value included in the cell information is replaced with the numerical value corresponding to the cell information in the digital watermark. Here, the numerical value corresponding to the cell information in the digital watermark may refer to a numerical character whose serial number corresponding to the numerical character in the digital watermark is the same as the serial number of the cell information in the target information table.

[0074] The third step is to determine, in response to determining that the sequence number corresponding to the above cell information is greater than the above target number, whether the above cell information is the last cell information in the above target information table.

[0075] The fourth step is to replace the field value included in the cell information with the marked digital watermark in response to determining that the cell information is the last cell information in the target information table.

[0076] Optionally, in response to the number of numerical values ​​included in the above-mentioned digital watermark being greater than the above-mentioned cell information number, for the above-mentioned target information table, the following watermark rendering steps are performed: the last character of the field value included in the first cell information included in the above-mentioned target information table is replaced with the above-mentioned target number; the field value included in the last cell information included in the above-mentioned target information table is replaced with the above-mentioned mark digital watermark.

[0077] In some embodiments, the execution subject may, in response to the number of values ​​included in the digital watermark being greater than the number of cell information, perform the following watermark rendering steps for the target information table:

[0078] The first step is to replace the last character of the field value included in the first cell information included in the above target information table with the above target quantity.

[0079] The second step is to replace the field value included in the last cell information included in the target information table with the above-mentioned marking digital watermark.

[0080] The related contents in step 208 and optionally in the method are an inventive point of the present disclosure, thereby solving the technical problem 2 mentioned in the background technology, "When some external personnel need to browse the sensitive information table, it is easy to cause the leakage of sensitive data in the sensitive information table, and the user who leaked the sensitive data cannot be determined." The factors that cannot determine the user who leaked the sensitive data are often as follows: When some external personnel need to browse the sensitive information table, it is easy to cause the leakage of sensitive data in the sensitive information table, and the user who leaked the sensitive data cannot be determined. If the above factors are solved, the effect of tracking the user who leaked the sensitive data can be achieved. In order to achieve this effect, first, the domain name corresponding to the above user terminal is encoded to generate an encoded domain name. Thus, the uniqueness of the domain name can be used to ensure the uniqueness of the set digital watermark, which is convenient for subsequent tracking of the user who leaked the sensitive data. Secondly, the above encoded domain name is processed by base to generate a base digital sequence. Then, the base digitals included in the above base digital sequence are merged to generate a digital watermark. Thus, it is convenient to use the concealment and traceability of the digital watermark to quickly track the user who leaked the sensitive data. Then, the number of cell information included in the above at least one row of cell information is determined as the number of cell information. Thus, it is convenient to determine the watermark value to be replaced for each cell information. Then, in response to the number of values ​​included in the digital watermark being equal to the number of cell information, for each cell information in the target information table, the last character of the field value included in the cell information is replaced with the target value. Among them, the numerical sequence number corresponding to the target value in the digital watermark is the same as the sequence number of the cell information in the target information table. Thus, the digital watermark can be added to the target information table in sequence, which is convenient for subsequent detection and tracking. Finally, the target information table after replacement is determined as the watermark target information table. Thus, when the target information table is sent to an outsider for browsing, the added data watermark can be used to determine whether the target information table has been leaked by an outsider.

[0081] Step 209: Send the watermark target information table to the user terminal.

[0082] In some embodiments, the execution entity may send the watermark target information table to the user terminal.

[0083] Optionally, in response to determining that the second hash target information table is inconsistent with the first hash target information table, for each row of cell information included in the target information table, the following processing steps are performed: target hash processing is performed on the cell information to generate target hash cell information; it is determined whether there is mapped hash cell information identical to the target hash cell information in a mapped hash cell information sequence stored in the target database; in response to determining that there is no mapped hash cell information identical to the target hash cell information in the mapped hash cell information sequence stored in the target database, marking the cell information as abnormal cell information.

[0084] In some embodiments, in response to determining that the second hash target information table is inconsistent with the first hash target information table, the execution subject may perform the following processing steps for each row of cell information included in the target information table:

[0085] In the first step, the target hash processing is performed on the cell information to generate target hash cell information. Here, the target hash processing method may refer to hash processing through a digest algorithm. For example, the digest algorithm may be an MD5 algorithm.

[0086] The second step is to determine whether there is mapping hash cell information identical to the target hash cell information in the mapping hash cell information sequence stored in the target database.

[0087] In a third step, in response to determining that there is no mapped hash cell information identical to the target hash cell information in the mapped hash cell information sequence stored in the target database, the cell information is marked as abnormal cell information.

[0088] Optionally, information indicating that the target information table is abnormal is generated, and the information indicating that the target information table is abnormal is sent to the user terminal.

[0089] In some embodiments, the execution subject may generate information indicating that the target information table is abnormal, and send the information indicating that the target information table is abnormal to the user terminal. Here, the information indicating that the target information table is abnormal may refer to information in the target information table being tampered with.

[0090] Optionally, in response to receiving a re-download request corresponding to the information characterizing the abnormality of the target information table sent by the above-mentioned user terminal, the marked target information table is watermark rendered to generate a marked watermark target information table, and the marked watermark target information table is sent to the above-mentioned user terminal.

[0091] In some embodiments, the execution subject may, in response to receiving a re-download request sent by the user terminal corresponding to the information indicating the abnormality of the target information table, perform watermark rendering processing on the marked target information table to generate a marked watermark target information table, and send the marked watermark target information table to the user terminal. Here, the watermark rendering processing on the marked target information table can be specifically referred to the implementation method of the watermark rendering processing in step 208, which will not be repeated here.

[0092] from Figure 2 It can be seen that Figure 1 Compared with the description of some corresponding embodiments, Figure 2 In some corresponding embodiments, the process 200 can add digital watermarks to the target information table in order to facilitate subsequent detection and tracking. Therefore, when the target information table is sent to an outsider for browsing, the added data watermark can be used to determine whether the target information table has been leaked by the outsider.

[0093] Further references Figure 3 As an implementation of the methods shown in the above figures, the present disclosure provides some embodiments of an information table processing system. These system embodiments are Figure 1 Corresponding to the method embodiments shown, the system can be specifically applied to various electronic devices.

[0094] like Figure 3 As shown, the information table processing device 300 of some embodiments includes: an acquisition unit 301, a first hash unit 302, a second hash unit 303, a mapping unit 304 and a storage unit 305. The acquisition unit 301 is configured to acquire a target information table, wherein the target information table includes at least one row of cell information; the first hash unit 302 is configured to perform a first hash process on the target information table to generate a first hash target information table; the second hash unit 303 is configured to perform a hash process on each row of cell information included in the target information table to generate hash cell information and obtain a hash cell information sequence; the mapping unit 304 is configured to perform a mapping process on the hash cell information sequence to generate a mapped hash cell information sequence; the storage unit 305 is configured to store the first hash target information table and the mapped hash cell information sequence in the target database.

[0095] It is understood that the units described in the device 300 are similar to those described in the reference Figure 1 Therefore, the operations, features and beneficial effects described above for the method are also applicable to the device 300 and the units contained therein, and will not be described in detail here.

[0096] Reference below Figure 4 , which shows a schematic diagram of the structure of an electronic device 400 suitable for implementing some embodiments of the present disclosure. The electronic devices in some embodiments of the present disclosure may include but are not limited to mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 4 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0097] like Figure 4 As shown, the electronic device 400 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 401, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 402 or a program loaded from a storage device 408 into a random access memory (RAM) 403. In the RAM 403, various programs and data required for the operation of the electronic device 400 are also stored. The processing device 401, the ROM 402, and the RAM 403 are connected to each other via a bus 404. An input / output (I / O) interface 405 is also connected to the bus 404.

[0098] Typically, the following devices may be connected to the I / O interface 405: an input device 406 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 407 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 408 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 409. The communication device 409 may allow the electronic device 400 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 4 The electronic device 400 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead. Figure 4 Each block shown in the figure may represent one device, or may represent multiple devices as required.

[0099] In particular, according to some embodiments of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, some embodiments of the present disclosure include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In some such embodiments, the computer program can be downloaded and installed from the network through the communication device 409, or installed from the storage device 408, or installed from the ROM402. When the computer program is executed by the processing device 401, the above-mentioned functions defined in the method of some embodiments of the present disclosure are executed.

[0100] It should be noted that the computer-readable medium recorded in some embodiments of the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In some embodiments of the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In some embodiments of the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer readable signal medium may also be any computer readable medium other than a computer readable storage medium, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer readable medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0101] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0102] The computer-readable medium may be included in the electronic device; or it may exist independently without being installed in the electronic device. The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: obtains a target information table, wherein the target information table includes at least one row of cell information; performs a first hashing process on the target information table to generate a first hashed target information table; performs a hashing process on each row of cell information included in the target information table to generate hashed cell information and obtain a hashed cell information sequence; performs a mapping process on the hashed cell information sequence to generate a mapped hashed cell information sequence; and stores the first hashed target information table and the mapped hashed cell information sequence in a target database.

[0103] Computer program code for performing the operations of some embodiments of the present disclosure may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0104] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0105] The units described in some embodiments of the present disclosure may be implemented by software or hardware. The units described may also be provided in a processor, for example, may be described as: a processor including an acquisition unit, a first hash unit, a second hash unit, a mapping unit, and a storage unit. The names of these units do not constitute limitations on the units themselves in certain circumstances, for example, a storage unit may also be described as "a unit for storing the above-mentioned first hash target information table and the above-mentioned mapping hash cell information sequence in a target database".

[0106] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0107] The above descriptions are only some preferred embodiments of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the embodiments of the present disclosure is not limited to the technical solutions formed by a specific combination of the above-mentioned technical features, but should also cover other technical solutions formed by any combination of the above-mentioned technical features or their equivalent features without departing from the above-mentioned inventive concept. For example, the above-mentioned features are replaced with the technical features with similar functions disclosed in the embodiments of the present disclosure (but not limited to) and the technical solutions formed.

Claims

1. A method for processing an information table, comprising: Obtaining a target information table, wherein the target information table includes at least one row of cell information; Performing a first hash process on the target information table to generate a first hash target information table; Performing hash processing on each row of cell information included in the target information table to generate hashed cell information and obtain a hashed cell information sequence; Performing mapping processing on the hashed cell information sequence to generate a mapped hashed cell information sequence; storing the first hash target information table and the mapped hash cell information sequence in a target database; In response to receiving a download request for the target information table sent by the user terminal, performing a second hash process on the target information table to generate a second hash target information table; determining whether the second hash target information table is consistent with the first hash target information table stored in the target database; In response to determining that the second hash target information table is consistent with the first hash target information table, performing watermark rendering processing on the target information table to generate a watermark target information table; Sending the watermark target information table to the user terminal; In response to determining that the second hash target information table is inconsistent with the first hash target information table, for each row of cell information included in the target information table, performing the following processing steps: Performing target hash processing on the cell information to generate target hash cell information; Determine whether there is mapped hash cell information identical to the target hash cell information in the mapped hash cell information sequence stored in the target database; In response to determining that there is no mapped hash cell information identical to the target hash cell information in the mapped hash cell information sequence stored in the target database, marking the cell information as abnormal cell information; Generate information indicating that the target information table is abnormal, and send the information indicating that the target information table is abnormal to the user terminal; In response to receiving a re-download request sent by the user terminal corresponding to the information characterizing the abnormality of the target information table, watermark rendering is performed on the marked target information table to generate a marked watermark target information table, and the marked watermark target information table is sent to the user terminal.

2. The method according to claim 1, wherein: The method further comprises: The information of each marked abnormal cell is sent to the associated alarm terminal for alarm processing.

3. An information table processing device, applied to the method according to claim 1, comprising: an acquisition unit, configured to acquire a target information table, wherein the target information table includes at least one row of cell information; a first hash unit configured to perform a first hash process on the target information table to generate a first hash target information table; A second hash unit is configured to perform hash processing on each row of cell information included in the target information table to generate hashed cell information and obtain a hashed cell information sequence; a mapping unit configured to perform mapping processing on the hash cell information sequence to generate a mapped hash cell information sequence; The storage unit is configured to store the first hash target information table and the mapped hash cell information sequence in a target database.

4. An electronic device comprising: one or more processors; a storage device having one or more programs stored thereon; When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1-2.

5. A computer readable medium having a computer program stored thereon, wherein: When the program is executed by a processor, the method according to any one of claims 1 to 2 is implemented.

Images