CN117544294A - Data processing method and device - Google Patents

Data processing method and device Download PDF

Info

Publication number
CN117544294A
CN117544294A CN202210914633.8A CN202210914633A CN117544294A CN 117544294 A CN117544294 A CN 117544294A CN 202210914633 A CN202210914633 A CN 202210914633A CN 117544294 A CN117544294 A CN 117544294A
Authority
CN
China
Prior art keywords
data
node information
verification
request instruction
user
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210914633.8A
Other languages
Chinese (zh)
Inventor
王迪
舒懿杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Xiaomi Mobile Software Co Ltd
Original Assignee
Beijing Xiaomi Mobile Software Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Xiaomi Mobile Software Co Ltd filed Critical Beijing Xiaomi Mobile Software Co Ltd
Priority to CN202210914633.8A priority Critical patent/CN117544294A/en
Publication of CN117544294A publication Critical patent/CN117544294A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
    • H04L9/083—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) involving central third party, e.g. key distribution center [KDC] or trusted third party [TTP]
    • H04L9/0833—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) involving central third party, e.g. key distribution center [KDC] or trusted third party [TTP] involving conference or group key
    • H04L9/0836—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) involving central third party, e.g. key distribution center [KDC] or trusted third party [TTP] involving conference or group key using tree structure or hierarchical structure

Abstract

The present disclosure relates to a data processing method and a device thereof, and relates to the technical field of information security, wherein the data request instruction sent by a client is received, and the data request instruction comprises user identification information and user password data corresponding to a target user; based on the user identification information, acquiring related nodes in a hash binary tree corresponding to a target user in a database and first node information corresponding to the related nodes; transmitting the first node information and the data request instruction to the encryption machine so that the encryption machine verifies the user password data in the first node information and the data request instruction and obtains a verification result; and receiving a verification result sent by the encryptor, responding to the verification result to indicate that the first node information and the user password data pass verification, receiving target data returned by the encryptor, and sending the target data to the client. The method solves the problem that the encryption machine cannot store massive user data, and simultaneously ensures that the data stored outside cannot be tampered.

Description

Data processing method and device
Technical Field
The disclosure relates to the technical field of information security, and in particular relates to a data processing method and a device thereof.
Background
With the rapid development of information technology and the rapid rise of digital economy, massive data needs to be interacted through a network to finish applications such as web browsing, commodity transaction and the like, data security needs to be protected, a main stream encryption machine has hardware resource limitation generally, related information of massive users cannot be stored in the encryption machine, and application scenes are limited greatly.
Disclosure of Invention
The disclosure provides a data processing method and a device thereof, which at least solve the problem that related information of massive users cannot be stored in an encryption machine, and the application scene is greatly limited. The technical scheme of the present disclosure is as follows:
according to a first aspect of an embodiment of the present disclosure, there is provided a data processing method, applied to a server, including: receiving a data request instruction sent by a client, wherein the data request instruction comprises user identification information and user password data corresponding to a target user; based on the user identification information, acquiring related nodes in a hash binary tree corresponding to a target user in a database and first node information corresponding to the related nodes; transmitting the first node information and the data request instruction to the encryption machine so that the encryption machine verifies the user password data in the first node information and the data request instruction and obtains a verification result; and receiving a verification result sent by the encryptor, responding to the verification result to indicate that the first node information and the user password data pass verification, receiving target data returned by the encryptor based on the data request instruction, and sending the target data to the client.
The method and the device store the encrypted information of the user into the hash binary tree of the database instead of directly storing the encrypted information in the encryptor, and any modification to the node information in the database can cause the hash value of the root node of the hash binary tree to change, so that the hash value cannot be matched with the hash value of the correct root node stored in the encryptor, the problems that the encryptor has limited resources and cannot store massive user data inside are solved, and meanwhile, the data stored outside cannot be tampered.
In some embodiments, after indicating that both the first node information and the user password data are authenticated in response to the authentication result, further comprising: receiving second node information corresponding to the related node returned by the encryptor; based on the second node information, updating first node information of related nodes in a hash binary tree in the database.
In some embodiments, the data processing method further comprises: and sending a first node information verification failure indication to the client in response to the verification result indicating that the first node information fails verification.
In some embodiments, the data processing method further comprises: responding to the verification result to indicate that the user password data fails to pass the verification, sending an indication that the user password data fails to pass the verification to the client, and receiving third node information corresponding to the relevant node returned by the encryption machine; and updating the first node information of the relevant nodes in the hash binary tree in the database based on the third node information.
According to a second aspect of the embodiments of the present disclosure, there is provided a data processing method, applied to an encryption machine, including: receiving first node information and a data request instruction sent by a server; verifying the user password data in the first node information and the data request instruction, acquiring a verification result, and sending the verification result to the server; and responding to the verification result to indicate that the first node information and the user password data are both verified, acquiring target data based on the data request instruction, and sending the target data to the server.
In some embodiments, verifying the user password data in the first node information and the data request instruction and obtaining a verification result includes: judging whether the hash value of the first root node stored in the encryption machine is identical to the hash value of the corresponding second root node in the first node information; responding to the judgment result to indicate that the hash value of the first root node is different from the hash value of the second root node, and determining that the verification result is that the first node information fails verification; responding to the judgment result to indicate that the hash value of the first root node is the same as that of the second root node, and checking whether the user password data in the data request instruction are correct or not; responding to the correctness of the user password data, and determining that the verification result is that the first node information and the user password data pass verification; and in response to the user password data being incorrect, determining that the user password data is not verified as a verification result.
In some embodiments, after determining that the authentication result is that both the first node information and the user password data pass authentication, further comprising: updating the time stamp in the target leaf node information corresponding to the target user, and setting the number of times of retrying the password error to be zero; updating information of other related nodes based on the updated target leaf node information, acquiring second node information corresponding to the related nodes, sending the second node information to a server, and replacing the first root node hash value in the encryption machine based on a third root node hash value contained in the second node information.
In some embodiments, after determining that the authentication result is that the user password data is not authenticated, further comprising: updating the time stamp in the target leaf node information corresponding to the target user; updating information of other related nodes based on the updated target leaf node information, acquiring third node information corresponding to the related nodes, sending the third node information to a server, and replacing the first root node hash value in the encryption machine based on a fourth root node hash value contained in the third node information.
In some embodiments, increasing the number of password error retries when updating the timestamp in the target leaf node information corresponding to the target user; and in response to the password error repetition number reaching the error number threshold value in the first set time period, sending a verification prohibition instruction for instructing verification prohibition in the second set time period to the server.
According to a third aspect of embodiments of the present disclosure, there is provided a data processing method, applied to a client, including: sending a data request instruction to a server; and receiving target data returned by the service end based on the data request instruction.
In some embodiments, the data processing method further comprises: and in response to receiving the verification failing indication returned by the server based on the data request instruction, displaying a verification failing alarm indication on the client, wherein the verification failing indication comprises a first node information verification failing indication and a user password data verification failing indication.
In some embodiments, the data request instruction includes user password data and user identification information of the target user.
According to a fourth aspect of embodiments of the present disclosure, there is provided a data processing apparatus, applied to a server, including: the receiving module is used for receiving a data request instruction sent by the client, wherein the data request instruction comprises user identification information and user password data corresponding to a target user; the acquisition module is used for acquiring related nodes in the hash binary tree corresponding to the target user in the database and first node information corresponding to the related nodes based on the user identification information; the sending module is used for sending the first node information and the data request instruction to the encryption machine so that the encryption machine verifies the user password data in the first node information and the data request instruction and obtains a verification result; and the response module is used for receiving the verification result sent by the encryptor, responding to the verification result to indicate that the first node information and the user password data pass verification, receiving target data returned by the encryptor based on the data request instruction, and sending the target data to the client.
In some embodiments, the response module is further to: after indicating that both the first node information and the user password data are authenticated in response to the authentication result, further comprising: receiving second node information corresponding to the related node returned by the encryptor; based on the second node information, updating first node information of related nodes in a hash binary tree in the database.
In some embodiments, the response module is further to: and sending a first node information verification failure indication to the client in response to the verification result indicating that the first node information fails verification.
In some embodiments, the response module is further to: responding to the verification result to indicate that the user password data fails to pass the verification, sending an indication that the user password data fails to pass the verification to the client, and receiving third node information corresponding to the relevant node returned by the encryption machine; and updating the first node information of the relevant nodes in the hash binary tree in the database based on the third node information.
According to a fifth aspect of embodiments of the present disclosure, there is provided a data processing apparatus, applied to an encryption machine, including: the instruction receiving module is used for receiving the first node information and the data request instruction sent by the server; the data verification module is used for verifying the user password data in the first node information and the data request instruction and obtaining a verification result; and the verification response module is used for responding to the verification result to indicate that the first node information and the user password data pass verification, acquiring target data based on the data request instruction and sending the target data to the server.
In some embodiments, the data verification module is further to: verifying the user password data in the first node information and the data request instruction and obtaining a verification result, wherein the method comprises the following steps: judging whether the hash value of the first root node stored in the encryption machine is identical to the hash value of the corresponding second root node in the first node information; responding to the judgment result to indicate that the hash value of the first root node is different from the hash value of the second root node, and determining that the verification result is that the first node information fails verification; responding to the judgment result to indicate that the hash value of the first root node is the same as that of the second root node, and checking whether the user password data in the data request instruction are correct or not; responding to the correctness of the user password data, and determining that the verification result is that the first node information and the user password data pass verification; and in response to the user password data being incorrect, determining that the user password data is not verified as a verification result.
In some embodiments, the authentication response module is further to: after determining that the verification result is that both the first node information and the user password data pass verification, the method further comprises the following steps: updating the time stamp in the target leaf node information corresponding to the target user, and setting the number of times of retrying the password error to be zero; updating information of other related nodes based on the updated target leaf node information, acquiring second node information corresponding to the related nodes, sending the second node information to a server, and replacing the first root node hash value in the encryption machine based on a third root node hash value contained in the second node information.
In some embodiments, the authentication response module is further to: after determining that the user password data is not authenticated as a result of the authentication, the method further comprises: updating the time stamp in the target leaf node information corresponding to the target user; updating information of other related nodes based on the updated target leaf node information, acquiring third node information corresponding to the related nodes, sending the third node information to a server, and replacing the first root node hash value in the encryption machine based on a fourth root node hash value contained in the third node information.
In some embodiments, the authentication response module is further to: when the time stamp in the target leaf node information corresponding to the target user is updated, increasing the number of times of retrying the password error; and in response to the password error repetition number reaching the error number threshold value in the first set time period, sending a verification prohibition instruction for instructing verification prohibition in the second set time period to the server.
According to a sixth aspect of embodiments of the present disclosure, there is provided a data processing apparatus, applied to a client, including: the instruction sending module is used for sending a data request instruction to the server; the data receiving module is used for receiving target data returned by the service end based on the data request instruction.
In some embodiments, the data receiving module is further configured to: and in response to receiving the verification failing indication returned by the server based on the data request instruction, displaying a verification failing alarm indication on the client, wherein the verification failing indication comprises a first node information verification failing indication and a user password data verification failing indication.
In some embodiments, the data request instruction sent in the instruction sending module includes user password data and user identification information of the target user.
According to a seventh aspect of embodiments of the present disclosure, there is provided an electronic device, comprising: a processor; a memory for storing executable instructions of the processor; wherein the processor is configured to execute instructions to implement the data processing apparatus as in the fourth or fifth or sixth aspect of the embodiments of the present disclosure.
According to an eighth aspect of embodiments of the present disclosure, there is provided a computer readable storage medium, which when executed by a processor of an electronic device, causes the electronic device to perform the data processing apparatus as the fourth or fifth or sixth aspect of embodiments of the present disclosure.
According to a ninth aspect of embodiments of the present disclosure, there is provided a computer program product comprising a computer program/instruction, characterized in that the computer program/instruction, when executed by a processor, implements a data processing apparatus as in the fourth or fifth or sixth aspect of embodiments of the present disclosure.
The technical scheme provided by the embodiment of the disclosure at least brings the following beneficial effects:
the method and the device store the encrypted information of the user into the hash binary tree of the database instead of directly storing the encrypted information in the encryptor, and any modification to the node information in the database can cause the hash value of the root node of the hash binary tree to change, so that the hash value cannot be matched with the hash value of the correct root node stored in the encryptor, the problems that the encryptor has limited resources and cannot store massive user data inside are solved, and meanwhile, the data stored outside cannot be tampered.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure and do not constitute an undue limitation on the disclosure.
FIG. 1 is a schematic diagram of a data processing system, according to an example embodiment.
Fig. 2 is a schematic diagram of a data processing method at a server according to an exemplary embodiment.
Fig. 3 is a schematic diagram illustrating a portion of nodes of a hash binary tree according to an example embodiment.
Fig. 4 is a schematic diagram of a data processing method in an encryptor according to an exemplary embodiment.
Fig. 5 is a schematic diagram of a data processing method in an encryptor according to an exemplary embodiment.
Fig. 6 is a schematic diagram of a data processing method at a client according to an exemplary embodiment.
Fig. 7 is a general flow diagram illustrating a method of data processing according to an exemplary embodiment.
Fig. 8 is a schematic diagram illustrating a data processing apparatus applied to a server according to an exemplary embodiment.
Fig. 9 is a schematic diagram showing a data processing apparatus applied to an encryption machine according to an exemplary embodiment.
Fig. 10 is a schematic diagram showing a data processing apparatus applied to a client according to an exemplary embodiment.
Fig. 11 is a block diagram of an electronic device, according to an example embodiment.
Detailed Description
In order to enable those skilled in the art to better understand the technical solutions of the present disclosure, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the foregoing figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the disclosure described herein may be capable of operation in sequences other than those illustrated or described herein. The implementations described in the following exemplary examples are not representative of all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present disclosure as detailed in the accompanying claims.
FIG. 1 is a schematic diagram of a data processing system according to the present disclosure, as shown in FIG. 1, where the data processing system according to the present disclosure includes a client, a server, an encryptor, and a database, and a wireless connection may be used between the client and the server. Optionally, the client may establish communication connection with the server by using a WIFI, bluetooth, infrared, or other communication method, or the client may establish communication connection with the server through a mobile network. The network system of the mobile network may be any one of 2G (GSM), 2.5G (GPRS), 3G (WCDMA, TD-SCDMA, CDMA2000, UTMS), 4G (LTE), 4g+ (lte+), wiMax, etc.
In the present disclosure, the type of the client is not limited, and the client includes, but is not limited to, any one of the following: personal computers, notebook computers, tablet computers, cell phones, smart bracelets, smart televisions and smart speakers.
In the present disclosure, the implementation form of the server is not limited. For example, the server may be a conventional server, a cloud host, a virtual center, or other server device. The server side mainly comprises a processor, a hard disk, a memory, a system bus and the like and a general computer architecture type.
The data processing method corresponding to the data processing system is respectively introduced from the three sides of the server, the encryptor and the client.
Fig. 2 is an exemplary embodiment of a data processing method according to the present disclosure, where an execution body is a server, and as shown in fig. 2, the data processing method includes the following steps:
s201, receiving a data request instruction sent by a client, wherein the data request instruction comprises user identification information and user password data corresponding to a target user.
The server receives a data request instruction sent by the client, wherein the data request instruction comprises user identification information and user password data corresponding to a target user, and the user request instruction is used for requesting encrypted data corresponding to the target user, such as an encrypted identity card number or an encrypted file. The user identification information may be an ID code of a user, each user corresponds to one user identification information, and the user password data may be a login password set by the user.
S202, based on user identification information, related nodes in a hash binary tree corresponding to a target user in a database and first node information corresponding to the related nodes are obtained.
In the disclosure, 1 encryption machine correspondingly generates 1 hash binary Tree, after the encryption machine generates the hash binary Tree based on the modified version Merkle Tree algorithm, the hash binary Tree is stored in a database, and only the root hash value of the hash binary Tree is reserved in the encryption machine.
Fig. 3 is a schematic diagram of a part of nodes of a hash binary tree according to the present disclosure, as shown in fig. 3, taking an example that each parent node has 16 child nodes, the hash binary tree layer height is 17, and each hash binary tree contains 2 64 Compared with a common hash binary tree, the hash binary tree provided by the invention is flatter, and the operation times of circularly updating the hash value on the related node when the leaf node data is updated each time are reduced.
In the non-leaf nodes in the hash binary tree provided by the disclosure, the current node coordinates, the current node hash value and the hash value array of 16 child nodes corresponding to the current node are stored, wherein the hash value of each non-leaf node is calculated by the hash values of all the child nodes of the non-leaf node.
In the leaf nodes in the hash binary tree provided by the disclosure, the number of code retries of the target user corresponding to the current node in a set period, the timestamp of the last operation of the target user and other data corresponding to the target user are stored. The other data corresponding to the target user may include a user data password of the target user logging in the server, and some data or files encrypted by the target user, such as an identification card number, a mobile phone number, and the like. Wherein each target user corresponds to 1 leaf node.
The hash value stored by the root node in the hash binary tree provided by the disclosure represents the hash value of the data contained by all leaf nodes of the whole hash binary tree, any one leaf node data is changed, the change is transmitted to the root node through a unique upward path, and all the nodes in the middle and the hash value of the root node are changed.
The server determines a hash binary tree where a target leaf node corresponding to the target user is located according to user identification information corresponding to the target user contained in the data request instruction, and invokes relevant nodes in the hash binary tree corresponding to the target user and node information corresponding to the relevant nodes from a database to serve as first node information, wherein the relevant nodes refer to all nodes on a path from the leaf node to a root node of the target user.
S203, the first node information and the data request instruction are sent to the encryption machine, so that the encryption machine verifies the user password data in the first node information and the data request instruction and obtains a verification result.
And sending the first node information and the data request instruction to the encryption machine so that the encryption machine verifies the user password data in the first node information and the data request instruction, wherein the encryption machine can generate a verification result after verifying the user password data in the first node information and the data request instruction.
The encryptor provided by the disclosure can be a hierarchical key management encryptor (Hardware Secure Module, HSM), wherein the HSM is an encryptor provided by a third party manufacturer authenticated by a professional institution and is used for a server to store a key safely and complete security operations such as encryption and decryption.
S204, receiving a verification result sent by the encryptor, responding to the verification result to indicate that the first node information and the user password data pass verification, receiving target data returned by the encryptor based on the data request instruction, and sending the target data to the client.
And receiving a verification result sent by the encryptor, and if the verification result indicates that the first node information and the user password data pass verification, receiving target data returned by the encryptor based on the data request instruction and sending the target data to the client.
According to the data processing method provided by the embodiment of the disclosure, a data request instruction sent by a client is received, wherein the data request instruction comprises user identification information and user password data corresponding to a target user; based on the user identification information, acquiring related nodes in a hash binary tree corresponding to a target user in a database and first node information corresponding to the related nodes; transmitting the first node information and the data request instruction to the encryption machine so that the encryption machine verifies the user password data in the first node information and the data request instruction and obtains a verification result; and receiving a verification result sent by the encryptor, responding to the verification result to indicate that the first node information and the user password data pass verification, receiving target data returned by the encryptor based on the data request instruction, and sending the target data to the client. The method and the device store the encrypted information of the user into the hash binary tree of the database instead of directly storing the encrypted information in the encryptor, and any modification to the node information in the database can cause the hash value of the root node of the hash binary tree to change, so that the hash value cannot be matched with the hash value of the correct root node stored in the encryptor, the problems that the encryptor has limited resources and cannot store massive user data inside are solved, and meanwhile, the data stored outside cannot be tampered.
Further, if the verification result indicates that the first node information and the user password data pass verification, the server side also needs to receive second node information corresponding to the relevant node returned by the encryptor, and update the first node information of the relevant node in the hash binary tree in the database based on the second node information. The second node information is generated after the encryption machine updates the first node information of the related node after the first node information and the user password data pass verification.
Further, if the verification result indicates that the first node information fails to pass the verification, sending an indication that the first node information fails to pass the verification to the client.
Further, if the verification result indicates that the user password data fails to pass verification, sending an indication that the user password data fails to pass verification to the client, receiving third node information corresponding to the relevant node returned by the encryptor, and updating the first node information of the relevant node in the hash binary tree in the database based on the third node information. The third node information is generated after the encryption machine updates the first node information of the related node after the user password data fails to pass the verification.
Fig. 4 is an exemplary embodiment of a data processing method according to the present disclosure, where an execution body is an encryption machine, and as shown in fig. 4, the data processing method includes the following steps:
s401, receiving first node information and a data request instruction sent by a server.
The encryption machine receives first node information and a data request instruction sent by the server, and it is noted that the data request instruction includes user password data corresponding to a target user. The first node information refers to node information corresponding to relevant nodes in a Hash binary tree corresponding to a target user stored in a database.
S402, verifying the user password data in the first node information and the data request instruction, acquiring a verification result, and sending the verification result to the server.
After receiving the first node information and the data request instruction sent by the server, verifying the user password data in the first node information and the data request instruction, obtaining a verification result, and sending the verification result to the server.
When the first node information and the user password data are verified, verifying whether the first node information passes verification or not, and if the first node information passes verification, executing verification of the user password data; if the first node information verification fails, the verification of the user password data is not executed, and a verification result is directly sent to the server to be that the first node information verification fails.
When user password data verification is executed, if the user password data verification is passed, the first node information and the user password data are sent to the server side and pass the verification, the time stamp of the target leaf node corresponding to the target user is updated, and the password error retry number is set to be zero.
When the verification of the user password data is executed, if the user password data is not verified, sending a verification result to the server side, wherein the verification result is that the user password data is not verified, updating the time stamp of the target leaf node corresponding to the target user, and increasing the password error retry times by 1.
S403, responding to the verification result to indicate that the first node information and the user password data pass verification, acquiring target data based on the data request instruction, and sending the target data to the server.
If the verification result of the encryption machine indicates that the first node information and the user password data pass verification, acquiring target data based on the data request instruction, and sending the target data to the server.
According to the embodiment of the disclosure, the encrypted information of the user is stored in the hash binary tree of the database, instead of being directly stored in the encryption machine, any modification to the node information in the database can cause the hash value of the root node of the hash binary tree to change, so that the hash value cannot be matched with the hash value of the correct root node stored in the encryption machine, the problems that the encryption machine is limited in resources and cannot store massive user data inside are solved, and meanwhile, the fact that the data stored outside cannot be tampered is ensured.
Fig. 5 is an exemplary embodiment of a data processing method according to the present disclosure, where an execution body is an encryption machine, and as shown in fig. 5, the data processing method includes the following steps:
s501, receiving first node information and a data request instruction sent by a server.
The encryption machine receives first node information and a data request instruction sent by the server, and it is noted that the data request instruction includes user password data corresponding to a target user. The first node information refers to node information corresponding to relevant nodes in a Hash binary tree corresponding to a target user stored in a database.
S502, judging whether the hash value of the first root node stored in the encryption machine is identical with the hash value of the corresponding second root node in the first node information.
And taking the root node hash value stored in the encryption machine as a first root node hash value, taking the corresponding root node hash value in the first node information as a second root node hash value, and judging whether the first root node hash value stored in the encryption machine is identical with the corresponding second root node hash value in the first node information.
And S503, if the first root node hash value is different from the second root node hash value in response to the judging result, determining that the verification result is that the first node information fails verification, and sending the verification result that the first node information fails verification to the server.
If the judging result indicates that the hash value of the first root node is different from the hash value of the second root node, determining that the verification result is that the first node information fails verification, and sending the verification result to the server side, wherein the verification result is that the first node information fails verification.
And S504, if the first root node hash value is the same as the second root node hash value according to the judging result, checking whether the user password data is correct.
And if the judgment result indicates that the hash value of the first root node is the same as that of the second root node, executing the verification to determine whether the user password data are correct.
And S505, if the user password data is correct, determining that the verification result is that the first node information and the user password data are both verified.
If the user password data are correct, determining that the verification result is that the first node information and the user password data pass verification.
S506, acquiring target data based on the data request instruction, updating the time stamp in the target leaf node information corresponding to the target user, and setting the number of times of password error retries to be zero.
After the verification result is that the first node information and the user password data pass through verification, the encryptor acquires target data from a target leaf node corresponding to the target user based on a data request instruction, updates a time stamp in the target leaf node information, and sets the password error retry number in the target leaf node information to zero.
S507, updating information of other related nodes based on updated target leaf node information, obtaining second node information corresponding to the related nodes, sending the verification result of verification, target data and second node information of the first node information and user password data to a server, and replacing a first root node hash value in the encryption machine based on a third root node hash value contained in the second node information.
After the target leaf node information of the hash binary tree is changed, the information of the relevant node of the leaf node, such as hash value and hash value array, is changed, so that based on the updated target leaf node information, the information of other relevant nodes is updated, second node information corresponding to the relevant nodes is obtained, the first node information and the user password data are both sent to the server through verification results corresponding to verification, target data and the second node information, and the hash value of the first root node in the encryption machine is replaced based on the hash value of the third root node contained in the second node information.
When updating the information of other related nodes based on the updated information of the target leaf node, only 17 nodes on the path from the target leaf node to the root node can be acquired, and the 17 nodes are used as related nodes of the target user. After the target leaf node information changes, the father node of the target leaf node can replace the array information corresponding to the target leaf node in the hash value arrays of 16 child nodes stored by the father node according to the updated target leaf node information without calling the information of the rest 15 child nodes, and acquire a new hash value of the father node based on the new array generated after replacement, and repeat the step until the updating of the root node hash value is completed.
And S508, if the user password data is incorrect, determining that the user password data is not verified as a verification result.
If the user password data is incorrect, determining that the verification result is that the user password data is not verified.
S509, updating the time stamp in the target leaf node information corresponding to the target user, and increasing the number of times of password error retries.
And after the verification result is that the user password data fails to pass the verification, updating the time stamp in the target leaf node information corresponding to the target user, increasing the password error retry number, and if the password error retry number reaches an error number threshold value in a first set time period, sending a verification prohibition instruction for prohibiting the verification in a second set time period to the server. For example, if the first set time is 10 minutes, the error count threshold is 5 times, and the second set time is 30 minutes, this means that if the target user has a password error repetition count of 5 times within 10 minutes, then within 30 minutes thereafter, if the target user requests to perform authentication again, the server will not be performing authentication.
S510, updating information of other related nodes based on the updated target leaf node information, obtaining third node information corresponding to the related nodes, sending a verification result that the user password data fails to pass verification and the third node information to the server, and replacing the first root node hash value in the encryption machine based on a fourth root node hash value contained in the third node information.
After the target leaf node information of the hash binary tree is changed, the information of the relevant node of the leaf node, such as the hash value and the hash value array, is changed, so that the information of other relevant nodes is updated based on the updated target leaf node information, the third node information corresponding to the relevant nodes is obtained, the verification result and the third node information which are not passed by the user password data are sent to the server, and the hash value of the first root node in the encryption machine is replaced based on the hash value of the fourth root node contained in the third node information.
According to the embodiment of the disclosure, the encrypted information of the user is stored in the hash binary tree of the database, instead of being directly stored in the encryption machine, any modification of the node information in the database can cause the hash value of the second root node of the hash binary tree to change, so that the hash value cannot be matched with the hash value of the first root node stored in the encryption machine, the problems that the encryption machine is limited in resources and massive user data cannot be stored inside are solved, and meanwhile, the fact that the data stored outside cannot be tampered is ensured.
Fig. 6 is an exemplary embodiment of a data processing method according to the present disclosure, where an execution body is a client, and as shown in fig. 6, the data processing method includes the following steps:
S601, sending a data request instruction to a server.
And the client sends a data request instruction corresponding to the target user to the server. The data request instruction comprises user identification information and user password data corresponding to the target user, and the user request instruction is used for requesting encrypted data corresponding to the target user.
S602, receiving target data returned by the service end based on the data request instruction.
The client receives target data returned by the server based on the data request instruction. It is easy to understand that if the client receives the target data sent by the server, it means that the first node information corresponding to the target user and the user password data in the data request instruction pass verification.
In the embodiment of the disclosure, the client sends the data request instruction to the server and receives the target data returned by the server based on the data request instruction, so that the accuracy of the target data is ensured.
Further, if a verification failing indication returned by the server based on the data request instruction is received, displaying a verification failing alarm indication on the client, wherein the verification failing indication comprises a first node information verification failing indication and a user password data verification failing indication.
Fig. 7 is a general flow chart of a data processing method proposed in the present disclosure, as shown in fig. 7, a client sends a data request instruction to a server, the server invokes first node information corresponding to a target user from a database based on the data request instruction, and sends the first node information and the data request instruction to an encryptor in an encryptor cluster for processing, the encryptor first performs verification of a root node hash value, after the root node hash value passes verification, performs verification of user password data, updates the first node information according to a user password data verification result, and if the user password data passes verification, obtains the target data, sends the target data and updated node information to the server, and the server sends the updated node information to the database to update the node information in the database.
Fig. 8 is a schematic diagram of a data processing apparatus shown in the present disclosure, applied to a server, where, as shown in fig. 8, the data processing apparatus 800 includes a receiving module 801, an obtaining module 802, a sending module 803, and a responding module 804, where:
A receiving module 801, configured to receive a data request instruction sent by a client, where the data request instruction includes user identification information and user password data corresponding to a target user;
an obtaining module 802, configured to obtain, based on the user identification information, a relevant node in a hash binary tree corresponding to the target user in the database and first node information corresponding to the relevant node;
a sending module 803, configured to send the first node information and the data request instruction to the encryptor, so that the encryptor verifies the user password data in the first node information and the data request instruction and obtains a verification result;
the response module 804 is configured to receive a verification result sent by the encryptor, receive target data returned by the encryptor based on the data request instruction in response to the verification result indicating that both the first node information and the user password data pass verification, and send the target data to the client.
The data processing device stores the encrypted information of the user into the hash binary tree of the database instead of being directly stored in the encryption machine, and any modification to the node information in the database can cause the hash value of the root node of the hash binary tree to change, so that the hash value cannot be matched with the hash value of the correct root node stored in the encryption machine, the problems that the encryption machine is limited in resources and cannot store massive user data inside are solved, and meanwhile, the fact that the data stored outside cannot be tampered is ensured.
Further, the response module 804 is further configured to: after indicating that both the first node information and the user password data are authenticated in response to the authentication result, further comprising: receiving second node information corresponding to the related node returned by the encryptor; based on the second node information, updating first node information of related nodes in a hash binary tree in the database.
Further, the response module 804 is further configured to: and sending a first node information verification failure indication to the client in response to the verification result indicating that the first node information fails verification.
Further, the response module 804 is further configured to: responding to the verification result to indicate that the user password data fails to pass the verification, sending an indication that the user password data fails to pass the verification to the client, and receiving third node information corresponding to the relevant node returned by the encryption machine; and updating the first node information of the relevant nodes in the hash binary tree in the database based on the third node information.
Fig. 9 is a schematic diagram of a data processing apparatus shown in the present disclosure, applied to an encryption machine, and as shown in fig. 9, the data processing apparatus 900 includes an instruction receiving module 901, a data verification module 902, and a verification response module 903, where:
The instruction receiving module 901 is configured to receive a first node information and a data request instruction sent by a server;
the data verification module 902 is configured to verify the first node information and the user password data in the data request instruction and obtain a verification result;
the verification response module 903 is configured to respond to the verification result to indicate that the first node information and the user password data pass verification, obtain target data based on the data request instruction, and send the target data to the server.
Further, the data verification module 903 is further configured to: verifying the user password data in the first node information and the data request instruction and obtaining a verification result, wherein the method comprises the following steps: judging whether the hash value of the first root node stored in the encryption machine is identical to the hash value of the corresponding second root node in the first node information; responding to the judgment result to indicate that the hash value of the first root node is different from the hash value of the second root node, and determining that the verification result is that the first node information fails verification; responding to the judgment result to indicate that the hash value of the first root node is the same as that of the second root node, and checking whether the user password data in the data request instruction are correct or not; responding to the correctness of the user password data, and determining that the verification result is that the first node information and the user password data pass verification; and in response to the user password data being incorrect, determining that the user password data is not verified as a verification result.
Further, the verification response module 903 is further configured to: after determining that the verification result is that both the first node information and the user password data pass verification, the method further comprises the following steps: updating the time stamp in the target leaf node information corresponding to the target user, and setting the number of times of retrying the password error to be zero; updating information of other related nodes based on the updated target leaf node information, acquiring second node information corresponding to the related nodes, sending the second node information to a server, and replacing the first root node hash value in the encryption machine based on a third root node hash value contained in the second node information.
Further, the verification response module 903 is further configured to: after determining that the user password data is not authenticated as a result of the authentication, the method further comprises: updating the time stamp in the target leaf node information corresponding to the target user; updating information of other related nodes based on the updated target leaf node information, acquiring third node information corresponding to the related nodes, sending the third node information to a server, and replacing the first root node hash value in the encryption machine based on a fourth root node hash value contained in the third node information.
Further, the verification response module 903 is further configured to: when the time stamp in the target leaf node information corresponding to the target user is updated, increasing the number of times of retrying the password error; and in response to the password error repetition number reaching the error number threshold value in the first set time period, sending a verification prohibition instruction for instructing verification prohibition in the second set time period to the server.
Fig. 10 is a schematic diagram of a data processing apparatus shown in the present disclosure, applied to a client, and as shown in fig. 10, the data processing apparatus 1000 includes an instruction sending module 1001 and a data receiving module 1002, where:
an instruction sending module 1001, configured to send a data request instruction to a server;
the data receiving module 1002 is configured to receive target data returned by the service end based on the data request instruction.
Further, the data receiving module 1002 is further configured to: and in response to receiving the verification failing indication returned by the server based on the data request instruction, displaying a verification failing alarm indication on the client, wherein the verification failing indication comprises a first node information verification failing indication and a user password data verification failing indication.
Further, the data request instruction sent by the instruction sending module 1001 includes user password data and user identification information of the target user.
Fig. 11 is a block diagram of an electronic device 1100, according to an example embodiment.
As shown in fig. 11, the electronic device 1100 includes:
the memory 1101 and the processor 1102, the bus 1103 connecting different components (including the memory 1101 and the processor 1102), the memory 1101 stores a computer program, and the processor 1102 implements the data processing method of the embodiments of the present disclosure when executing the program.
The bus 1103 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, micro channel architecture (MAC) bus, enhanced ISA bus, video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.
The electronic device 1100 typically includes a variety of electronic device readable media. Such media can be any available media that can be accessed by the electronic device 1100 and includes both volatile and nonvolatile media, removable and non-removable media.
The memory 1101 may also include computer system readable media in the form of volatile memory, such as Random Access Memory (RAM) 1104 and/or cache memory 1105. The electronic device 1100 may further include other removable/non-removable, volatile/nonvolatile computer system storage media. By way of example only, the storage system 1106 may be used to read from or write to non-removable, nonvolatile magnetic media (not shown in FIG. 11, commonly referred to as a "hard disk drive"). Although not shown in fig. 11, a magnetic disk drive for reading from and writing to a removable non-volatile magnetic disk (e.g., a "floppy disk"), and an optical disk drive for reading from or writing to a removable non-volatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical media) may be provided. In such cases, each drive may be coupled to bus 1103 by one or more data media interfaces. The memory 1101 may include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of the various embodiments of the present disclosure.
A program/utility 1108 having a set (at least one) of program modules 1107 may be stored in, for example, memory 1101, such program modules 1107 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment. Program modules 1107 generally perform the functions and/or methods in the embodiments described in this disclosure.
The electronic device 1100 may also communicate with one or more external devices 1109 (e.g., keyboard, pointing device, display 1110, etc.), one or more devices that enable a user to interact with the electronic device 1100, and/or any device (e.g., network card, modem, etc.) that enables the electronic device 1100 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 1111. Also, electronic device 1100 can communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the Internet, through network adapter 1112. As shown in fig. 11, network adapter 1112 communicates with other modules of electronic device 1100 over bus 1103. It should be appreciated that although not shown in fig. 11, other hardware and/or software modules may be used in connection with electronic device 1100, including, but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.
The processor 1102 executes various functional applications and data processing by running programs stored in the memory 1101.
It should be noted that, the implementation process and the technical principle of the electronic device in this embodiment refer to the foregoing explanation of the data processing method in the embodiment of the disclosure, and are not repeated herein.
To achieve the above embodiments, the present disclosure also proposes a computer-readable storage medium.
Wherein the instructions in the computer-readable storage medium, when executed by a processor of the electronic device, enable the electronic device to perform the data processing method as before. Alternatively, the computer readable storage medium may be ROM, random Access Memory (RAM), CD-ROM, magnetic tape, floppy disk, optical data storage device, etc.
The present disclosure also proposes a computer program product comprising a computer program/instruction, characterized in that the computer program/instruction, when executed by a processor, implements the above-mentioned data processing method.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any adaptations, uses, or adaptations of the disclosure following the general principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It is to be understood that the present disclosure is not limited to the precise arrangements and instrumentalities shown in the drawings, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (18)

1. A data processing method, applied to a server, the method comprising:
receiving a data request instruction sent by a client, wherein the data request instruction comprises user identification information and user password data corresponding to a target user;
based on the user identification information, acquiring related nodes in a hash binary tree corresponding to the target user in a database and first node information corresponding to the related nodes;
transmitting the first node information and the data request instruction to an encryptor, so that the encryptor verifies the user password data in the first node information and the data request instruction and obtains a verification result;
and receiving the verification result sent by the encryptor, responding to the verification result to indicate that the first node information and the user password data pass verification, receiving target data returned by the encryptor based on the data request instruction, and sending the target data to the client.
2. The method of claim 1, further comprising, after said indicating that both said first node information and said user password data are authenticated in response to said authentication result:
receiving second node information corresponding to the related node returned by the encryptor;
updating the first node information of the relevant nodes in the hash binary tree in the database based on the second node information.
3. The method according to claim 1, wherein the method further comprises:
and responding to the verification result to indicate that the first node information fails to pass verification, and sending a first node information verification failure indication to the client.
4. The method according to claim 1, wherein the method further comprises:
responding to the verification result to indicate that the user password data fails to pass verification, sending a user password data verification failure indication to the client, and receiving third node information corresponding to the relevant node returned by the encryptor;
updating the first node information of the relevant node in the hash binary tree in the database based on the third node information.
5. A data processing method for use with an encryptor, the method comprising:
receiving first node information and a data request instruction sent by the server;
verifying the first node information and the user password data in the data request instruction, acquiring a verification result, and sending the verification result to the server;
and responding to the verification result to indicate that the first node information and the user password data pass verification, acquiring target data based on the data request instruction, and sending the target data to the server.
6. The method of claim 5, wherein verifying the first node information and the user password data in the data request instruction and obtaining a verification result comprises:
judging whether a first root node hash value stored in the encryption machine is the same as a corresponding second root node hash value in the first node information;
responding to the judgment result to indicate that the hash value of the first root node is different from the hash value of the second root node, and determining that the verification result is that the first node information fails verification;
Responding to the judgment result to indicate that the hash value of the first root node is the same as the hash value of the second root node, and checking whether the user password data in the data request instruction is correct or not;
determining that the verification result is that the first node information and the user password data are both verified if the user password data are correct;
and responding to the user password data is incorrect, and determining that the user password data is not verified as the verification result.
7. The method of claim 6, further comprising, after said determining that said authentication result is that both said first node information and said user password data are authenticated:
updating the time stamp in the target leaf node information corresponding to the target user, and setting the number of times of retrying the password error to be zero;
updating the information of other related nodes based on the updated target leaf node information, acquiring second node information corresponding to the related nodes, sending the second node information to the server, and replacing the hash value of the first root node in the encryption machine based on the hash value of the third root node contained in the second node information.
8. The method of claim 6, further comprising, after said determining that said user password data is not authenticated, after said determining that said authentication result is that said user password data is not authenticated:
updating the time stamp in the target leaf node information corresponding to the target user;
updating the information of other related nodes based on the updated target leaf node information, acquiring third node information corresponding to the related nodes, sending the third node information to the server, and replacing the hash value of the first root node in the encryption machine based on the hash value of the fourth root node contained in the third node information.
9. The method as recited in claim 8, further comprising:
when the time stamp in the target leaf node information corresponding to the target user is updated, increasing the number of times of retrying the password error;
and responding to the password error repetition number reaching an error number threshold value in a first set time period, and sending a verification prohibition instruction for instructing to prohibit verification in a second set time period to the server.
10. A data processing method, applied to a client, the method comprising:
Sending a data request instruction to the server;
and receiving target data returned by the server based on the data request instruction.
11. The method as recited in claim 10, further comprising:
and in response to receiving the verification failing indication returned by the server based on the data request instruction, displaying a verification failing alarm indication on the client, wherein the verification failing indication comprises a first node information verification failing indication and a user password data verification failing indication.
12. The method of claim 11, wherein the data request instruction includes user password data and user identification information of the target user.
13. A data processing apparatus, for application to a server, comprising:
the receiving module is used for receiving a data request instruction sent by the client, wherein the data request instruction comprises user identification information and user password data corresponding to a target user;
the acquisition module is used for acquiring related nodes in the Hash binary tree corresponding to the target user in the database and first node information corresponding to the related nodes based on the user identification information;
The sending module is used for sending the first node information and the data request instruction to an encryptor so that the encryptor can verify the user password data in the first node information and the data request instruction and obtain a verification result;
and the response module is used for receiving the verification result sent by the encryptor, responding to the verification result to indicate that the first node information and the user password data are both verified, receiving target data returned by the encryptor based on the data request instruction, and sending the target data to the client.
14. A data processing apparatus for use with an encryptor, comprising:
the instruction receiving module is used for receiving the first node information and the data request instruction sent by the server;
the data verification module is used for verifying the first node information and the user password data in the data request instruction and obtaining a verification result;
and the verification response module is used for responding to the verification result to indicate that the first node information and the user password data pass verification, acquiring target data based on the data request instruction, and sending the target data to the server.
15. A data processing apparatus, for application to a client, comprising:
the instruction sending module is used for sending a data request instruction to the server;
and the data receiving module is used for receiving target data returned by the server side based on the data request instruction.
16. An electronic device, comprising:
a processor;
a memory for storing executable instructions of the processor;
wherein the processor is configured to execute the instructions to implement the method of any of claims 1-4 or claims 5-9 or claims 10-12.
17. A computer readable storage medium, characterized in that instructions in the computer readable storage medium, when executed by a processor of an electronic device, enable the electronic device to perform the method of any one of claims 1-4 or claims 5-9 or claims 10-12.
18. A computer program product comprising computer programs/instructions which, when executed by a processor, implement the steps of any of claims 1-4 or claims 5-9 or claims 10-12.
CN202210914633.8A 2022-08-01 2022-08-01 Data processing method and device Pending CN117544294A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210914633.8A CN117544294A (en) 2022-08-01 2022-08-01 Data processing method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210914633.8A CN117544294A (en) 2022-08-01 2022-08-01 Data processing method and device

