CN109657499A - Metadata validation method, system server and computer readable storage medium - Google Patents
Metadata validation method, system server and computer readable storage medium Download PDFInfo
- Publication number
- CN109657499A CN109657499A CN201811282637.9A CN201811282637A CN109657499A CN 109657499 A CN109657499 A CN 109657499A CN 201811282637 A CN201811282637 A CN 201811282637A CN 109657499 A CN109657499 A CN 109657499A
- Authority
- CN
- China
- Prior art keywords
- cryptographic hash
- metadata
- hash
- file
- node
- 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
- 238000010200 validation analysis Methods 0.000 title claims abstract description 40
- 238000010276 construction Methods 0.000 claims description 23
- 238000000034 method Methods 0.000 claims description 21
- 230000011218 segmentation Effects 0.000 claims description 11
- 230000008569 process Effects 0.000 claims description 10
- 238000013507 mapping Methods 0.000 claims description 5
- 238000004321 preservation Methods 0.000 abstract description 7
- 101100217298 Mus musculus Aspm gene Proteins 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000013524 data verification Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
Abstract
The present invention discloses a kind of metadata validation method, system, server and computer readable storage medium.Server of the present invention receives the metadata for the file that user terminal uploads, the metadata includes the traceable node Hash list in the Merkel tree constructed with multiple data blocks of the file, then, server calculates the root cryptographic Hash of Merkel tree according to traceable node Hash list, finally, server judges whether root cryptographic Hash is identical as the cryptographic Hash of file, if identical, determine that metadata validation passes through, and Preservation Metadata.Compared to the prior art, compared to the prior art, the present invention improves the safety of metadata write-in.
Description
Technical field
The present invention relates to block chain technical field, in particular to a kind of metadata validation method, system, server and calculating
Machine readable storage medium storing program for executing.
Background technique
Block chain technology have decentralization, information can not tamper the features such as, can be realized in many ways with block chain technology
The transaction event (for example, money transfer transactions, payment transaction, data trade etc.) of participation.For example, bank A and bank B are on block chain
It trades, then every other node can all know this transaction on the block chain, other participants can participate in together
Confirmation transaction accuracy, prevents distorting for information.Further, block chain is substantially the distribution based on intelligent contract
Database, user is when being written the block chain for a data file by a transaction node equipment on block chain
Block in, then the data file will be by reciprocity (Peer-to-peer, P2P) network sharing to all block chain nodes
It goes, forms the common recognition to the data file.
However, based on existing block chain common recognition mechanism, a user passes through a transaction node on block catenary system
Before block catenary system is written in the metadata of one data file by equipment, when block catenary system is by malicious attack or encryption equipment
System is decrypted, then rogue attacks person can use the metadata of loophole data falsification file (for example, the metadata includes first
Validation value, file size, file owner etc.) and the owner that tampers with a document, so that the leakage of non-public file is caused, alternatively,
Invalid data is caused to build consensus in block chain.
Therefore, the safety for how improving meta data file write-in has become a urgent problem to be solved.
Summary of the invention
In view of this, the present invention proposes a kind of metadata validation method, block chain node device and computer-readable storage
Medium, to improve the safety of metadata write-in.
Firstly, to achieve the above object, the present invention proposes a kind of metadata validation method, which comprises
Server receives the metadata for the file that user terminal uploads, and the metadata includes multiple data with the file
Traceable node Hash list in the Merkel tree of block construction；
Server calculates the root cryptographic Hash of the Merkel tree according to the traceable node Hash list；
Server judges whether described cryptographic Hash be identical as the cryptographic Hash of the file, if identical, determines the member
Data verification passes through, and saves the metadata.
Preferably, the preservation metadata includes:
Block chain is written in the metadata by server.
Preferably, before the metadata that the server receives that user terminal uploads, this method further include:
The file is cut into the data block of the first preset quantity by user terminal according to predetermined segmentation rules；
User terminal calculates corresponding first cryptographic Hash of each data block using predetermined hash algorithm, according to described
One cryptographic Hash and predetermined Merkel tree construction rule building Merkel tree.
Preferably, the predetermined segmentation rules include:
The data file is cut into the data block of identical first preset quantity of size of data；Alternatively,
First preset quantity is denoted as M, when M is the natural number more than or equal to 2, according to predetermined file
The mapping relations of magnitude range and cutting data block size determine the data block size that data file described in cutting obtains, according to
The character sequence of determining the data block size and the data file, data file described in cutting obtain the identical M- of size
1 data block, remaining after cutting is m-th data block.
Preferably, the predetermined Merkel tree construction rule includes:
Using each first cryptographic Hash as the most junior Hash value node of the Merkel tree；
Each first cryptographic Hash is grouped according to predetermined rule of classification to obtain several the first groupings,
For all first cryptographic Hash in each first grouping, one corresponding second is calculated using predetermined hash algorithm
Cryptographic Hash；
For the N cryptographic Hash being calculated, N is the natural number more than or equal to 2, and circulation executes following steps: working as institute
State N cryptographic Hash quantity only one when terminate cryptographic Hash calculating, most using the N cryptographic Hash as the Merkel tree
Higher level's Hash value node；Alternatively, when the quantity of the N cryptographic Hash has multiple, using each N cryptographic Hash as the Merck
The N grades of Hash value nodes reciprocal of your tree, if being grouped to obtain to all N cryptographic Hash according to predetermined rule of classification
Dry N grouping calculates a correspondence using predetermined hash algorithm for the N cryptographic Hash in each N grouping
N+1 cryptographic Hash.
Preferably, the predetermined rule of classification includes:
First grouping: the data block of cutting is ranked up according to the character sequence of the data file to be slit, root
Putting in order to be ranked up to obtain by corresponding first cryptographic Hash of each data block and breathed out by all first according to each data block
The first set of uncommon value composition, the first cryptographic Hash of the second preset quantity is selected according to collating sequence every time from the first set
It is grouped as one first, until the quantity of the first cryptographic Hash remaining in the first set is less than second present count
Amount is then grouped the first cryptographic Hash remaining in the first set as one first, terminates the first grouping process；
V grouping, V are more than or equal to 2 natural number: according to putting in order to V Hash for each -1 cryptographic Hash of V
Value is ranked up to obtain the V set being made of all V cryptographic Hash, selects every time from the V set according to collating sequence
The V cryptographic Hash of second preset quantity is grouped as a V, until the quantity of V cryptographic Hash remaining in the V set
Less than second preset quantity, then V cryptographic Hash work remaining in the V set is divided into a V grouping, terminated
V is grouped process.
In addition, to achieve the above object, the present invention also proposes a kind of metadata validation system, the system comprises mutually it
Between the server and user terminal that communicate to connect, the server is used for:
The metadata for the file that user terminal uploads is received, the metadata includes constructing with multiple data blocks of the file
Merkel tree in traceable node Hash list；
The root cryptographic Hash of the Merkel tree is calculated according to the traceable node Hash list；
Judge whether described cryptographic Hash be identical as the cryptographic Hash of the file, if identical, determines that the metadata is tested
Card passes through, and saves the metadata.
Preferably, the server is also used to:
Block chain is written into the metadata.
Preferably, the user terminal is used for:
The file is cut into the data block of the first preset quantity according to predetermined segmentation rules；
Corresponding first cryptographic Hash of each data block is calculated using predetermined hash algorithm, according to first Hash
Value and predetermined Merkel tree construction rule building Merkel tree.
Preferably, the predetermined segmentation rules include:
The data file is cut into the data block of identical first preset quantity of size of data；Alternatively,
First preset quantity is denoted as M, when M is the natural number more than or equal to 2, according to predetermined file
The mapping relations of magnitude range and cutting data block size determine the data block size that data file described in cutting obtains, according to
The character sequence of determining the data block size and the data file, data file described in cutting obtain the identical M- of size
1 data block, remaining after cutting is m-th data block.
Preferably, the predetermined Merkel tree construction rule includes:
Using each first cryptographic Hash as the most junior Hash value node of the Merkel tree；
Each first cryptographic Hash is grouped according to predetermined rule of classification to obtain several the first groupings,
For all first cryptographic Hash in each first grouping, one corresponding second is calculated using predetermined hash algorithm
Cryptographic Hash；
For the N cryptographic Hash being calculated, N is the natural number more than or equal to 2, and circulation executes following steps: working as institute
State N cryptographic Hash quantity only one when terminate cryptographic Hash calculating, most using the N cryptographic Hash as the Merkel tree
Higher level's Hash value node；Alternatively, when the quantity of the N cryptographic Hash has multiple, using each N cryptographic Hash as the Merck
The N grades of Hash value nodes reciprocal of your tree, if being grouped to obtain to all N cryptographic Hash according to predetermined rule of classification
Dry N grouping calculates a correspondence using predetermined hash algorithm for the N cryptographic Hash in each N grouping
N+1 cryptographic Hash.
Preferably, the predetermined rule of classification includes:
First grouping: the data block of cutting is ranked up according to the character sequence of the data file to be slit, root
Putting in order to be ranked up to obtain by corresponding first cryptographic Hash of each data block and breathed out by all first according to each data block
The first set of uncommon value composition, the first cryptographic Hash of the second preset quantity is selected according to collating sequence every time from the first set
It is grouped as one first, until the quantity of the first cryptographic Hash remaining in the first set is less than second present count
Amount is then grouped the first cryptographic Hash remaining in the first set as one first, terminates the first grouping process.
V grouping, V are more than or equal to 2 natural number: according to putting in order to V Hash for each -1 cryptographic Hash of V
Value is ranked up to obtain the V set being made of all V cryptographic Hash, selects every time from the V set according to collating sequence
The V cryptographic Hash of second preset quantity is grouped as a V, until the quantity of V cryptographic Hash remaining in the V set
Less than second preset quantity, then V cryptographic Hash work remaining in the V set is divided into a V grouping, terminated
V is grouped process.
In addition, to achieve the above object, the present invention also proposes that a kind of server, the server include memory and processing
Device is stored with metadata validation program on the memory, when the processor executes the metadata validation program, realizes such as
Lower method:
The metadata for the file that user terminal uploads is received, the metadata includes constructing with multiple data blocks of the file
Merkel tree in traceable node Hash list；
The root cryptographic Hash of the Merkel tree is calculated according to the traceable node Hash list；
Judge whether described cryptographic Hash be identical as the cryptographic Hash of the file, if identical, determines that the metadata is tested
Card passes through, and saves the metadata.
Preferably, the preservation metadata includes:
Block chain is written into the metadata.
In addition, to achieve the above object, the present invention also proposes a kind of computer readable storage medium, described computer-readable
Storage medium is stored with metadata validation program, and the metadata validation program can be executed by least one processor, to realize
Following method:
The metadata for the file that user terminal uploads is received, the metadata includes constructing with multiple data blocks of the file
Merkel tree in traceable node Hash list；
The root cryptographic Hash of the Merkel tree is calculated according to the traceable node Hash list；
Judge whether described cryptographic Hash be identical as the cryptographic Hash of the file, if identical, determines that the metadata is tested
Card passes through, and saves the metadata.
Server of the present invention receives the metadata for the file that user terminal uploads, and the metadata includes with the more of the file
Traceable node Hash list in the Merkel tree of a data block construction；Server is according to the traceable node Hash list
Calculate the root cryptographic Hash of the Merkel tree；Server judges whether described cryptographic Hash be identical as the cryptographic Hash of the file,
If identical, determine that the metadata validation passes through, and save the metadata.Compared to the prior art, the present invention improves
The safety of block chain data write-in, prevents rogue attacks person from gathering around using the metadata of loophole data falsification file and tampering with a document
The person of having, so that the leakage of non-public file is caused, alternatively, invalid data is caused to build consensus in block chain.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
The structure shown according to these attached drawings obtains other attached drawings.
Fig. 1 is the system architecture diagram of one embodiment of metadata validation of the present invention；
Fig. 2 is the schematic diagram of one embodiment of server of the present invention；
Fig. 3 is the Program modual graph of one embodiment of metadata validation program in Fig. 2；
Fig. 4 is the flow chart of one embodiment of metadata validation method of the present invention；
Fig. 5 is the structural schematic diagram of Merkel tree.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific embodiment
The principle and features of the present invention will be described below with reference to the accompanying drawings, and the given examples are served only to explain the present invention, and
It is non-to be used to limit the scope of the invention.
It should be noted that the description for being related to " first ", " second " etc. in the present invention is used for description purposes only, and cannot
It is interpreted as its relative importance of indication or suggestion or implicitly indicates the quantity of indicated technical characteristic.Define as a result, " the
One ", the feature of " second " can explicitly or implicitly include at least one described feature.In addition, between each embodiment
Technical solution can be combined with each other, but must based on can be realized by those of ordinary skill in the art, work as technical solution
Combination there is conflicting or cannot achieve when and will be understood that the combination of this technical solution is not present, also do not wanted in the present invention
Within the protection scope asked.
The present invention proposes a kind of metadata validation system.
Referring to Fig. 1, Fig. 1 is the system architecture diagram of one embodiment of metadata validation system of the present invention.
In the present embodiment, the metadata validation system includes the server 1 and user terminal communicated to connect between each other
2, the server 1 is used for:
The metadata for the file that user terminal 2 uploads is received, the metadata includes multiple data block structures with the file
Traceable node Hash list in the Merkel tree made；
The root cryptographic Hash of the Merkel tree is calculated according to the traceable node Hash list；
Judge whether described cryptographic Hash be identical as the cryptographic Hash of the file, if identical, determines that the metadata is tested
Card passes through, and saves the metadata, for example, block chain is written in the metadata.
The metadata is to be used to indicate to have stored or the file information of file to be stored.The metadata includes with institute
State file multiple data blocks construction Merkel tree in traceable node Hash list, wherein the Merkel tree in advance by
User terminal 2 is formed using file build, and the structure of the Merkel tree can refer to Fig. 5, in Fig. 5, box B1, B2 of most junior, B3,
B4, B5, B6, B7, B8 represent the first preset quantity data block, and except the data block of row last, each box of remaining row is represented
One Merkel's tree node.User terminal 2 selects several nodes as traceable section from multiple nodes of Merkel tree in advance
Point, for example, Fig. 5 interior joint H1, H2, H34 and H5678 can be chosen as traceable node, and according to the Hash of four nodes
Value generates traceable node Hash list.When choosing traceable node it is noted that the cryptographic Hash of traceable node should
It is several cryptographic Hash that the root cryptographic Hash of the Merkel tree can be obtained by calculation.It is also optional according to specific application scenarios
Take Fig. 5 interior joint H3, H4, H12 and H1234 as traceable node, this is not limited by the present invention.
If traceable node is Fig. 5 interior joint H1, H2, H34 and H5678, server 1 is first by the Kazakhstan of node H1 and H2
Uncommon value is spliced, then the cryptographic Hash (H1+H2) that splicing is obtained carries out Hash operation (as utilized predetermined hash algorithm
Hash operation is carried out, predetermined hash algorithm includes MD5, SHA1 etc.), obtain the cryptographic Hash of node H12.Then, it will save
The cryptographic Hash of point H12 and H34 is spliced, and the cryptographic Hash (H12+H34) that splicing is obtained carries out Hash operation, obtains node
The cryptographic Hash of H1234.Finally, the cryptographic Hash of node H1234 and H5678 are spliced, the cryptographic Hash that splicing is obtained
(H1234+H5678) Hash operation is carried out, the root cryptographic Hash of root node is obtained.
The cryptographic Hash of above-mentioned file can be obtained and be uploaded to file progress Hash operation by user terminal 2, can also be by server 1
It carries out Hash operation to file to obtain, alternatively, the cryptographic Hash of file can also be calculated simultaneously by other any applicable devices
It is uploaded to server 1, this is not limited by the present invention.
In the case where metadata is not tampered with or is forged, by the way that the root Hash that is calculated of node Hash list can be traced
Value should be identical as the cryptographic Hash of file, therefore, when server 1 determines that root cryptographic Hash is identical as the cryptographic Hash of file, it is believed that
The metadata validation passes through, which is saved.When server 1 determines that root cryptographic Hash is different from the cryptographic Hash of file
When, it is believed that metadata validation failure, the metadata are tampered or forge, and refuse the meta-data preservation.
The present embodiment server 1 receives the metadata for the file that user terminal 2 uploads, and the metadata includes with the file
Multiple data blocks construction Merkel tree in traceable node Hash list；Server 1 is breathed out according to the traceable node
Uncommon list calculates the root cryptographic Hash of the Merkel tree；Server 1 judge described cryptographic Hash whether the Hash with the file
It is worth identical, if identical, determines that the metadata validation passes through, and save the metadata.Compared to the prior art, this implementation
Example improves the safety of block chain data write-in, prevents rogue attacks person using the metadata of loophole data falsification file and usurps
Change file owner, so that the leakage of non-public file is caused, alternatively, invalid data is caused to build consensus in block chain.
Further, in the present embodiment, user terminal 2 is used for:
The file is cut into the data block of the first preset quantity (for example, Fig. 5 institute according to predetermined segmentation rules
8 data blocks B1, B2, B3, B4, B5, B6, B7, the B8 shown.), and each data block is calculated using predetermined hash algorithm
Corresponding first cryptographic Hash, according to first cryptographic Hash and predetermined Merkel tree construction rule building Merkel tree.
The predetermined segmentation rules include:
The data file is cut into the data block of identical first preset quantity of size of data；Alternatively,
First preset quantity is denoted as M, when M is the natural number more than or equal to 2, according to predetermined file
The mapping relations of magnitude range and cutting data block size determine the data block size that data file described in cutting obtains, according to
The character sequence of determining the data block size and the data file, data file described in cutting obtain the identical M- of size
1 data block, remaining after cutting is m-th data block.M data block size is different from M-1 data block size.
For example, the predetermined hash algorithm has MD5, SHA1 etc..The predetermined Merkel tree construction rule
Then include:
Using each first cryptographic Hash as the most junior Hash value node of Merkel tree；
Each first cryptographic Hash is grouped according to predetermined rule of classification to obtain several the first groupings, for
All first cryptographic Hash in each first grouping, calculate corresponding second Hash using predetermined hash algorithm
Value；
For the N cryptographic Hash being calculated, N is the natural number more than or equal to 2, and circulation executes following steps: described
The quantity of N cryptographic Hash only one when terminate cryptographic Hash calculating, using N cryptographic Hash as the most higher level cryptographic Hash of Merkel tree
Node；Alternatively, when the quantity of the N cryptographic Hash has multiple, using each N cryptographic Hash as the inverse of the Merkel tree
N grades of Hash value nodes are grouped all N cryptographic Hash according to predetermined rule of classification to obtain several N points
Group calculates a corresponding N+1 using predetermined hash algorithm and breathes out for the N cryptographic Hash in each N grouping
Uncommon value.
Predetermined rule of classification includes the first rule of classification and V rule of classification, and wherein V is more than or equal to 2
Natural number.
First rule of classification includes:
The data block of cutting is ranked up according to the character sequence of the data file to be slit, according to described each
Corresponding first cryptographic Hash of each data block is ranked up to obtain by the putting in order of data block to be made of all first cryptographic Hash
First set selects the first cryptographic Hash of the second preset quantity as one every time according to collating sequence from the first set
One grouping then will be described until the quantity of the first cryptographic Hash remaining in the first set is less than second preset quantity
Remaining first cryptographic Hash is grouped as one first in first set, terminates the first grouping process.
For example, the collating sequence of 8 data blocks shown in fig. 5 is B1, B2, B3, B4, B5, B6, B7, B8, then this 8 numbers
Collating sequence according to corresponding first cryptographic Hash of block is H1 (B1), H2 (B2), H3 (B3), H4 (B4), H5 (B5), H6 (B6), H7
(B7),H8(B8).H1 (B1), H2 (B2) in Fig. 5 are one first grouping.Second preset quantity and the first preset quantity can
With identical, can also be different, the second preset quantity can be 2.
V rule of classification, V are more than or equal to 2 natural number: according to putting in order to V for each -1 cryptographic Hash of V
Cryptographic Hash is ranked up to obtain the V set being made of all V cryptographic Hash, each from the V set according to collating sequence
The V cryptographic Hash of the second preset quantity is selected to be grouped as a V, until V cryptographic Hash remaining in the V set
Quantity is less than second preset quantity, then V cryptographic Hash work remaining in the V set is divided into a V grouping,
Terminate V and is grouped process.For example, the second cryptographic Hash H12 (H1+H2), the second cryptographic Hash H34 (H3+H4) in Fig. 5 are one
Second packet.
The present invention proposes a kind of server.
Referring to Fig. 2, Fig. 2 is the schematic diagram of 1 one embodiment of server of the present invention.
In the present embodiment, metadata validation program 10 is installed and is run in server 1.The server 1 includes, but
It is not limited to, the memory 11 and processor 12 of connection is in communication with each other by program bus.Fig. 1 is illustrated only with component 11-12
Block chain node device 1, it should be understood that being not required for implementing all components shown, the implementation that can be substituted is more
More or less component.
Memory 11 can be the internal storage unit of block chain node device 1, such as the clothes in some embodiments
The hard disk or memory of business device 1.Memory 11 is also possible to the External memory equipment of server 1 in further embodiments, such as
The plug-in type hard disk being equipped on server 1, intelligent memory card (Smart Media Card, SMC), secure digital (Secure
Digital, SD) card, flash card (Flash Card) etc..Further, memory 11 can also include that the inside of server 1 is deposited
Storage unit and External memory equipment.Memory 11 is for storing the application software and Various types of data for being installed on server 1, such as member
The program code etc. of data verifying program 10.Memory 11, which can be also used for temporarily storing, have been exported or will export
Data.
Processor 12 can be in some embodiments a central processing unit (Central Processing Unit,
CPU), microprocessor or other data processing chips, program code or processing data for being stored in run memory 11, example
Such as execute metadata validation program 10.
The present invention proposes a kind of metadata validation program.
Referring to Fig. 3, Fig. 3 is the Program modual graph of 10 1 embodiment of metadata validation program in Fig. 2.In the present embodiment
In, metadata validation program 10 can be divided into one or more modules, one or more module is stored in memory
In 11, and it is performed by one or more processors (the present embodiment is processor 12), to complete the present invention.For example, in Fig. 2
In, metadata validation program 10 can be divided into receiving module 101, computing module 102, judgment module 103.Alleged by the present invention
Module be refer to complete specific function series of computation machine program instruction section, tested than program more suitable for descriptive metadata
Demonstrate,prove the implementation procedure of program 10 in the server 1, in which:
Receiving module 101, the metadata of the file for receiving the upload of user terminal 2, the metadata includes with the text
Traceable node Hash list in the Merkel tree of multiple data blocks construction of part.
The metadata is to be used to indicate to have stored or the file information of file to be stored.The metadata includes with institute
State file multiple data blocks construction Merkel tree in traceable node Hash list, wherein the Merkel tree in advance by
User terminal 2 is formed using file build, and the structure of the Merkel tree can refer to Fig. 5, in Fig. 5, box B1, B2 of most junior, B3,
B4, B5, B6, B7, B8 represent the first preset quantity data block, and except the data block of row last, each box of remaining row is represented
One Merkel's tree node.User terminal 2 selects several nodes as traceable section from multiple nodes of Merkel tree in advance
Point, for example, Fig. 5 interior joint H1, H2, H34 and H5678 can be chosen as traceable node, and according to the Hash of four nodes
Value generates traceable node Hash list.When choosing traceable node it is noted that the cryptographic Hash of traceable node should
It is several cryptographic Hash that the root cryptographic Hash of the Merkel tree can be obtained by calculation.It is also optional according to specific application scenarios
Take Fig. 5 interior joint H3, H4, H12 and H1234 as traceable node, this is not limited by the present invention.
Computing module 102, for calculating the root cryptographic Hash of the Merkel tree according to the traceable node Hash list.
For example, if traceable node is Fig. 5 interior joint H1, H2, H34 and H5678, first by the Hash of node H1 and H2
Value is spliced, then will the obtained cryptographic Hash (H1+H2) of splicing carry out Hash operation (as using predetermined hash algorithm into
Row Hash operation, predetermined hash algorithm include MD5, SHA1 etc.), obtain the cryptographic Hash of node H12.Then, by node
The cryptographic Hash of H12 and H34 is spliced, and the cryptographic Hash (H12+H34) that splicing is obtained carries out Hash operation, obtains node
The cryptographic Hash of H1234.Finally, the cryptographic Hash of node H1234 and H5678 are spliced, the cryptographic Hash that splicing is obtained
(H1234+H5678) Hash operation is carried out, the root cryptographic Hash of root node is obtained.
The cryptographic Hash of above-mentioned file can be obtained and be uploaded to file progress Hash operation by user terminal 2, can also be by calculating mould
Block 102 carries out Hash operation to file and obtains, alternatively, the cryptographic Hash of file can also be by other any applicable device meters
Server 1 is calculated and is uploaded to, this is not limited by the present invention.Judgment module 103, for judge described cryptographic Hash whether with institute
The cryptographic Hash for stating file is identical, if identical, determines that the metadata validation passes through, and save the metadata (for example, by first
Data are saved into block chain).
In the case where metadata is not tampered with or is forged, by the way that the root Hash that is calculated of node Hash list can be traced
Value should be identical as the cryptographic Hash of file, therefore, when judgment module 103 determines that root cryptographic Hash is identical as the cryptographic Hash of file,
Think that the metadata validation passes through, which is saved.When judgment module 103 determines the Hash of root cryptographic Hash and file
When being worth different, it is believed that metadata validation failure, the metadata are tampered or forge, and refuse the meta-data preservation.
The present embodiment server 1 receives the metadata for the file that user terminal 2 uploads, and the metadata includes with the file
Multiple data blocks construction Merkel tree in traceable node Hash list；According to the traceable node Hash list meter
Calculate the root cryptographic Hash of the Merkel tree；Server 1 judges whether described cryptographic Hash be identical as the cryptographic Hash of the file, such as
Fruit is identical, determines that the metadata validation passes through, and save the metadata.Compared to the prior art, embodiment improves
The safety of block chain data write-in, prevents rogue attacks person from gathering around using the metadata of loophole data falsification file and tampering with a document
The person of having, so that the leakage of non-public file is caused, alternatively, invalid data is caused to build consensus in block chain.
Further, the present invention also proposes that a kind of computer readable storage medium, the computer readable storage medium are deposited
Metadata validation program 10 is contained, the method that the metadata validation program 10 is realized when being executed by least one processor please join
According to the description in above-described embodiment.
Further it is proposed that a kind of metadata validation method.
Referring to Fig. 4, Fig. 4 is the flow chart of one embodiment of metadata validation method of the present invention.
In the present embodiment, which comprises
S10, server 1 receive the metadata for the file that user terminal 2 uploads, and the metadata includes with the more of the file
Traceable node Hash list in the Merkel tree of a data block construction.
The metadata is to be used to indicate to have stored or the file information of file to be stored.The metadata includes with institute
State file multiple data blocks construction Merkel tree in traceable node Hash list, wherein the Merkel tree in advance by
User terminal 2 is formed using file build, and the structure of the Merkel tree can refer to Fig. 5, in Fig. 5, box B1, B2 of most junior, B3,
B4, B5, B6, B7, B8 represent the first preset quantity data block, and except the data block of row last, each box of remaining row is represented
One Merkel's tree node.User terminal 2 selects several nodes as traceable section from multiple nodes of Merkel tree in advance
Point, for example, Fig. 5 interior joint H1, H2, H34 and H5678 can be chosen as traceable node, and according to the Hash of four nodes
Value generates traceable node Hash list.When choosing traceable node it is noted that the cryptographic Hash of traceable node should
It is several cryptographic Hash that the root cryptographic Hash of the Merkel tree can be obtained by calculation.It is also optional according to specific application scenarios
Take Fig. 5 interior joint H3, H4, H12 and H1234 as traceable node, this is not limited by the present invention.
S20, server 1 calculate the root cryptographic Hash of the Merkel tree according to the traceable node Hash list.
For example, if traceable node is Fig. 5 interior joint H1, H2, H34 and H5678, first by the Hash of node H1 and H2
Value is spliced, then will the obtained cryptographic Hash (H1+H2) of splicing carry out Hash operation (as using predetermined hash algorithm into
Row Hash operation, predetermined hash algorithm include MD5, SHA1 etc.), obtain the cryptographic Hash of node H12.Then, by node
The cryptographic Hash of H12 and H34 is spliced, and the cryptographic Hash (H12+H34) that splicing is obtained carries out Hash operation, obtains node
The cryptographic Hash of H1234.Finally, the cryptographic Hash of node H1234 and H5678 are spliced, the cryptographic Hash that splicing is obtained
(H1234+H5678) Hash operation is carried out, the root cryptographic Hash of root node is obtained.
The cryptographic Hash of above-mentioned file can be obtained and be uploaded to file progress Hash operation by user terminal 2, can also be by server 1
It carries out Hash operation to file to obtain, alternatively, the cryptographic Hash of file can also be calculated simultaneously by other any applicable devices
It is uploaded to server 1, this is not limited by the present invention.S30, server 1 judge described cryptographic Hash whether with the file
Cryptographic Hash is identical, if identical, determines that the metadata validation passes through, and save the metadata (for example, by meta-data preservation
Into block chain).
In the case where metadata is not tampered with or is forged, by the way that the root Hash that is calculated of node Hash list can be traced
Value should be identical as the cryptographic Hash of file, therefore, when server 1 determines that root cryptographic Hash is identical as the cryptographic Hash of file, it is believed that
The metadata validation passes through, which is saved.When server 1 determines that root cryptographic Hash is different from the cryptographic Hash of file
When, it is believed that metadata validation failure, the metadata are tampered or forge, and refuse the meta-data preservation.
The present embodiment server 1 receives the metadata for the file that user terminal 2 uploads, and the metadata includes with the file
Multiple data blocks construction Merkel tree in traceable node Hash list；Server 1 is breathed out according to the traceable node
Uncommon list calculates the root cryptographic Hash of the Merkel tree；Server 1 judge described cryptographic Hash whether the Hash with the file
It is worth identical, if identical, determines that the metadata validation passes through, and save the metadata.Compared to the prior art, this implementation
Example improves the safety of block chain data write-in, prevents rogue attacks person using the metadata of loophole data falsification file and usurps
Change file owner, so that the leakage of non-public file is caused, alternatively, invalid data is caused to build consensus in block chain.
Further, in the present embodiment, before the metadata that the server 1 receives that user terminal 2 uploads, this method
Further include:
The file is cut into the data block (example of the first preset quantity by user terminal 2 according to predetermined segmentation rules
Such as, 8 data blocks B1, B2, B3, B4, B5, B6, B7, B8 shown in fig. 5.), and calculated using predetermined hash algorithm
Corresponding first cryptographic Hash of each data block, it is silent according to first cryptographic Hash and the construction rule building of predetermined Merkel tree
Ke Er tree.
The predetermined segmentation rules include:
The data file is cut into the data block of identical first preset quantity of size of data；Alternatively,
First preset quantity is denoted as M, when M is the natural number more than or equal to 2, according to predetermined file
The mapping relations of magnitude range and cutting data block size determine the data block size that data file described in cutting obtains, according to
The character sequence of determining the data block size and the data file, data file described in cutting obtain the identical M- of size
1 data block, remaining after cutting is m-th data block.M data block size is different from M-1 data block size.
For example, the predetermined hash algorithm has MD5, SHA1 etc..The predetermined Merkel tree construction rule
Then include:
Using each first cryptographic Hash as the most junior Hash value node of Merkel tree；
Each first cryptographic Hash is grouped according to predetermined rule of classification to obtain several the first groupings, for
All first cryptographic Hash in each first grouping, calculate corresponding second Hash using predetermined hash algorithm
Value；
For the N cryptographic Hash being calculated, N is the natural number more than or equal to 2, and circulation executes following steps: described
The quantity of N cryptographic Hash only one when terminate cryptographic Hash calculating, using N cryptographic Hash as the most higher level cryptographic Hash of Merkel tree
Node；Alternatively, when the quantity of the N cryptographic Hash has multiple, using each N cryptographic Hash as the inverse of the Merkel tree
N grades of Hash value nodes are grouped all N cryptographic Hash according to predetermined rule of classification to obtain several N points
Group calculates a corresponding N+1 using predetermined hash algorithm and breathes out for the N cryptographic Hash in each N grouping
Uncommon value.
Predetermined rule of classification includes the first rule of classification and V rule of classification, and wherein V is more than or equal to 2
Natural number.
First rule of classification includes:
The data block of cutting is ranked up according to the character sequence of the data file to be slit, according to described each
Corresponding first cryptographic Hash of each data block is ranked up to obtain by the putting in order of data block to be made of all first cryptographic Hash
First set selects the first cryptographic Hash of the second preset quantity as one every time according to collating sequence from the first set
One grouping then will be described until the quantity of the first cryptographic Hash remaining in the first set is less than second preset quantity
Remaining first cryptographic Hash is grouped as one first in first set, terminates the first grouping process.
For example, the collating sequence of 8 data blocks shown in fig. 5 is B1, B2, B3, B4, B5, B6, B7, B8, then this 8 numbers
Collating sequence according to corresponding first cryptographic Hash of block is H1 (B1), H2 (B2), H3 (B3), H4 (B4), H5 (B5), H6 (B6), H7
(B7),H8(B8).H1 (B1), H2 (B2) in Fig. 5 are one first grouping.Second preset quantity and the first preset quantity can
With identical, can also be different, the second preset quantity can be 2.
V rule of classification, V are more than or equal to 2 natural number: according to putting in order to V for each -1 cryptographic Hash of V
Cryptographic Hash is ranked up to obtain the V set being made of all V cryptographic Hash, each from the V set according to collating sequence
The V cryptographic Hash of the second preset quantity is selected to be grouped as a V, until V cryptographic Hash remaining in the V set
Quantity is less than second preset quantity, then V cryptographic Hash work remaining in the V set is divided into a V grouping,
Terminate V and is grouped process.For example, the second cryptographic Hash H12 (H1+H2), the second cryptographic Hash H34 (H3+H4) in Fig. 5 are one
Second packet.
The above description is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all at this
Under the inventive concept of invention, using equivalent structure transformation made by description of the invention and accompanying drawing content, or directly/use indirectly
It is included in other related technical areas in scope of patent protection of the invention.
Claims (11)
1. a kind of metadata validation method, which is characterized in that the described method includes:
Server receives the metadata for the file that user terminal uploads, and the metadata includes multiple data block structures with the file
Traceable node Hash list in the Merkel tree made；
Server calculates the root cryptographic Hash of the Merkel tree according to the traceable node Hash list；
Server judges whether described cryptographic Hash be identical as the cryptographic Hash of the file, if identical, determines the metadata
It is verified, and saves the metadata.
2. metadata validation method according to claim 1, which is characterized in that described to save the metadata and include:
Block chain is written in the metadata by server.
3. metadata validation method according to claim 1, which is characterized in that receive user terminal in the server and upload
Metadata before, this method further include:
The file is cut into the data block of the first preset quantity by user terminal according to predetermined segmentation rules, and using in advance
First determining hash algorithm calculates corresponding first cryptographic Hash of each data block, according to first cryptographic Hash and predetermined
Merkel tree construction rule building Merkel tree.
4. metadata validation method as claimed in claim 3, which is characterized in that the predetermined segmentation rules include:
The data file is cut into the data block of identical first preset quantity of size of data；Alternatively,
First preset quantity is denoted as M, when M is the natural number more than or equal to 2, according to predetermined file size
The mapping relations of range and cutting data block size determine the data block size that data file described in cutting obtains, according to determination
The data block size and the data file character sequence, it is M-1 identical that data file described in cutting obtains size
Data block, remaining after cutting is m-th data block.
5. metadata validation method as described in claim 3 or 4, which is characterized in that the predetermined Merkel tree structure
Making rule includes:
Using each first cryptographic Hash as the most junior Hash value node of the Merkel tree；
Each first cryptographic Hash is grouped according to predetermined rule of classification to obtain several the first groupings, for
All first cryptographic Hash in each first grouping, calculate corresponding second Hash using predetermined hash algorithm
Value；
For the N cryptographic Hash being calculated, N is the natural number more than or equal to 2, and circulation executes following steps: as the N
The quantity of cryptographic Hash only one when terminate cryptographic Hash calculating, using the N cryptographic Hash as the most higher level of the Merkel tree
Hash value node；Alternatively, when the quantity of the N cryptographic Hash has multiple, using each N cryptographic Hash as the Merkel tree
N grades of Hash value nodes reciprocal, all N cryptographic Hash are grouped to obtain several according to predetermined rule of classification
N grouping calculates one corresponding the using predetermined hash algorithm for the N cryptographic Hash in each N grouping
N+1 cryptographic Hash.
6. metadata validation method as claimed in claim 5, which is characterized in that the predetermined rule of classification includes:
First grouping: the data block of cutting is ranked up according to the character sequence of the data file to be slit, according to institute
Putting in order for each data block is stated to be ranked up to obtain by all first cryptographic Hash by corresponding first cryptographic Hash of each data block
The first set of composition, selected every time from the first set according to collating sequence the first cryptographic Hash of the second preset quantity as
One first grouping, until the first cryptographic Hash remaining in the first set quantity be less than second preset quantity, then
It is grouped the first cryptographic Hash remaining in the first set as one first, terminates the first grouping process；
V grouping, V be more than or equal to 2 natural number: according to each -1 cryptographic Hash of V put in order to V cryptographic Hash into
Row sequence obtains the V set being made of all V cryptographic Hash, selects second every time from the V set according to collating sequence
The V cryptographic Hash of preset quantity is grouped as a V, until the quantity of V cryptographic Hash remaining in the V set is less than
V cryptographic Hash work remaining in the V set is then divided into a V grouping, terminates V by second preset quantity
It is grouped process.
7. a kind of metadata validation system, which is characterized in that the system comprises the server communicated to connect between each other and use
Family end, the server are used for:
The metadata for the file that user terminal uploads is received, the metadata includes with the silent of multiple data blocks construction of the file
Traceable node Hash list in Ke Er tree；
The root cryptographic Hash of the Merkel tree is calculated according to the traceable node Hash list；
Judge whether described cryptographic Hash be identical as the cryptographic Hash of the file, if identical, determines that the metadata validation is logical
It crosses, and saves the metadata.
8. metadata validation system as claimed in claim 7, which is characterized in that the server is also used to:
Block chain is written into the metadata.
9. metadata validation system as claimed in claim 7, which is characterized in that the user terminal is used for:
The file is cut into the data block of the first preset quantity according to predetermined segmentation rules, and utilizes and predefines
Hash algorithm calculate corresponding first cryptographic Hash of each data block, according to first cryptographic Hash and predetermined Merkel
Tree construction rule building Merkel tree.
10. a kind of server, the server includes memory and processor, which is characterized in that is stored on the memory
Metadata validation program realizes following method when the processor executes the metadata validation program:
The metadata for the file that user terminal uploads is received, the metadata includes with the silent of multiple data blocks construction of the file
Traceable node Hash list in Ke Er tree；
The root cryptographic Hash of the Merkel tree is calculated according to the traceable node Hash list；
Judge whether described cryptographic Hash be identical as the cryptographic Hash of the file, if identical, determines that the metadata validation is logical
It crosses, and saves the metadata.
11. a kind of computer readable storage medium, which is characterized in that the computer-readable recording medium storage has metadata to test
Program is demonstrate,proved, the metadata validation program can be executed by least one processor, to realize following method:
The metadata for the file that user terminal uploads is received, the metadata includes with the silent of multiple data blocks construction of the file
Traceable node Hash list in Ke Er tree；
The root cryptographic Hash of the Merkel tree is calculated according to the traceable node Hash list；
Judge whether described cryptographic Hash be identical as the cryptographic Hash of the file, if identical, determines that the metadata validation is logical
It crosses, and saves the metadata.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811282637.9A CN109657499A (en) | 2018-10-31 | 2018-10-31 | Metadata validation method, system server and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811282637.9A CN109657499A (en) | 2018-10-31 | 2018-10-31 | Metadata validation method, system server and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109657499A true CN109657499A (en) | 2019-04-19 |
Family
ID=66110462
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811282637.9A Pending CN109657499A (en) | 2018-10-31 | 2018-10-31 | Metadata validation method, system server and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109657499A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111444542A (en) * | 2020-03-30 | 2020-07-24 | 陈兴芜 | Data processing method, device and storage medium for copyright file |
| CN111460394A (en) * | 2020-03-30 | 2020-07-28 | 陈兴芜 | Copyright file verification method and device and computer readable storage medium |
| CN111756639A (en) * | 2020-06-19 | 2020-10-09 | 杭州芯讯科技有限公司 | Mirror image data transmission method based on Mercker tree and broadcast self-request |
| CN111984614A (en) * | 2020-08-04 | 2020-11-24 | 中国人民银行数字货币研究所 | Method, device and system for sharing files |
| CN112348518A (en) * | 2020-10-15 | 2021-02-09 | 深圳前海微众银行股份有限公司 | Block chain transaction certification method and device |
| CN112434269A (en) * | 2020-10-23 | 2021-03-02 | 上海点融信息科技有限责任公司 | Zero knowledge proof method, verification method, computing device and storage medium of file |
| CN112699081A (en) * | 2020-10-23 | 2021-04-23 | 中国工商银行股份有限公司 | File self-certification method and device based on block chain |
| CN112785408A (en) * | 2021-02-26 | 2021-05-11 | 中国工商银行股份有限公司 | Account checking method and device based on Hash |
| CN112968922A (en) * | 2021-01-19 | 2021-06-15 | 河北蜂之巢互联网技术有限公司 | Stream data storage method and stream data storage system |
| CN113259345A (en) * | 2021-05-12 | 2021-08-13 | 国网山东省电力公司东平县供电公司 | Intelligent power distribution network data secure transmission method, system and storage medium |
| CN113536956A (en) * | 2021-06-23 | 2021-10-22 | 华南理工大学 | Multimedia data tampering detection method |
| WO2021232295A1 (en) * | 2020-05-20 | 2021-11-25 | 新华三技术有限公司 | Method and apparatus for monitoring software license information, and server and storage medium |
| CN113704182A (en) * | 2021-06-15 | 2021-11-26 | 成都统信软件技术有限公司 | Data checking method and computing device |
| CN114500433A (en) * | 2022-01-21 | 2022-05-13 | 北京送好运信息技术有限公司 | Multi-mail data preservation method based on block chain and Mercker tree |
| CN114510465A (en) * | 2022-02-22 | 2022-05-17 | 光大科技有限公司 | Data management method, device and computer readable storage medium |
| CN114500433B (en) * | 2022-01-21 | 2024-04-19 | 北京送好运信息技术有限公司 | Multi-mail data security method based on blockchain and merck tree |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005130488A (en) * | 2003-10-03 | 2005-05-19 | Nippon Telegr & Teleph Corp <Ntt> | Time certification apparatus, time certification request accepting apparatus, time certification method, time certification request accepting method, time certification program, time certification request acceptance program, time certification verification program, and program recording medium |
| CN107220559A (en) * | 2017-06-11 | 2017-09-29 | 南京安链数据科技有限公司 | A kind of encryption storage method for that can not tamper with a document |
| CN107292181A (en) * | 2017-06-20 | 2017-10-24 | 无锡井通网络科技有限公司 | Database Systems based on block chain and the application method using the system |
| CN107911359A (en) * | 2017-11-10 | 2018-04-13 | 国信嘉宁数据技术有限公司 | A kind of method for obtaining electronic data |
| CN108681583A (en) * | 2018-05-11 | 2018-10-19 | 北京奇虎科技有限公司 | Data proof of possession method, apparatus and readable storage medium storing program for executing based on block chain |
-
2018
- 2018-10-31 CN CN201811282637.9A patent/CN109657499A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005130488A (en) * | 2003-10-03 | 2005-05-19 | Nippon Telegr & Teleph Corp <Ntt> | Time certification apparatus, time certification request accepting apparatus, time certification method, time certification request accepting method, time certification program, time certification request acceptance program, time certification verification program, and program recording medium |
| CN107220559A (en) * | 2017-06-11 | 2017-09-29 | 南京安链数据科技有限公司 | A kind of encryption storage method for that can not tamper with a document |
| CN107292181A (en) * | 2017-06-20 | 2017-10-24 | 无锡井通网络科技有限公司 | Database Systems based on block chain and the application method using the system |
| CN107911359A (en) * | 2017-11-10 | 2018-04-13 | 国信嘉宁数据技术有限公司 | A kind of method for obtaining electronic data |
| CN108681583A (en) * | 2018-05-11 | 2018-10-19 | 北京奇虎科技有限公司 | Data proof of possession method, apparatus and readable storage medium storing program for executing based on block chain |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111460394A (en) * | 2020-03-30 | 2020-07-28 | 陈兴芜 | Copyright file verification method and device and computer readable storage medium |
| CN111444542A (en) * | 2020-03-30 | 2020-07-24 | 陈兴芜 | Data processing method, device and storage medium for copyright file |
| WO2021232295A1 (en) * | 2020-05-20 | 2021-11-25 | 新华三技术有限公司 | Method and apparatus for monitoring software license information, and server and storage medium |
| CN111756639B (en) * | 2020-06-19 | 2022-05-10 | 杭州芯讯科技有限公司 | Mirror image data transmission method based on Merckel tree and broadcast self-request |
| CN111756639A (en) * | 2020-06-19 | 2020-10-09 | 杭州芯讯科技有限公司 | Mirror image data transmission method based on Mercker tree and broadcast self-request |
| CN111984614A (en) * | 2020-08-04 | 2020-11-24 | 中国人民银行数字货币研究所 | Method, device and system for sharing files |
| CN111984614B (en) * | 2020-08-04 | 2023-05-26 | 中国人民银行数字货币研究所 | Method, device and system for sharing files |
| CN112348518A (en) * | 2020-10-15 | 2021-02-09 | 深圳前海微众银行股份有限公司 | Block chain transaction certification method and device |
| CN112348518B (en) * | 2020-10-15 | 2022-09-16 | 深圳前海微众银行股份有限公司 | Block chain transaction certification method and device |
| CN112434269A (en) * | 2020-10-23 | 2021-03-02 | 上海点融信息科技有限责任公司 | Zero knowledge proof method, verification method, computing device and storage medium of file |
| CN112699081A (en) * | 2020-10-23 | 2021-04-23 | 中国工商银行股份有限公司 | File self-certification method and device based on block chain |
| CN112699081B (en) * | 2020-10-23 | 2024-01-26 | 中国工商银行股份有限公司 | File self-certification method and device based on blockchain |
| CN112968922A (en) * | 2021-01-19 | 2021-06-15 | 河北蜂之巢互联网技术有限公司 | Stream data storage method and stream data storage system |
| CN112785408A (en) * | 2021-02-26 | 2021-05-11 | 中国工商银行股份有限公司 | Account checking method and device based on Hash |
| CN113259345A (en) * | 2021-05-12 | 2021-08-13 | 国网山东省电力公司东平县供电公司 | Intelligent power distribution network data secure transmission method, system and storage medium |
| CN113704182A (en) * | 2021-06-15 | 2021-11-26 | 成都统信软件技术有限公司 | Data checking method and computing device |
| CN113536956A (en) * | 2021-06-23 | 2021-10-22 | 华南理工大学 | Multimedia data tampering detection method |
| CN113536956B (en) * | 2021-06-23 | 2023-06-27 | 华南理工大学 | Method for detecting multimedia data tampering |
| CN114500433A (en) * | 2022-01-21 | 2022-05-13 | 北京送好运信息技术有限公司 | Multi-mail data preservation method based on block chain and Mercker tree |
| CN114500433B (en) * | 2022-01-21 | 2024-04-19 | 北京送好运信息技术有限公司 | Multi-mail data security method based on blockchain and merck tree |
| CN114510465A (en) * | 2022-02-22 | 2022-05-17 | 光大科技有限公司 | Data management method, device and computer readable storage medium |
| CN114510465B (en) * | 2022-02-22 | 2023-09-26 | 光大科技有限公司 | Data management method, device and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109657499A (en) | Metadata validation method, system server and computer readable storage medium | |
| CN107770154B (en) | Block chain reliable data storage method, terminal and system based on cloud storage | |
| CN110472201B (en) | Text similarity detection method and device based on block chain and electronic equipment | |
| CN110535836A (en) | A kind of trust block chain common recognition method of based role classification | |
| Bastiaan | Preventing the 51%-attack: a stochastic analysis of two phase proof of work in bitcoin | |
| EP4283550A2 (en) | Constraints on inputs of an unlocking transaction in a blockchain | |
| CN106934611B (en) | Data processing method and device | |
| CN109345388A (en) | Block chain intelligence contract verification method, device and storage medium | |
| CN108696511A (en) | A kind of public notification of information method, apparatus and relevant device based on block chain | |
| US20190073645A1 (en) | Systems and Methods of Decentralized Geospatial Data Gathering | |
| CN110490599A (en) | Verification method, system, device, equipment and the readable storage medium storing program for executing of evidence | |
| CN110751485B (en) | Data processing method and equipment | |
| CN109985389A (en) | Cards game anti-cheating method and its system based on block chain intelligence contract | |
| CN111090581B (en) | Intelligent contract testing method, intelligent contract testing device, computer equipment and storage medium | |
| Esiner et al. | Analysis and optimization on FlexDPDP: A practical solution for dynamic provable data possession | |
| CN111010284B (en) | Processing method of block to be identified, related device and block chain system | |
| CN109816532A (en) | A kind of assets digitlization anchoring system based on block chain technology | |
| CN107124426A (en) | The method for authenticating and device of a kind of user's right | |
| CN115840787B (en) | Block chain-based supply chain data sharing method, device, equipment and medium | |
| CN111723159A (en) | Data verification method and device based on block chain | |
| CN110942305A (en) | Real estate information management method and device based on block chain | |
| CN113806816A (en) | Electronic file management method and device based on block chain and electronic equipment | |
| CN116628757B (en) | Spacecraft supply chain management method, equipment and storage medium based on block chain | |
| CN107124357A (en) | A kind of cloud computing intelligent gateway | |
| CN109067551A (en) | A kind of real name identification method, computer readable storage medium and terminal device |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20211018 Address after: 518000 21 / f-23 / F, block B, building 12, Shenzhen Bay science and technology ecological park, No. 18, South Keji Road, high tech community, Yuehai street, Nanshan District, Shenzhen City, Guangdong Province Applicant after: Xunlei Networking Technologies, Ltd. Applicant after: SHENZHEN ONETHING TECHNOLOGIES Co.,Ltd. Address before: 518000 Room 201, building A, 1 front Bay Road, Shenzhen Qianhai cooperation zone, Shenzhen, Guangdong Applicant before: SHENZHEN ONETHING TECHNOLOGIES Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190419 |
|
| RJ01 | Rejection of invention patent application after publication |