CN114116313A - Backup data processing method and device - Google Patents
Backup data processing method and device Download PDFInfo
- Publication number
- CN114116313A CN114116313A CN202111418480.XA CN202111418480A CN114116313A CN 114116313 A CN114116313 A CN 114116313A CN 202111418480 A CN202111418480 A CN 202111418480A CN 114116313 A CN114116313 A CN 114116313A
- Authority
- CN
- China
- Prior art keywords
- target data
- data
- hash value
- binary tree
- module
- 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
Links
- 238000003672 processing method Methods 0.000 title abstract description 12
- 238000000034 method Methods 0.000 claims abstract description 33
- 238000011084 recovery Methods 0.000 claims abstract description 15
- 230000004048 modification Effects 0.000 claims description 14
- 238000012986 modification Methods 0.000 claims description 14
- 238000010276 construction Methods 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 15
- 230000009286 beneficial effect Effects 0.000 description 12
- 230000008569 process Effects 0.000 description 11
- 238000004590 computer program Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 4
- 241000700605 Viruses Species 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1448—Management of the data involved in backup or backup restore
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a backup data processing method and device, which are used for verifying whether backup data are tampered or not so as to improve the safety of the backup data. The method comprises the following steps: when target data are restored according to backup data of the target data, generating a digital abstract corresponding to the backup data; constructing a first binary tree consisting of the digital digests; calculating a first hash value of the first binary tree root node; comparing the first hash value with a preset identifier of the target data; and when the first hash value is the same as the identification of the target data, restoring the target data according to the backup data of the target data. By adopting the method provided by the invention, the hash value of the root node of the binary tree corresponding to the backup data is compared with the identifier of the target data, so that whether the backup data is tampered or not can be verified, and the safety of data recovery is improved.
Description
The application is a divisional application of Chinese patent application with the application date of 2016, 20 and 21, the application number of 201610919565.9 and the name of 'a backup data processing method and device'.
Technical Field
The present invention relates to the field of internet technologies, and in particular, to a method and an apparatus for processing backup data.
Background
Data backup refers to a process of copying all or part of a data set from an application host to another storage medium. When the data in the application host is damaged by an accident, the integrity and the safety of the backup data are checked, and when the integrity and the safety of the backup data pass the check, the data in the application host can be recovered through the backup data.
However, in the prior art, the data security is only checked to see whether the data is infected by virus. It is impossible to check whether the data has been tampered by a human. While the security of the data involved in some institutions, such as banks, is of paramount importance. When data recovery is performed, illegally tampered backup data is imported into the application host, and the consequences of the illegal tampered backup data are serious. Therefore, how to verify whether the backup data is tampered before performing data recovery, so as to improve the security of data recovery, is a technical problem to be solved.
Disclosure of Invention
The invention provides a backup data processing method and device, which are used for verifying whether backup data are tampered or not so as to improve the safety of the backup data.
The invention provides a backup data processing method, which comprises the following steps:
when target data are restored according to backup data of the target data, generating a digital abstract corresponding to the backup data;
constructing a first binary tree consisting of the digital digests;
calculating a first hash value of the first binary tree root node;
comparing the first hash value with a preset identifier of the target data;
and when the first hash value is the same as the identification of the target data, restoring the target data according to the backup data of the target data.
The invention has the beneficial effects that: by comparing the hash value of the root node of the binary tree corresponding to the backup data with the identifier of the target data, whether the backup data is tampered or not can be verified, and the safety of data recovery is improved.
In one embodiment, the method further comprises:
and when the first hash value is different from the identification of the target data, sending out a warning to prompt a user that the backup data is tampered.
The beneficial effect of this embodiment lies in: and when the first hash value of the root node of the binary tree corresponding to the backup data is different from the identifier of the target data, sending out a warning that the backup data is tampered. The data recovery by the user according to the tampered data is avoided, and the safety of the data recovery is improved.
In one embodiment, the process of establishing the preset identification of the target data includes:
when backing up target data, generating a digital abstract corresponding to the target data; each piece of target data corresponds to one digital abstract;
constructing a second binary tree consisting of the digital digests;
calculating a second hash value of the root node of the second binary tree;
and when the target data is completely backed up, determining the second hash value as the identifier of the target data.
The beneficial effect of this embodiment lies in: in the process of backing up the target data, the second hash value is obtained, and the second hash value does not need to be obtained until the backing up of the target data is finished, so that the time is saved.
In one embodiment, the method further comprises:
when the target data are changed, correspondingly modifying the backup data corresponding to the target data, and constructing a third binary tree consisting of the digital abstracts corresponding to the changed data;
calculating a third hash value of the root node of the third binary tree;
and determining that the third hash value and the second hash value are the same as the identifier of the target data.
The beneficial effect of this embodiment lies in: when the target data is changed, only a new third binary tree is constructed according to the changed data, and the second binary tree constructed during data backup is not modified, so that the determination process of the target data identifier is simplified; in addition, the device only needs to calculate the hash value of the root node of the third binary tree with smaller corresponding data volume, and does not need to calculate the hash value of the root node of the second binary tree again, so that the power consumption of the device is reduced.
In one embodiment, the method further comprises:
when the target data is changed, judging whether the ratio of the changed data to the target data is greater than a preset threshold value or not;
when the data size is larger than a preset threshold value, correspondingly modifying backup data corresponding to the target data;
when the backup data are modified, constructing a fourth binary tree consisting of digital abstracts corresponding to the modified backup data;
calculating a fourth hash value of the root node of the fourth binary tree;
and modifying the identifier of the target data into the fourth hash value.
The beneficial effect of this embodiment lies in: if the changed data volume is large, when the backup data is modified, the binary tree corresponding to the backup data is reconstructed, a plurality of new binary trees do not need to be established, the determination process of the target data identification is simplified, and the power consumption of the equipment is reduced.
In one embodiment, the method further comprises:
sending the identification of the target data and the target data to a block chain for carrying out encryption currency transaction;
and when the transaction times based on the target data reach a preset number, determining that the state of the identifier of the target data is an unmodified state.
The beneficial effect of this embodiment lies in: and placing the identifier of the target data in a block chain for carrying out encryption currency transaction, so that the state of the identifier of the target data is changed into an unmodified state, and the identifier of the target data is prevented from being modified by other users.
The present invention also provides a backup data processing apparatus, including:
the device comprises a first generation module, a second generation module and a third generation module, wherein the first generation module is used for generating a digital abstract corresponding to backup data when the target data is restored according to the backup data of the target data;
a first construction module for constructing a first binary tree composed of the digital digests;
a first calculation module, configured to calculate a first hash value of the first binary tree root node;
the comparison module is used for comparing the first hash value with a preset identifier of the target data;
and the recovery module is used for recovering the target data according to the backup data of the target data when the first hash value is the same as the identifier of the target data.
In one embodiment, the apparatus further comprises:
and the warning module is used for sending out a warning when the first hash value is different from the identification of the target data so as to prompt a user that the backup data is tampered.
In one embodiment, the apparatus further comprises:
the second generation module is used for generating a digital abstract corresponding to target data when the target data is backed up; each piece of target data corresponds to one digital abstract;
a second constructing module, configured to construct a second binary tree composed of the digital digests;
a second calculating module, configured to calculate a second hash value of the root node of the second binary tree;
and the first determining module is used for determining the second hash value as the identifier of the target data when the target data is completely backed up.
In one embodiment, the apparatus further comprises:
the first judgment module is used for judging whether the ratio of the changed data to the target data is greater than a preset threshold value or not when the target data is changed;
the processing module is used for correspondingly modifying the backup data corresponding to the target data and constructing a third binary tree consisting of the digital abstracts corresponding to the changed data when the backup data is not greater than a preset threshold;
a third calculating module, configured to calculate a third hash value of the root node of the third binary tree;
and the second determining module is used for determining that the third hash value and the second hash value are the same as the identifier of the target data.
In one embodiment, the apparatus further comprises:
the second judging module is used for judging whether the ratio of the changed data to the target data is greater than a preset threshold value or not when the target data is changed;
the first modification module is used for correspondingly modifying the backup data corresponding to the target data when the first modification module is larger than a preset threshold;
a third construction module, configured to construct, when the backup data is modified, a fourth binary tree composed of digital digests corresponding to the modified backup data;
a fourth calculating module, configured to calculate a fourth hash value of the root node of the fourth binary tree;
and the second modification module is used for modifying the identifier of the target data into the fourth hash value.
In one embodiment, the apparatus further comprises:
the sending module is used for sending the identification of the target data and the target data to a block chain for carrying out cryptocurrency transaction;
and the third determining module is used for determining that the state of the identifier of the target data is an unmodified state when the transaction frequency based on the target data reaches a preset number.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
The invention is described in detail below with reference to the drawings and specific examples, but the invention is not limited thereto.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention. In the drawings:
FIG. 1 is a flow diagram illustrating a backup data processing method in accordance with an exemplary embodiment;
FIG. 2 is a flow diagram illustrating a backup data processing method in accordance with an exemplary embodiment;
FIG. 3 is a flow diagram illustrating a backup data processing method in accordance with an exemplary embodiment;
FIG. 4 is a flow diagram illustrating a backup data processing method in accordance with an exemplary embodiment;
FIG. 5 is a flowchart illustrating a backup data processing method in accordance with an exemplary embodiment;
FIG. 6 is a block diagram illustrating a backup data processing apparatus in accordance with an exemplary embodiment;
FIG. 7 is a block diagram illustrating a backup data processing apparatus in accordance with an exemplary embodiment.
Detailed Description
The preferred embodiments of the present invention will be described in conjunction with the accompanying drawings, and it will be understood that they are described herein for the purpose of illustration and explanation and not limitation.
Fig. 1 is a flowchart illustrating a backup data processing method according to an exemplary embodiment, which may be implemented by a terminal or a server, as illustrated in fig. 1, and which may be implemented as the following steps S101-S105:
in step S101, when the target data is restored according to the backup data of the target data, a digital summary corresponding to the backup data is generated;
in step S102, a first binary tree composed of the digital digests is constructed;
in step S103, a first hash value of a first binary tree root node is calculated;
in step S104, comparing the first hash value with a preset identifier of the target data;
in step S105, when the first hash value and the identifier of the target data are the same, the target data is restored according to the backup data of the target data.
When the source data is damaged, the backup data of the source data can be restored, and before restoration, whether the backup data is tampered or not needs to be verified.
In order to solve the problem, when the target data is backed up, digital digests corresponding to the target data are generated, each piece of data corresponds to one digital digest, and each digital digest is unique and has a fixed length. The digital digests are arranged in a certain order and then combined to form a binary tree (namely, a binary tree formed by the digital digests) corresponding to the backup data, the hash value of each node is calculated until reaching the root node of the binary tree, and the hash value of the root node of the binary tree is used as the identifier of the target data.
When the backup data is illegally tampered, the digital abstract corresponding to the tampered data changes dynamically, so that the hash value of the root node of the binary tree corresponding to the backup data changes correspondingly, but the identification of the target data does not change. At this time, the hash value of the root node of the binary tree is different from the identifier of the target data. Therefore, when the target data is restored according to the backup data, whether the backup data is tampered can be verified by verifying whether the hash value of the root node of the binary tree corresponding to the backup data is the same as the identifier of the target data.
In this embodiment, when the target data is restored according to the backup data of the target data, a digital abstract corresponding to the backup data is generated; and constructing a binary tree formed by the digital abstract, calculating a first hash value of a root node of the binary tree, comparing the first hash value with the identifier of the target data, and when the identifier of the first hash value is the same as the identifier of the target data, indicating that the backup data is not tampered, and at the moment, recovering the target data according to the backup data.
The invention has the beneficial effects that: by comparing the hash value of the root node of the binary tree corresponding to the backup data with the identifier of the target data, whether the backup data is tampered or not can be verified, and the safety of data recovery is improved.
In one embodiment, the method further comprises:
when the first hash value is different from the identification of the target data, an alert is issued to alert a user that the backup data has been tampered with.
When the backup data is illegally tampered, the digital abstract corresponding to the tampered data changes dynamically, so that the hash value of the root node of the binary tree corresponding to the backup data changes correspondingly, and at the moment, the hash value of the root node of the binary tree is different from the identifier of the target data.
Based on the above characteristics, in this embodiment, when the first hash value of the root node of the binary tree corresponding to the backup data is different from the identifier of the target data, a warning that the backup data has been tampered is issued. The data recovery by the user according to the tampered data is avoided, and the safety of the data recovery is improved.
Secondly, when confirming that the data is tampered, only a warning is sent to the user instead of directly terminating the data recovery, so that the user has more options, and when the data security requirement is not particularly high, the user can still recover the data, so that the part of the data which is not tampered can be normally used.
The beneficial effect of this embodiment lies in: and when the first hash value of the root node of the binary tree corresponding to the backup data is different from the identifier of the target data, sending out a warning that the backup data is tampered. The data recovery by the user according to the tampered data is avoided, and the safety of the data recovery is improved.
In one embodiment, as shown in fig. 2, the establishment process of the preset identification of the target data can be implemented as the following steps S201 to S204:
in step S201, when backing up target data, a digital summary corresponding to the target data is generated; each piece of target data corresponds to one digital abstract;
in step S202, a second binary tree consisting of the digital digests is constructed;
in step S203, a second hash value of a root node of the second binary tree is calculated;
in step S204, when the backup of the target data is completed, it is determined that the second hash value is the identifier of the target data.
In this embodiment, in the process of backing up the target data, digital digests corresponding to the target data are generated, each piece of data corresponds to one digital digest, and each digital digest is unique and has a fixed length.
The digital digests are arranged in a certain order and then combined to form a binary tree (namely, a binary tree formed by the digital digests) corresponding to the backup data, and the hash value of each node is calculated until reaching the root node of the binary tree to obtain the hash value of the root node of the binary tree. And taking the hash value as the identification of the target data.
The beneficial effect of this embodiment lies in: in the process of backing up the target data, the second hash value is obtained, and the second hash value does not need to be obtained until the backing up of the target data is finished, so that the time is saved.
In one embodiment, as shown in FIG. 3, before the above step S101, the method may further be implemented as the following steps S301-S304:
in step S301, when the target data is changed, determining whether a ratio of the changed data to the target data is greater than a preset threshold;
in step S302, when the value is not greater than the preset threshold, correspondingly modifying the backup data corresponding to the target data, and constructing a third binary tree composed of the digital digests corresponding to the changed data;
in step S303, a third hash value of a root node of the third binary tree is calculated;
in step S304, it is determined that the third hash value and the second hash value are both the identification of the target data.
A proportional threshold, such as 30%, is preset. When the target data is changed, judging whether the ratio of the changed data to the target data is greater than a preset threshold value or not; and when the data is not greater than the preset threshold value, correspondingly modifying the backup data corresponding to the target data. Such modifications are made in accordance with changes in the target data, and are therefore legitimate.
And constructing a third binary tree consisting of the digital digests corresponding to the changed data while modifying the backup data corresponding to the target data, calculating a third hash value of a root node of the third binary tree, and determining that the calculated third hash value and the previous second hash value are the same as the identifier of the target data. For example, the identifier of the target data is in the form of "third hash value & second hash value".
In this embodiment, since the changed data is less, the second binary tree constructed during the data backup before the data backup is not modified, but a new binary tree is reconstructed according to the modified content, so that the hash value of the root node of the previous second binary tree is not changed.
It should be noted that, after the embodiment is executed, when data is restored, not only the hash value of the root node of the binary tree corresponding to the target data before being changed needs to be calculated, but also the hash value of the root node of the binary tree corresponding to the changed data after being changed needs to be calculated, so that the two calculated hash values are compared with the preset identifier of the target data, and different operations are executed according to different comparison results.
The above-described embodiment is applicable to the case where there is less data to be changed.
The beneficial effect of this embodiment lies in: when the target data is changed, only a new third binary tree is constructed according to the changed data, and the second binary tree constructed during data backup is not modified, so that the determination process of the target data identifier is simplified; in addition, the device only needs to calculate the hash value of the root node of the third binary tree with smaller corresponding data volume, and does not need to calculate the hash value of the root node of the second binary tree again, so that the power consumption of the device is reduced.
In one embodiment, as shown in FIG. 4, before step S101, the method may be further implemented as steps S401-S405 as follows:
in step S401, when the target data is changed, determining whether a ratio of the changed data to the target data is greater than a preset threshold;
in step S402, when the threshold is greater than the preset threshold, the backup data corresponding to the target data is modified correspondingly;
in step S403, when the backup data is modified, constructing a fourth binary tree composed of the digital digests corresponding to the modified backup data;
in step S404, a fourth hash value of a root node of the fourth binary tree is calculated;
in step S405, the identification of the target data is modified to a fourth hash value.
When the target data is changed and the changed data amount is large, if the manner of steps S301 to S304 is still used, many new binary trees need to be constructed, which results in a large data amount to be processed by the device, and when the ratio of the changed data amount to the data amount of the target data reaches a preset ratio, the data amount to be processed is larger than that needed to newly construct the second binary tree.
In view of the above situation, in this embodiment, when data is changed and the ratio of the changed data amount to the data amount of the target data reaches the preset ratio, the backup data is waited to be modified. And after the backup data are modified, reconstructing a fourth binary tree according to the modified backup data. And calculating a fourth hash value of the root node of the fourth binary tree, and modifying the identifier of the target data into the fourth hash value.
In this embodiment, when the target data is changed, the backup data corresponding to the target data is modified correspondingly, and when the backup data is modified, a fourth binary tree composed of digital digests corresponding to the modified backup data is constructed; calculating a fourth hash value of the root node of the fourth binary tree; and modifying the identification of the target data into a fourth hash value.
The beneficial effect of this embodiment lies in: if the changed data volume is large, when the backup data is modified, the binary tree corresponding to the backup data is reconstructed, a plurality of new binary trees do not need to be established, the determination process of the target data identification is simplified, and the power consumption of the equipment is reduced.
In one embodiment, as shown in fig. 5, after the step S204, or after the step S304, or after the step S405, the method may further be implemented as the following steps S501-S502:
in step S501, the identifier of the target data and the target data are sent to a blockchain for performing cryptocurrency transaction;
in step S502, when the number of transactions based on the target data reaches a preset number, it is determined that the state of the identification of the target data is an unmodified state.
In this embodiment, to ensure that the identifier of the target data is not modified, the identifier of the target data is sent to the blockchain for performing cryptocurrency transactions. While the data structure in the blockchain is similar to a stack structure. Therefore, the target data is sent to the block chain for performing cryptocurrency transaction, and when the transaction number based on the target data reaches a preset threshold value, only the data at the top of the stack can be edited in the stack, so that the position at the top of the stack is replaced by other data along with the transaction of the cryptocurrency. And because the speed of the cryptocurrency transaction is very fast, the identification of the target data cannot be taken out unless the speed of the data taking is higher than the transaction speed, and therefore, the identification of the target data cannot be edited.
The beneficial effect of this embodiment lies in: and placing the identifier of the target data in a block chain for carrying out encryption currency transaction, so that the state of the identifier of the target data is changed into an unmodified state, and the identifier of the target data is prevented from being modified by other users.
Fig. 6 is a block diagram illustrating a backup data processing apparatus according to an exemplary embodiment, which may be implemented by a terminal or a server, as illustrated in fig. 6, and may include the following modules:
the first generating module 61 is configured to generate a digital summary corresponding to backup data when the target data is restored according to the backup data of the target data;
a first construction module 62 for constructing a first binary tree composed of digital digests;
a first calculating module 63, configured to calculate a first hash value of a first binary tree root node;
a comparison module 64, configured to compare the first hash value with a preset identifier of the target data;
and a restoring module 65, configured to restore the target data according to the backup data of the target data when the first hash value is the same as the identifier of the target data.
In one embodiment, the apparatus further comprises:
and the warning module is used for sending out a warning when the first hash value is different from the identifier of the target data so as to prompt a user that the backup data is tampered.
In one embodiment, as shown in fig. 7, the apparatus further comprises:
a second generating module 71, configured to generate a digital abstract corresponding to target data when the target data is backed up; each piece of target data corresponds to one digital abstract;
a second constructing module 72 for constructing a second binary tree consisting of the digital digests;
a second calculating module 73, configured to calculate a second hash value of a root node of the second binary tree;
and a first determining module 74, configured to determine the second hash value as the identifier of the target data when the target data is completely backed up.
In one embodiment, the apparatus further comprises:
the first judgment module is used for judging whether the ratio of the changed data to the target data is greater than a preset threshold value or not when the target data is changed;
the processing module is used for correspondingly modifying the backup data corresponding to the target data when the data are not greater than the preset threshold value, and meanwhile constructing a third binary tree consisting of the digital abstracts corresponding to the changed data;
the third calculation module is used for calculating a third hash value of a root node of the third binary tree;
and the second determining module is used for determining that the third hash value and the second hash value are the same as the identifier of the target data.
In one embodiment, the apparatus further comprises:
the second judgment module is used for judging whether the ratio of the changed data to the target data is greater than a preset threshold value or not when the target data is changed;
the first modification module is used for correspondingly modifying the backup data corresponding to the target data when the first modification module is larger than a preset threshold;
the third construction module is used for constructing a fourth binary tree consisting of the digital abstracts corresponding to the modified backup data when the modification of the backup data is finished;
the fourth calculation module is used for calculating a fourth hash value of a root node of the fourth binary tree;
and the second modification module is used for modifying the identifier of the target data into a fourth hash value.
In one embodiment, the apparatus further comprises:
the sending module is used for sending the identification of the target data and the target data to a block chain for carrying out cryptocurrency transaction;
and the third determining module is used for determining that the state of the identifier of the target data is an unmodified state when the transaction times based on the target data reach a preset number.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (12)
1. A method for processing backup data, comprising:
when target data are restored according to backup data of the target data, generating a digital abstract corresponding to the backup data;
constructing a first binary tree consisting of the digital digests;
calculating a first hash value of the first binary tree root node;
comparing the first hash value with a preset identifier of the target data;
when the first hash value is the same as the identification of the target data, restoring the target data according to backup data of the target data;
when the target data is changed, judging whether the ratio of the changed data to the target data is greater than a preset threshold value or not;
constructing a third binary tree or a fourth binary tree;
calculating a third hash value of the third binary tree root node and a fourth hash value of the fourth binary tree root node;
and re-determining the identification of the target data.
2. The method of claim 1, wherein the method further comprises:
and when the first hash value is different from the identification of the target data, sending out a warning to prompt a user that the backup data is tampered.
3. The method of claim 1, wherein the establishing of the preset identification of the target data comprises:
when backing up target data, generating a digital abstract corresponding to the target data; each piece of target data corresponds to one digital abstract;
constructing a second binary tree consisting of the digital digests;
calculating a second hash value of the root node of the second binary tree;
and when the target data is completely backed up, determining the second hash value as the identifier of the target data.
4. The method of claim 3, wherein the method further comprises:
when the data is not greater than the preset threshold value, correspondingly modifying the backup data corresponding to the target data, and constructing a third binary tree consisting of the digital abstracts corresponding to the changed data;
and determining that the third hash value and the second hash value are the same as the identifier of the target data.
5. The method of claim 1, wherein the method further comprises:
when the data size is larger than a preset threshold value, correspondingly modifying backup data corresponding to the target data;
when the backup data are modified, constructing the fourth binary tree consisting of the digital abstracts corresponding to the modified backup data;
and modifying the identifier of the target data into the fourth hash value.
6. The method of any one of claims 3-5, further comprising:
sending the identification of the target data and the target data to a block chain for carrying out encryption currency transaction;
and when the transaction times based on the target data reach a preset number, determining that the state of the identifier of the target data is an unmodified state.
7. A backup data processing apparatus, comprising:
the device comprises a first generation module, a second generation module and a third generation module, wherein the first generation module is used for generating a digital abstract corresponding to backup data when the target data is restored according to the backup data of the target data;
a first construction module for constructing a first binary tree composed of the digital digests;
a first calculation module, configured to calculate a first hash value of the first binary tree root node;
the comparison module is used for comparing the first hash value with a preset identifier of the target data;
the recovery module is used for recovering the target data according to the backup data of the target data when the first hash value is the same as the identifier of the target data;
the judging module is used for judging whether the ratio of the changed data to the target data is greater than a preset threshold value or not when the target data is changed;
a processing module for constructing a third binary tree;
a third constructing module, configured to construct a fourth binary tree;
a third calculating module, configured to calculate a third hash value of the root node of the third binary tree;
a fourth calculating module, configured to calculate a fourth hash value of the root node of the fourth binary tree;
a second determining module or a second modifying module for re-determining the identity of the target data.
8. The apparatus of claim 7, wherein the apparatus further comprises:
and the warning module is used for sending out a warning when the first hash value is different from the identification of the target data so as to prompt a user that the backup data is tampered.
9. The apparatus of claim 7, wherein the apparatus further comprises:
the second generation module is used for generating a digital abstract corresponding to target data when the target data is backed up; each piece of target data corresponds to one digital abstract;
a second constructing module, configured to construct a second binary tree composed of the digital digests;
a second calculating module, configured to calculate a second hash value of the root node of the second binary tree;
and the first determining module is used for determining the second hash value as the identifier of the target data when the target data is completely backed up.
10. The apparatus of claim 9, wherein the apparatus further comprises:
when the data is not greater than the preset threshold value, the processing module correspondingly modifies the backup data corresponding to the target data and constructs the third binary tree consisting of the digital abstracts corresponding to the changed data;
the second determining module is configured to determine that the third hash value and the second hash value are the same as the identifier of the target data.
11. The apparatus of claim 7, wherein the apparatus further comprises:
the first modification module is used for correspondingly modifying the backup data corresponding to the target data when the first modification module is larger than a preset threshold;
when the backup data are modified, the third construction module constructs the fourth binary tree consisting of the digital abstract corresponding to the modified backup data;
and the second modification module is used for modifying the identifier of the target data into the fourth hash value.
12. The apparatus of any one of claims 9-11, wherein the apparatus further comprises:
the sending module is used for sending the identification of the target data and the target data to a block chain for carrying out cryptocurrency transaction;
and the third determining module is used for determining that the state of the identifier of the target data is an unmodified state when the transaction frequency based on the target data reaches a preset number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111418480.XA CN114116313A (en) | 2016-10-21 | 2016-10-21 | Backup data processing method and device |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111418480.XA CN114116313A (en) | 2016-10-21 | 2016-10-21 | Backup data processing method and device |
| CN201610919565.9A CN106547648A (en) | 2016-10-21 | 2016-10-21 | Backup data processing method and device |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610919565.9A Division CN106547648A (en) | 2016-10-21 | 2016-10-21 | Backup data processing method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114116313A true CN114116313A (en) | 2022-03-01 |
Family
ID=58392172
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111418480.XA Pending CN114116313A (en) | 2016-10-21 | 2016-10-21 | Backup data processing method and device |
| CN201610919565.9A Pending CN106547648A (en) | 2016-10-21 | 2016-10-21 | Backup data processing method and device |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610919565.9A Pending CN106547648A (en) | 2016-10-21 | 2016-10-21 | Backup data processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN114116313A (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114116313A (en) * | 2016-10-21 | 2022-03-01 | 上海嘉楠捷思信息技术有限公司 | Backup data processing method and device |
| CN107193490B (en) * | 2017-05-16 | 2020-04-17 | 北京中星仝创科技有限公司 | Distributed data storage system and method based on block chain |
| CN107577948B (en) * | 2017-08-22 | 2021-03-19 | 北京奇虎科技有限公司 | Vulnerability repairing method and device |
| CN109558064B (en) * | 2017-09-25 | 2022-06-07 | 航天信息股份有限公司 | Electronic invoice data chain synchronization method, device, medium and electronic equipment |
| CN108573016A (en) * | 2017-12-25 | 2018-09-25 | 北京金山云网络技术有限公司 | A kind of data consistent check method, apparatus, equipment and storage medium |
| CN108614750A (en) * | 2018-04-27 | 2018-10-02 | 中国联合网络通信集团有限公司 | The restoration methods and device of delay machine data |
| CN109558276A (en) * | 2018-11-30 | 2019-04-02 | 弗洛格（武汉）信息科技有限公司 | Block chain standby system, backup method and block chain verification method, verifying system |
| CN112015596B (en) * | 2020-10-20 | 2021-05-28 | 支付宝(杭州)信息技术有限公司 | Block chain data recovery method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004259229A (en) * | 2003-02-28 | 2004-09-16 | Seiko Precision Inc | Database with guarantee of data authenticity, its backup system, and method |
| CN102930185A (en) * | 2012-11-28 | 2013-02-13 | 中国人民解放军国防科学技术大学 | Method and device for verifying integrity of security critical data of program in process of running |
| JP2013097566A (en) * | 2011-10-31 | 2013-05-20 | Fujitsu Ltd | Synchronization method, synchronization program and information processing device |
| CN106547648A (en) * | 2016-10-21 | 2017-03-29 | 杭州嘉楠耘智信息科技有限公司 | Backup data processing method and device |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001043344A1 (en) * | 1999-12-13 | 2001-06-14 | Rsa Security Inc. | System and method for generating and managing attribute certificates |
| JP2005051734A (en) * | 2003-07-15 | 2005-02-24 | Hitachi Ltd | Electronic document authenticity assurance method and electronic document disclosure system |
| CN101853194B (en) * | 2009-04-03 | 2011-12-14 | 纬创资通股份有限公司 | Data backup method |
| US20140245020A1 (en) * | 2013-02-22 | 2014-08-28 | Guardtime Ip Holdings Limited | Verification System and Method with Extra Security for Lower-Entropy Input Records |
| CN106021002B (en) * | 2016-04-29 | 2020-11-06 | 上海庆科信息技术有限公司 | Data reading and writing method and device for embedded equipment |
-
2016
- 2016-10-21 CN CN202111418480.XA patent/CN114116313A/en active Pending
- 2016-10-21 CN CN201610919565.9A patent/CN106547648A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004259229A (en) * | 2003-02-28 | 2004-09-16 | Seiko Precision Inc | Database with guarantee of data authenticity, its backup system, and method |
| JP2013097566A (en) * | 2011-10-31 | 2013-05-20 | Fujitsu Ltd | Synchronization method, synchronization program and information processing device |
| CN102930185A (en) * | 2012-11-28 | 2013-02-13 | 中国人民解放军国防科学技术大学 | Method and device for verifying integrity of security critical data of program in process of running |
| CN106547648A (en) * | 2016-10-21 | 2017-03-29 | 杭州嘉楠耘智信息科技有限公司 | Backup data processing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106547648A (en) | 2017-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114116313A (en) | Backup data processing method and device | |
| US10630463B2 (en) | Meta block chain | |
| US11074139B2 (en) | Dynamic block chain system using metadata for backing up data based on digest rules | |
| CN108334753B (en) | Pirate application verification method and distributed server node | |
| EP3316160A1 (en) | Authentication method and apparatus for reinforced software | |
| CN110704464B (en) | Method and device for processing bifurcation problem | |
| CN113704718B (en) | Computer data protection system based on identity authentication | |
| CN110990814A (en) | Trusted digital identity authentication method, system, equipment and medium | |
| CN109145651B (en) | Data processing method and device | |
| CN111177693A (en) | Method, device, equipment and medium for verifying terminal root certificate | |
| CN108184146B (en) | Method for calculating popularity of live broadcast platform and related equipment | |
| CN114329622A (en) | File protection method, verification method, device, equipment and medium | |
| CN104993932A (en) | Method for improving signature safety | |
| WO2017197869A1 (en) | Version file checking method and apparatus, encryption method and apparatus, and storage medium | |
| CN111861475B (en) | Transaction recovery method and device for digital asset and electronic equipment | |
| CN112231754B (en) | Method, system and storage medium for monitoring configuration information of power edge computing node | |
| CN111680325A (en) | Data escorting method and device | |
| CN107391970A (en) | Function access control method and device in Flash application programs | |
| CN115935414A (en) | Block chain based data verification method and device, electronic equipment and storage medium | |
| CN109960949A (en) | A kind of data storage verification method and device | |
| CN112738006B (en) | Identification method, equipment and storage medium | |
| CN111191273B (en) | Method and device for processing document, electronic equipment and readable storage medium | |
| CN113806792A (en) | File cloud storage method and device, readable storage medium and electronic equipment | |
| JP2011013428A (en) | Information processing apparatus, code generation method, code verifying method, and program | |
| US20150113243A1 (en) | Method for backing up data outside a secure microcircuit |
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 |