Publications (1)

Publication Number Publication Date
CN117544294A true CN117544294A (en) 2024-02-09

Family

ID=89794428

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210914633.8A Pending CN117544294A (en) 2022-08-01 2022-08-01 Data processing method and device

Country Status (1)

Country Link
CN (1) CN117544294A (en)

Similar Documents

Publication Publication Date Title
US20200274859A1 (en) User authentication system with self-signed certificate and identity verification with offline root certificate storage
US11501533B2 (en) Media authentication using distributed ledger
US20210081551A1 (en) Method, apparatus, and electronic device for blockchain-based recordkeeping
US20200274715A1 (en) Method, apparatus, and electronic device for blockchain-based recordkeeping
CN108923908B (en) Authorization processing method, device, equipment and storage medium
EP3499795A1 (en) Authentication system and method, and user equipment, authentication server, and service server for performing same method
US11790077B2 (en) Methods, mediums, and systems for establishing and using security questions
CN110515678B (en) Information processing method, equipment and computer storage medium
CN107196901B (en) Identity registration and authentication method and device
US10432622B2 (en) Securing biometric data through template distribution
CN108959430B (en) Advertisement promotion data acquisition method, device and equipment
CN108073823B (en) Data processing method, device and system
US20200412535A1 (en) Authentication information transmission method, apparatus, and storage medium
CN111400760B (en) Method, device, server and storage medium for web application to access database
CN110545542B (en) Main control key downloading method and device based on asymmetric encryption algorithm and computer equipment
WO2022142536A1 (en) Grayscale publishing method, system and apparatus, and device and storage medium
CN114238883A (en) Identity authentication method, device, equipment and storage medium
CN111327680B (en) Authentication data synchronization method, device, system, computer equipment and storage medium
US9444802B2 (en) Device authentication using display device irregularity
US20230198760A1 (en) Verified presentation of non-fungible tokens
CN117544294A (en) Data processing method and device
US11968305B2 (en) Four-factor authentication
CN111177752B (en) Credible file storage method, device and equipment based on static measurement
CN111078569A (en) Method and device for testing optical character recognition application and storage medium
WO2019062184A1 (en) Bank insurance policy data interfacing method and insurance policy data server

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination