CN113254397B - Data checking method and computing device - Google Patents
Data checking method and computing device Download PDFInfo
- Publication number
- CN113254397B CN113254397B CN202110658467.5A CN202110658467A CN113254397B CN 113254397 B CN113254397 B CN 113254397B CN 202110658467 A CN202110658467 A CN 202110658467A CN 113254397 B CN113254397 B CN 113254397B
- Authority
- CN
- China
- Prior art keywords
- file
- data
- block
- hash value
- deleted
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
- G06F16/137—Hash-based
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/14—Details of searching files based on file metadata
- G06F16/148—File search processing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Library & Information Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a data checking method, which is executed in computing equipment and comprises the following steps: acquiring a plurality of block files corresponding to file data, wherein the plurality of block files comprise process data generated in a data checking process; checking whether the deleted block file exists in the deletion list to determine whether the deleted block file is restored; respectively calculating the hash values of the plurality of block files, and calculating to obtain a root hash value to be verified according to the hash values of the plurality of block files; and comparing the root hash value to be verified with a root hash value stored in the computing device to determine whether the file data is modified. The invention also discloses corresponding computing equipment. The data checking method is beneficial to improving the efficiency of checking the integrity of the data and ensuring the safety of the data.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a data checking method and a computing device.
Background
At present, when metadata is encrypted, file data is generally divided into block files of fixed sizes in order to prevent data information leakage. Even if these block files are obtained, an attacker cannot acquire information such as the directory structure, file name, and file size of the metadata. However, during transmission or storage of these encrypted block files, the data content may still be tampered by attackers, and specific tampering means includes, for example, modifying the data behind the block file, replacing with an old version of the block file, recovering the deleted block file, and so on.
According to the prior art scheme, an ID check is added to the block file. Specifically, the program generates a random ID value as the file name of the block file, and stores the ID value in the header of the block file. If the attacker replaces the block file with other content, the comparison is carried out according to the file name and the ID in the decrypted block file when the program carries out self-checking, and if the file name and the ID are not equal, the block file is replaced or modified. The scheme cannot cover a plurality of scenes, and when an attacker recovers the deleted block file or replaces the deleted block file with a file of an old version, the scheme cannot meet the inspection requirement.
In the prior art, there is another scheme that an ID number is added to a block file, and a version number is added, all versions of the block file are the same at the same time, and if an attacker wants to replace the block file with a block file of a previous version, the version numbers are found to be inconsistent when checking the version numbers. The scheme can not cover a plurality of scenes, only can prevent an attacker from replacing the block files, but can not prevent the attacker from tampering the data, in addition, the scheme calculates one hash value for each block file, and traverses and compares whether all the values are equal or not during the check, and because the number of the block files generated by the metadata encryption is large, the traversal and comparison of the whole amount of data not only consumes time, but also can greatly reduce the program performance.
Therefore, according to the data integrity checking method in the prior art, only part of the problems can be solved, a plurality of scenes cannot be covered, and the checking efficiency is low.
For this reason, a data inspection method is required to solve the problems in the above technical solutions.
Disclosure of Invention
To this end, the present invention provides a data inspection method in an attempt to solve or at least alleviate the above-presented problems.
According to an aspect of the present invention, there is provided a data checking method, executed in a computing device, comprising the steps of: acquiring a plurality of block files corresponding to file data, wherein the plurality of block files comprise process data generated in a data checking process; checking whether the deleted block file exists in the deletion list to determine whether the deleted block file is restored; respectively calculating the hash values of the plurality of block files, and calculating to obtain a root hash value to be verified according to the hash values of the plurality of block files; and comparing the root hash value to be verified with a root hash value stored in the computing device to determine whether the file data is modified.
Optionally, in the data checking method according to the present invention, further comprising the steps of: acquiring process data generated in a data checking process, wherein the process data comprises first process data corresponding to checking whether a deleted block file is recovered and second process data corresponding to checking whether the file data is modified; the process data is stored in a corresponding block file for review.
Optionally, in the data checking method according to the present invention, the obtaining the plurality of block files corresponding to the file data includes: and acquiring a block file corresponding to the process data in real time.
Optionally, in the data checking method according to the present invention, storing the process data in a corresponding block file includes: and storing the first process data and the second process data in a first block file and a second block file respectively.
Optionally, in the data checking method according to the present invention, the first block file includes a first identifier, the second block file includes a second identifier, the first identifier and the second identifier are suitable for being stored in a root file system, and the step of obtaining a plurality of block files corresponding to the file data includes: acquiring a first identifier and a second identifier from a root file system; and acquiring a first block file based on the first identifier and acquiring a second block file based on the second identifier.
Alternatively, in the data checking method according to the present invention, the step of checking whether the deleted block file exists in the deletion list includes: calculating the deleted block files respectively based on a plurality of hash functions to obtain a hash value set; and determining a plurality of corresponding bits in the storage structure according to the hash value set, and if each bit is a target value, determining that the deleted block file exists in a deletion list.
Optionally, in the data checking method according to the present invention, the step of determining whether the deleted block file is restored includes: determining that the deleted block file is not restored if the deleted block file exists in the deletion list; the step of determining whether the file data is modified includes: determining that the file data is not modified if the root hash value to be verified is equal to a root hash value stored in the computing device.
Optionally, in the data checking method according to the present invention, before obtaining the plurality of block files corresponding to the file data, the method includes: encrypting file data to generate a plurality of block files; respectively calculating hash values of the plurality of block files, and calculating to obtain a root hash value according to the hash values of the plurality of block files; saving the root hash value in a computing device.
Optionally, in the data checking method according to the present invention, whether the deleted block file exists in the deletion list is checked in real time based on a bloom filter to determine whether the deleted block file is restored; and calculating the hash value of the block files based on the Merkle Tree to obtain the root hash value to be verified.
Optionally, in the data checking method according to the present invention, if it is determined that the deleted block file is not restored and it is determined that the file data is not modified, it is determined that the file data is complete.
According to an aspect of the present invention, there is provided a computing device comprising: at least one processor; and a memory storing program instructions, wherein the program instructions are configured to be executed by the at least one processor, the program instructions comprising instructions for performing the data inspection method as described above.
According to an aspect of the present invention, there is provided a readable storage medium storing program instructions which, when read and executed by a computing device, cause the computing device to perform the method as described above.
According to the technical scheme of the invention, the data checking method is provided, when the encrypted file data is checked, the root hash value is calculated based on the hash values of a plurality of block files corresponding to the file data, whether the file data is modified is judged by checking the root hash value, and the way of checking the root hash value is obviously simpler, so that the time spent on checking whether the data is modified is shorter, and the data checking efficiency is improved. And, by storing the process data generated during the data inspection process in the corresponding block file, the generated process data is also inspected during the inspection process of the file data. Therefore, a safe closed loop in the process of checking the integrity of the file data can be realized, and the data is ensured to be safe and reliable.
Drawings
To the accomplishment of the foregoing and related ends, certain illustrative aspects are described herein in connection with the following description and the annexed drawings, which are indicative of various ways in which the principles disclosed herein may be practiced, and all aspects and equivalents thereof are intended to be within the scope of the claimed subject matter. The above and other objects, features and advantages of the present disclosure will become more apparent from the following detailed description read in conjunction with the accompanying drawings. Throughout this disclosure, like reference numerals generally refer to like parts or elements.
FIG. 1 shows a schematic diagram of a computing device 100, according to one embodiment of the invention;
FIG. 2 shows a flow diagram of a data inspection method 200 according to one embodiment of the invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
Fig. 1 is a schematic block diagram of an example computing device 100.
As shown in FIG. 1, in a basic configuration 102, a computing device 100 typically includes a system memory 106 and one or more processors 104. A memory bus 108 may be used for communication between the processor 104 and the system memory 106.
Depending on the desired configuration, the processor 104 may be any type of processing, including but not limited to: a microprocessor (UP), a microcontroller (UC), a digital information processor (DSP), or any combination thereof. The processor 104 may include one or more levels of cache, such as a level one cache 110 and a level two cache 112, a processor core 114, and registers 116. The example processor core 114 may include an Arithmetic Logic Unit (ALU), a Floating Point Unit (FPU), a digital signal processing core (DSP core), or any combination thereof. The example memory controller 118 may be used with the processor 104, or in some implementations the memory controller 118 may be an internal part of the processor 104.
Depending on the desired configuration, system memory 106 may be any type of memory, including but not limited to: volatile memory (such as RAM), non-volatile memory (such as ROM, flash memory, etc.), or any combination thereof. System memory 106 may include an operating system 120, one or more applications 122, and program data 124. In some implementations, the application 122 can be arranged to execute instructions on an operating system with program data 124 by one or more processors 104.
Computing device 100 also includes a storage device 132, storage device 132 including removable storage 136 and non-removable storage 138.
Computing device 100 may also include a storage interface bus 134. The storage interface bus 134 enables communication from the storage devices 132 (e.g., removable storage 136 and non-removable storage 138) to the basic configuration 102 via the bus/interface controller 130. Operating system 120, applications 122, and at least a portion of program data 124 may be stored on removable storage 136 and/or non-removable storage 138, and loaded into system memory 106 via storage interface bus 134 and executed by one or more processors 104 when computing device 100 is powered on or applications 122 are to be executed.
Computing device 100 may also include an interface bus 140 that facilitates communication from various interface devices (e.g., output devices 142, peripheral interfaces 144, and communication devices 146) to the basic configuration 102 via the bus/interface controller 130. The example output device 142 includes an image processing unit 148 and an audio processing unit 150. They may be configured to facilitate communication with various external devices, such as a display or speakers, via one or more a/V ports 152. Example peripheral interfaces 144 may include a serial interface controller 154 and a parallel interface controller 156, which may be configured to facilitate communication with external devices such as input devices (e.g., keyboard, mouse, pen, voice input device, touch input device) or other peripherals (e.g., printer, scanner, etc.) via one or more I/O ports 158. An example communication device 146 may include a network controller 160, which may be arranged to facilitate communications with one or more other computing devices 162 over a network communication link via one or more communication ports 164.
A network communication link may be one example of a communication medium. Communication media may typically be embodied by computer readable instructions, data structures, program modules, and may include any information delivery media, such as carrier waves or other transport mechanisms, in a modulated data signal. A "modulated data signal" may be a signal that has one or more of its data set or its changes made in a manner that encodes information in the signal. By way of non-limiting example, communication media may include wired media such as a wired network or private-wired network, and various wireless media such as acoustic, Radio Frequency (RF), microwave, Infrared (IR), or other wireless media. The term computer readable media as used herein may include both storage media and communication media.
Computing device 100 may be implemented as a personal computer including both desktop and notebook computer configurations. Of course, computing device 100 may also be implemented as part of a small-form factor portable (or mobile) electronic device such as a cellular telephone, a digital camera, a Personal Digital Assistant (PDA), a personal media player device, a wireless web-watch device, a personal headset, an application specific device, or a hybrid device that include any of the above functions. And may even be implemented as a server, such as a file server, a database server, an application server, a WEB server, and so forth. The embodiments of the present invention are not limited thereto.
In an embodiment in accordance with the invention, the computing device 100 is configured to perform a data inspection method 200 in accordance with the invention. Among other things, the application 122 of the computing device 100 contains a plurality of program instructions for executing the data checking method 200 of the present invention, which can be read and executed by the computing device 100, so that the computing device 100 executes the data checking method 200 according to the present invention.
Before the data checking method 200 of the present invention is executed, a plurality of block files corresponding to file data are generated by encrypting the file data (metadata), so that data is transmitted or stored based on the encrypted plurality of block files. And then, respectively calculating the hash values of the plurality of block files, combining and calculating according to the hash values of the plurality of block files to obtain a root hash value, and storing the root hash value locally in the computing equipment so as to be used for verifying the data in the data checking process.
In one embodiment, the hash values corresponding to the chunk files may be merged from bottom to top based on Merkle Tree (merkel Tree), and finally, the root hash value is obtained through calculation.
It should be noted that the present invention is not limited to the specific method for encrypting the file data, and all methods capable of encrypting the metadata in the prior art are within the scope of the present invention.
According to the data checking method 200 of the present invention, integrity check can be performed on the plurality of block files corresponding to the file data to check whether the plurality of block files corresponding to the file data are tampered during transmission or storage, and whether the data is complete.
FIG. 2 shows a flow diagram of a data inspection method 200 according to one embodiment of the invention.
As shown in fig. 2, the method 200 begins at step S210.
In step S210, a plurality of block files corresponding to the file data are acquired.
Subsequently, in step S220, it is checked in real time whether the deleted block file exists in the deletion list to determine whether the deleted block file is restored. Here, the deletion list is used to record the deleted file. Specifically, if the deleted block file exists in the deletion list, it is determined that the deleted block file is not restored. On the contrary, if the deleted block file is not in the deletion list, it is determined that the deleted block file is restored.
According to one embodiment, a Bloom Filter (Bloom Filter) is included in the computing device, where the Bloom algorithm of the Bloom Filter is used to determine whether an element is in a collection, so that the deleted blocks file can be checked in real time for the presence in the deletion list based on the way the Bloom Filter (Bloom Filter) determines whether the element is in the collection to determine whether the deleted files are restored.
In step S230, hash values of the plurality of block files are respectively calculated, and a root hash value to be verified is calculated according to the hash values of the plurality of block files.
Subsequently, in step S240, the root hash value to be verified is compared with the root hash value stored locally by the computing device to determine whether the file data (a plurality of block files corresponding to the file data) is modified. Specifically, if the root hash value to be verified is equal to the root hash value locally stored in the computing device, determining that the plurality of block files corresponding to the file data are not modified; otherwise, if the root hash value to be verified is not equal to the root hash value stored locally in the computing device, determining that the plurality of block files corresponding to the file data are modified.
It should be noted that according to the inventive data checking method, if it is determined in step S210 that the deleted block file is not restored and it is determined in step S240 that the file data is not modified, it may be determined that the file data is complete, i.e., the integrity check on the file data passes and is not tampered.
According to one embodiment, a Merkle Tree may be utilized to check whether file data has been modified. Specifically, the root hash value to be verified is calculated according to the hash values of the plurality of block files based on the Merkle Tree, that is, the root hash value to be verified is obtained by performing combined calculation from bottom to top on the plurality of hash values corresponding to the plurality of block files based on the Merkle Tree. And then, whether the file data is modified or not is judged by comparing the root hash value to be verified with the root hash value stored locally in the computing device.
The specific implementation method for calculating the root hash value based on the Merkle Tree is as follows:
first assume that there is a data block { DataBlock }1,DataBlock2,DataBlock3,DataBlock4Respectively carrying out hash calculation on the data blocks based on a hash function to obtain corresponding hash values { H }1,H2,H3,H4}. Then, further for { H1,H2,H3,H4Hash calculation is carried out to obtain { H }12,H34H, in particular, by pair H1And H2H is obtained by Hash calculation12To H3And H4H is obtained by Hash calculation34. Finally, for H12And H34Carrying out Hash calculation to obtain a final root Hash value H1234。
It should be noted that, the root hash value is calculated based on the hash values of the plurality of block files, and whether the file data is modified is judged by checking the root hash value, so that compared with the prior art that the hash values of the plurality of block files are checked, the method for checking the root hash value is obviously simpler, the time spent is shorter, and the efficiency of data checking is improved to a great extent.
According to an embodiment of the present invention, the plurality of block files acquired in step S210 further include process data generated during the data checking process performed according to the method 200 of the present invention. Specifically, in the process of checking the file data, that is, in the process of executing steps S220 to S240, the process data generated in the data checking process is obtained in real time, and the process data specifically includes first process data corresponding to whether the deleted block file is checked to be restored in step S220 and second process data corresponding to whether the file data is checked to be modified in steps S230 to S240. And storing the acquired first and second process data in corresponding block files. In this way, when step S210 is executed, the block file corresponding to the process data may be acquired in real time, that is, the acquired plurality of block files include the block file corresponding to the process data, so as to synchronously perform integrity check on the process data when the method 200 is executed.
According to one embodiment, the first process data and the second process data may be stored separately. Specifically, first process data is stored in a first block file and second process data is stored in a second block file. The first block file comprises a first identification uniquely corresponding to the first block file, and the second block file comprises a second identification uniquely corresponding to the second block file. In one embodiment, the first identifier and the second identifier can be stored in a preset position of the root file system, so that nested storage of the process data is realized, and data leakage can be prevented. Based on this, when acquiring a plurality of block files corresponding to file data, first acquiring a first identifier and a second identifier from a predetermined position of the root file system, and then acquiring the first block file based on the first identifier and the second block file based on the second identifier, so as to acquire the block file corresponding to the process data, so that the process data generated in the checking process can be checked when executing the method 200 of the present invention.
It should be noted that, in the present invention, the process data generated in the data checking process is stored in the corresponding block file, and in the checking process of the file data, the generated process data is also checked. It should be understood that when the process data is modified, the root hash value to be verified is also changed and fails to be verified. Therefore, a safe closed loop for the integrity check process of the file data is realized, and the data is ensured to be safe and reliable.
According to one embodiment, if a block file of file data is deleted, the deleted block file is recorded in a deletion list prior to performing method 200. In one embodiment, the deleted blocks file may be recorded based on a Bloom Filter (Bloom Filter).
Specifically, an array of a plurality (m) of bits is obtained, and each bit is initialized to 0. And obtains a plurality of (k) Hash functions, e.g., { Hash }1，Hash2,…HashkIs based on k hash functionsRespectively calculating the deleted block files b to obtain a hash value set { H) corresponding to the block files b1，H2,…Hk}. Finally, the bit is set to 1 according to the position of the hash value set in the corresponding storage structure. Here, 1 is a target value for comparison when subsequently checking whether the deleted block file is restored.
Accordingly, according to an embodiment, the method for determining whether the element is in the set based on the Bloom Filter to check whether the deleted block file exists in the deletion list may specifically be performed according to the following steps:
firstly, the deleted block files t are respectively calculated based on a plurality of hash functions to obtain a hash value set. In particular, based on k Hash functions { Hash }1，Hash2,…HashkRespectively calculating the deleted block files t to obtain hash value sets { H } corresponding to the deleted block files t1，H2,…HkHere, H1=Hash1(t)，H2=Hash2(t)…Hk=Hashk(t)。
Subsequently, a plurality of corresponding bits in the storage structure are determined according to the hash value set, and if each bit is the target value 1, it is determined that the deleted block file t exists in the deletion list, which means that the deleted file t is not restored. Conversely, if the value of one or more bits is not the target value (0), it is determined that the deleted file is not in the deletion list, indicating that the deleted file is restored.
The following details the advantages of the method 200 according to the present invention in terms of efficiency of querying deleted files when checking deleted block files:
here, the size of the file is represented as size, the fixed size of the block file is represented as f, and then the number of block files is
. It is understood that if the value of f is small, a large number of block files are generated when encrypting file data, which makes it difficult for a program to operate and reduces the number of files that the program has to executeThe efficiency of the operation of (1). Based on this, currently, the size of a block file is generally about 32KB in the mainstream encryption tool for metadata, and with this encryption tool, if 1GB of file data is to be stored, about 32768 block files are to be generated, which results in an excessive number of block files in practical use. It is assumed below that the number of block files to be inserted n = n
Analyzing the query efficiency of the deleted block file:
here, some calculation formulas of Bloom Filter are listed:
the formula I is as follows: the optimal array size is:
the formula II is as follows: the optimal number of Hash functions:
in one embodiment, assuming that the false positive probability p =0.0001 at this time, n block files are all inserted, and after calculation by formula one, the obtained optimal array size is about
. After the calculation of the second expression, the number of the obtained optimal Hash function is about
And (4) respectively.
When the existing scheme is adopted for query, if a certain element is in a set and a conventional map structure is adopted, the execution is carried out in the worst case
Secondary traversal checking, c elements are searched at the same time and executed
Next, the process is carried out. If an element is not in the set, using the conventional map structure, it is necessary to traverse
The query result can be obtained. By adopting the scheme provided by the invention, only k times of query verification is needed to be executed, and if c elements are queried simultaneously, the execution is carried out
Next, the process is carried out. Comparing the query times of the prior art scheme and the technical scheme of the invention to obtain a ratio
. In the present embodiment, it is preferred that,
. If an element is not in the set, then the probability of being queried for the first time in the set is approximately
And in the worst case k queries are required.
Therefore, according to the technical scheme of the invention, the query efficiency of the deleted block file is greatly improved, so that the data inspection efficiency can be improved.
According to the data inspection method 200 of the present invention, when the encrypted file data is inspected, the root hash value is calculated based on the hash values of the plurality of block files corresponding to the file data, and whether the file data is modified is determined by verifying the root hash value, and the way of verifying the root hash value is significantly simpler, so that the time spent in inspecting whether the data is modified is less, which is beneficial to improving the data inspection efficiency. And, by storing the process data generated during the data inspection process in the corresponding block file, the generated process data is also inspected during the inspection process of the file data. Therefore, a safe closed loop in the process of checking the integrity of the file data can be realized, and the data is ensured to be safe and reliable.
The various techniques described herein may be implemented in connection with hardware or software or, alternatively, with a combination of both. Thus, the methods and apparatus of the present invention, or certain aspects or portions thereof, may take the form of program code (i.e., instructions) embodied in tangible media, such as removable hard drives, U.S. disks, floppy disks, CD-ROMs, or any other machine-readable storage medium, wherein, when the program is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the invention.
In the case of program code execution on programmable computers, the computing device will generally include a processor, a storage medium readable by the processor (including volatile and non-volatile memory and/or storage elements), at least one input device, and at least one output device. Wherein the memory is configured to store program code; the processor is configured to execute the multilingual spam-text recognition method of the present invention according to instructions in said program code stored in the memory.
By way of example, and not limitation, readable media may comprise readable storage media and communication media. Readable storage media store information such as computer readable instructions, data structures, program modules or other data. Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. Combinations of any of the above are also included within the scope of readable media.
In the description provided herein, algorithms and displays are not inherently related to any particular computer, virtual system, or other apparatus. Various general purpose systems may also be used with examples of this invention. The required structure for constructing such a system will be apparent from the description above. Moreover, the present invention is not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.
In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules or units or components of the devices in the examples disclosed herein may be arranged in a device as described in this embodiment or alternatively may be located in one or more devices different from the devices in this example. The modules in the foregoing examples may be combined into one module or may be further divided into multiple sub-modules.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments described herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.
Furthermore, some of the described embodiments are described herein as a method or combination of method elements that can be performed by a processor of a computer system or by other means of performing the described functions. A processor having the necessary instructions for carrying out the method or method elements thus forms a means for carrying out the method or method elements. Further, the elements of the apparatus embodiments described herein are examples of the following apparatus: the apparatus is used to implement the functions performed by the elements for the purpose of carrying out the invention.
As used herein, unless otherwise specified the use of the ordinal adjectives "first", "second", "third", etc., to describe a common object, merely indicate that different instances of like objects are being referred to, and are not intended to imply that the objects so described must be in a given sequence, either temporally, spatially, in ranking, or in any other manner.
While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of this description, will appreciate that other embodiments can be devised which do not depart from the scope of the invention as described herein. Furthermore, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the appended claims. The present invention has been disclosed in an illustrative rather than a restrictive sense, and the scope of the present invention is defined by the appended claims.
Claims (9)
1. A data inspection method, implemented in a computing device, comprising the steps of:
acquiring a plurality of block files corresponding to file data, wherein the plurality of block files comprise process data generated in a data checking process;
checking whether the deleted block file exists in the deletion list to determine whether the deleted block file is restored;
respectively calculating the hash values of the plurality of block files, and calculating to obtain a root hash value to be verified according to the hash values of the plurality of block files;
comparing the root hash value to be verified with a root hash value stored in the computing device to determine whether the file data is modified;
acquiring process data generated in a data checking process, wherein the process data comprises first process data corresponding to checking whether a deleted block file is recovered and second process data corresponding to checking whether the file data is modified; and
the process data is stored in a corresponding block file for review.
2. The method of claim 1, wherein obtaining a plurality of block files corresponding to file data comprises:
and acquiring a block file corresponding to the process data in real time.
3. The method of claim 1, wherein storing the process data in a respective block file comprises:
and storing the first process data and the second process data in a first block file and a second block file respectively.
4. The method of claim 3, wherein the first block file comprises a first identifier, the second block file comprises a second identifier, the first identifier and the second identifier are suitable for being stored in a root file system, and the step of obtaining the plurality of block files corresponding to the file data comprises:
acquiring a first identifier and a second identifier from a root file system;
and acquiring a first block file based on the first identifier and acquiring a second block file based on the second identifier.
5. The method of any one of claims 1-4, wherein the step of checking whether the deleted block file exists in a deletion list comprises:
calculating the deleted block files respectively based on a plurality of hash functions to obtain a hash value set;
and determining a plurality of corresponding bits in the storage structure according to the hash value set, and if each bit is a target value, determining that the deleted block file exists in a deletion list.
6. The method of any of claims 1-4, wherein determining whether the deleted blocks file is restored comprises:
determining that the deleted block file is not restored if the deleted block file exists in the deletion list;
the step of determining whether the file data is modified includes:
determining that the file data is not modified if the root hash value to be verified is equal to a root hash value stored in the computing device.
7. The method according to any one of claims 1 to 4, comprising, before obtaining a plurality of block files corresponding to file data, the steps of:
encrypting file data to generate a plurality of block files;
respectively calculating hash values of the plurality of block files, and calculating to obtain a root hash value according to the hash values of the plurality of block files;
saving the root hash value in a computing device.
8. A computing device, comprising:
at least one processor; and
a memory storing program instructions, wherein the program instructions are configured to be adapted to be executed by the at least one processor, the program instructions comprising instructions for performing the method of any of claims 1-7.
9. A readable storage medium storing program instructions which, when read and executed by a computing device, cause the computing device to perform the method of any of claims 1-7.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111020916.XA CN113704182B (en) | 2021-06-15 | 2021-06-15 | Data checking method and computing device |
| CN202110658467.5A CN113254397B (en) | 2021-06-15 | 2021-06-15 | Data checking method and computing device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110658467.5A CN113254397B (en) | 2021-06-15 | 2021-06-15 | Data checking method and computing device |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111020916.XA Division CN113704182B (en) | 2021-06-15 | 2021-06-15 | Data checking method and computing device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113254397A CN113254397A (en) | 2021-08-13 |
| CN113254397B true CN113254397B (en) | 2021-10-15 |
Family
ID=77187985
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111020916.XA Active CN113704182B (en) | 2021-06-15 | 2021-06-15 | Data checking method and computing device |
| CN202110658467.5A Active CN113254397B (en) | 2021-06-15 | 2021-06-15 | Data checking method and computing device |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111020916.XA Active CN113704182B (en) | 2021-06-15 | 2021-06-15 | Data checking method and computing device |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN113704182B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113836157A (en) * | 2021-09-18 | 2021-12-24 | 上海安钛飞信息技术有限公司 | Method and device for acquiring incremental data of database |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106294585A (en) * | 2016-07-28 | 2017-01-04 | 四川新环佳科技发展有限公司 | A kind of storage method under cloud computing platform |
| CN106815530A (en) * | 2016-12-26 | 2017-06-09 | 北京爱接力科技发展有限公司 | Data deposit card method, data verification method and device |
| CN110162964A (en) * | 2019-05-29 | 2019-08-23 | 中国银行股份有限公司 | A kind of inspection method that file is distorted, apparatus and system |
| CN112470140A (en) * | 2018-06-06 | 2021-03-09 | 吴英全 | Block-based deduplication |
| CN112596771A (en) * | 2020-12-01 | 2021-04-02 | 北京明朝万达科技股份有限公司 | Method and system for uninterrupted service upgrade |
Family Cites Families (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7421660B2 (en) * | 2003-02-04 | 2008-09-02 | Cataphora, Inc. | Method and apparatus to visually present discussions for data mining purposes |
| WO2010019916A1 (en) * | 2008-08-14 | 2010-02-18 | The Trustees Of Princeton University | Hardware trust anchors in sp-enabled processors |
| CN101976322B (en) * | 2010-11-11 | 2012-05-23 | 清华大学 | Safety metadata management method based on integrality checking |
| CN102629310A (en) * | 2012-02-29 | 2012-08-08 | 卡巴斯基实验室封闭式股份公司 | System and method for protecting computer system from being infringed by activities of malicious objects |
| CN102902926A (en) * | 2012-10-11 | 2013-01-30 | 长春理工大学 | Website file anti-tampering method based on distributed file synchronization technology |
| US9304998B2 (en) * | 2012-12-19 | 2016-04-05 | Microsoft Technology Licensing, Llc | Main-memory database checkpointing |
| CN105653554B (en) * | 2014-11-14 | 2019-07-16 | 卓望数码技术（深圳）有限公司 | A kind of file data comparison method and system |
| CN104778410B (en) * | 2015-04-16 | 2017-07-11 | 电子科技大学 | A kind of application integrity verification method |
| CN105468686A (en) * | 2015-11-17 | 2016-04-06 | 北京奇虎科技有限公司 | Method and device for reducing redundant data |
| US11177961B2 (en) * | 2017-12-07 | 2021-11-16 | Nec Corporation | Method and system for securely sharing validation information using blockchain technology |
| CN109657499A (en) * | 2018-10-31 | 2019-04-19 | 深圳市网心科技有限公司 | Metadata validation method, system server and computer readable storage medium |
| CN109889505B (en) * | 2019-01-23 | 2022-05-27 | 平安科技（深圳）有限公司 | Data consistency verification method and terminal equipment |
| CN110264187B (en) * | 2019-01-23 | 2021-06-04 | 腾讯科技（深圳）有限公司 | Data processing method and device, computer equipment and storage medium |
| CN110503558B (en) * | 2019-08-29 | 2023-10-03 | 深圳前海微众银行股份有限公司 | Processing method and device based on block chain system |
| SG11202002587TA (en) * | 2019-09-12 | 2020-04-29 | Alibaba Group Holding Ltd | Log-structured storage systems |
| CN111400261A (en) * | 2020-01-21 | 2020-07-10 | 行星算力(深圳)科技有限公司 | Method for rapidly adding or deleting folders by IPFS (Internet protocol file system) |
| CN111897675B (en) * | 2020-06-16 | 2024-04-09 | 东南大学 | Method for restoring recently deleted files of F2FS file system at mobile phone end |
-
2021
- 2021-06-15 CN CN202111020916.XA patent/CN113704182B/en active Active
- 2021-06-15 CN CN202110658467.5A patent/CN113254397B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106294585A (en) * | 2016-07-28 | 2017-01-04 | 四川新环佳科技发展有限公司 | A kind of storage method under cloud computing platform |
| CN106815530A (en) * | 2016-12-26 | 2017-06-09 | 北京爱接力科技发展有限公司 | Data deposit card method, data verification method and device |
| CN112470140A (en) * | 2018-06-06 | 2021-03-09 | 吴英全 | Block-based deduplication |
| CN110162964A (en) * | 2019-05-29 | 2019-08-23 | 中国银行股份有限公司 | A kind of inspection method that file is distorted, apparatus and system |
| CN112596771A (en) * | 2020-12-01 | 2021-04-02 | 北京明朝万达科技股份有限公司 | Method and system for uninterrupted service upgrade |
Non-Patent Citations (2)
| Title |
|---|
| Maintaining consistency of file system by monitoring file system parameters at runtime using consistency checking rules;Aniket G. Meshram 等;《2015 4th International Conference on Reliability, Infocom Technologies and Optimization (ICRITO) (Trends and Future Directions)》;20151217;1-5 * |
| 云数据完整性校验与修复方案研究;吴靖钦;《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》;20200115(第01期);I137-116 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113254397A (en) | 2021-08-13 |
| CN113704182A (en) | 2021-11-26 |
| CN113704182B (en) | 2023-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3678346B1 (en) | Blockchain smart contract verification method and apparatus, and storage medium | |
| US20160188885A1 (en) | Software vulnerability analysis method and device | |
| US11563560B2 (en) | Blockchain-based data evidence storage method and apparatus | |
| CN110019640B (en) | Secret-related file checking method and device | |
| CN107566392B (en) | Detection method for error reporting type SQL injection, proxy server and storage medium | |
| CN112163412B (en) | Data verification method and device, electronic equipment and storage medium | |
| CN113553010A (en) | Optical disc file checking method, optical disc recording method and computing device | |
| WO2022222350A1 (en) | Method for encrypting data, and computing device | |
| CN113254397B (en) | Data checking method and computing device | |
| US20230153292A1 (en) | Ensuring consistent metadata across computing devices | |
| CN113094756A (en) | Data encryption method and computing device | |
| CN115248919A (en) | Method and device for calling function interface, electronic equipment and storage medium | |
| WO2018205689A1 (en) | File merging method, storage device, storage apparatus, and storage medium | |
| CN113094690A (en) | System and method for authentication of software | |
| CN114691617A (en) | Intelligent terminal data compression redundancy-prevention interaction method and device and related components | |
| WO2021098385A1 (en) | Method and apparatus for training gbdt model in trusted execution environment, and device | |
| CN112286457B (en) | Object deduplication method and device, electronic equipment and machine-readable storage medium | |
| CN111291001A (en) | Reading method and device of computer file, computer system and storage medium | |
| CN113536361B (en) | Method and device for realizing trusted reference library and computing equipment | |
| EP2779568A1 (en) | Access control method and mobile terminal which employs an access control method | |
| CN113254951B (en) | Data processing method and computing device | |
| CN109408290B (en) | Fragmented file recovery method and device based on InoDB and storage medium | |
| CN114116710A (en) | Data processing method, device and equipment based on block chain and storage medium | |
| CN109002710A (en) | A kind of detection method, device and computer readable storage medium | |
| US8265428B2 (en) | Method and apparatus for detection of data in a data store |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |