CN113129145A - Electronic evidence storing and verifying method and device based on block chain - Google Patents
Electronic evidence storing and verifying method and device based on block chain Download PDFInfo
- Publication number
- CN113129145A CN113129145A CN202110271390.6A CN202110271390A CN113129145A CN 113129145 A CN113129145 A CN 113129145A CN 202110271390 A CN202110271390 A CN 202110271390A CN 113129145 A CN113129145 A CN 113129145A
- Authority
- CN
- China
- Prior art keywords
- hash value
- electronic evidence
- verified
- evidence
- tree data
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
- H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Computer Security & Cryptography (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- General Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- General Business, Economics & Management (AREA)
- Probability & Statistics with Applications (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Fuzzy Systems (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Economics (AREA)
- Technology Law (AREA)
- Strategic Management (AREA)
- Storage Device Security (AREA)
Abstract
The invention relates to an electronic evidence storing and verifying method and device based on a block chain. The block chain only stores the root hash values of a plurality of electronic evidences, and the storage and uplink pressure of the block chain is relieved. When the electronic evidence is verified to be tampered, only the electronic evidence and the Mercker tree data to be verified need to be transmitted, data transmission in the verification process is reduced, and meanwhile, true transaction data are prevented from being leaked.
Description
Technical Field
The invention relates to the technical field of electronic evidence, in particular to a block chain-based electronic evidence storing and verifying method and device.
Background
With the trend of internet, more and more transactions are performed on the internet, and more electronic transaction data are generated, especially in the financial industry, and a large amount of business is performed on line. When disputes occur in transactions and need to be solved by a judicial channel, in order to ensure that the authenticity of electronic data is not tampered, the electronic data of the online transactions needs to be used as evidence for evidence storage and verification.
The block chain technology has the characteristics of decentralization and tamper resistance, and can be used for evidence storage and verification. The financial institution can submit the hash value of the electronic evidence of the transaction to the block chain evidence storage platform, when the transaction disputes, the financial institution submits lawsuits or arbitrates, and the judicial system can verify whether the electronic evidence submitted by the financial institution is tampered through the block chain evidence storage platform. There are two main approaches to storing and validating electronic evidence into blockchains.
The first method comprises the following steps: each time an electronic proof is generated, the hash value of the electronic proof is linked. The evidence storing and verifying mode has the advantages that each electronic evidence is linked independently, and when whether the electronic evidence is tampered or not is verified, the electronic evidence can be submitted to the block chain evidence storing platform for verification.
The second method comprises the following steps: and compressing the generated electronic evidence files into zip packages in batches, and chaining the hash values of the zip packages.
However, since the chain of evidentiary data is massive in the first method, it causes a lot of stress on the blockchain and also leaks the transaction data. The second method is complicated to verify whether a single electronic evidence is tampered, for example, to verify A, B, C whether three electronic evidences are tampered, if the three electronic evidence files are just in three different compressed packets, the three compressed packets are submitted to a block chain evidence storage platform for verification during verification, and the whole verification process causes large data transmission.
Disclosure of Invention
Based on this, the present invention provides a block chain-based e-proof storing and verifying method and apparatus, which have the advantages of reducing the link pressure on data and reducing data transmission when verifying the validity of e-proof.
In order to achieve the above object, a first aspect of the present invention provides a block chain-based electronic evidence storing and verifying method, including:
receiving an electronic evidence to be verified and the Mercker tree data where the electronic evidence to be verified is located; the Mercker tree data comprise a hash value of the electronic evidence to be verified and a root hash value;
inquiring whether a root hash value corresponding to the electronic evidence to be verified is stored in a block chain evidence storage platform; the block chain evidence storing platform stores a root hash value transmitted by the service system; the root hash value is a root node value in the Mercker tree data generated by the service system according to the N electronic evidences;
when a root hash value corresponding to the electronic evidence to be verified is stored in the block chain evidence storage platform, calculating a hash value according to the electronic evidence to be verified, and comparing the calculated hash value with the hash value of the electronic evidence to be verified;
and when the calculated hash value is consistent with the hash value of the electronic evidence to be verified, feeding back information that the electronic evidence to be verified is not tampered.
Further, before the querying whether the root hash value corresponding to the electronic evidence to be verified is stored in the blockchain evidence storing platform, the method further includes: obtaining new Mercker tree data according to the received leaf node data in the Mercker tree data; comparing the received Mercker tree data with new Mercker tree data obtained through calculation one by one; and when the received Mercker tree data is consistent with the new Mercker tree data obtained through calculation, inquiring whether a root hash value corresponding to the electronic evidence to be verified is stored in a block chain evidence storage platform. Comparing the received Mercker tree data with the new Mercker tree data obtained through calculation one by one, and ensuring that the Mercker tree data transmission process between the block chain evidence storage platform and the service system is error-free.
Further, the obtaining new merkel tree data according to the leaf node data in the received merkel tree data includes: performing hash operation on the hash value of a leaf node in the Mercker tree data corresponding to the electronic evidence to be verified to generate a hash value of an intermediate node; performing hash operation on the hash value of the intermediate node to generate a root hash value; and obtaining new Mercker tree data according to the hash values of the leaf nodes, the hash values of the intermediate nodes and the root hash value. The block chain evidence storage platform needs to recalculate hash values of intermediate nodes and root nodes of the Mercker tree data, and reliability of electronic evidence verification is guaranteed.
Further, when the received Mercker tree data is inconsistent with the new Mercker tree data obtained through calculation, feeding back information that the electronic evidence to be verified is tampered. And if the new Mercker tree data obtained by the block chain evidence storage platform through calculation is different from the Mercker tree data stored in the service system, the electronic evidence to be verified is tampered.
Further, when the root hash value corresponding to the electronic evidence to be verified is not stored in the block chain evidence storage platform, feeding back information of tampering of the electronic evidence to be verified. The root hash value of the new Mercker tree data obtained by the block chain storage platform through calculation is not in the block chain storage platform, namely the Mercker tree data is incorrect, and the electronic evidence to be verified is tampered.
Further, when the calculated hash value is inconsistent with the hash value of the electronic evidence to be verified, feeding back information that the electronic evidence to be verified is tampered. The block chain evidence storage platform calculates the hash value of the electronic evidence to be verified, the consistent hash value cannot be found in the leaf nodes of the Mercker tree in a comparison mode, and the electronic evidence to be verified is tampered.
Further, the merkel tree data includes hash values of N leaf nodes, hash values of at least two intermediate nodes, and a root hash value; performing hash operation on the electronic evidence to obtain a hash value of the leaf node; performing hash operation on two adjacent hash values of the leaf node after the two adjacent hash values are connected in series to obtain a hash value of the intermediate node; and performing hash operation after connecting two adjacent hash values of the intermediate node in series to obtain the root hash value.
Further, the merkel tree data includes hash values of N leaf nodes and a root hash value; performing hash operation on the electronic evidence to obtain a hash value of the leaf node; and performing hash operation on all the hash values of the leaf nodes after being connected in series to obtain the root hash value. A secondary Merck tree is used, so that data stored in a business system is minimum, and meanwhile, the calculation is simple.
Further, the root hash value is a root node value in the mercker tree data generated by the business system according to the random N electronic evidences. The number of the electronic evidences which are combined and uplinked to the block chain evidence storing platform at each time is random, namely the value of N is a random number, so that the real uplink data volume of the user is protected.
The second aspect of the present invention provides an electronic evidence storing and verifying device based on a block chain, including:
the receiving unit is used for receiving the electronic evidence to be verified and the Mercker tree data where the electronic evidence to be verified is located; the Mercker tree data comprise a hash value of the electronic evidence to be verified and a root hash value;
the query unit is used for querying whether a root hash value corresponding to the electronic evidence to be verified is stored in a block chain evidence storage platform; the block chain evidence storing platform stores a root hash value transmitted by the service system; the root hash value is a root node value in the Mercker tree data generated by the service system according to the N electronic evidences;
the comparison unit is used for calculating a hash value according to the electronic evidence to be verified when the root hash value corresponding to the electronic evidence to be verified is stored in the block chain evidence storing platform, and comparing the calculated hash value with the hash value of the electronic evidence to be verified;
and the feedback unit is used for feeding back information that the electronic evidence to be verified is not tampered when the calculated hash value is consistent with the hash value of the electronic evidence to be verified.
Compared with the prior art, the invention has the following beneficial effects: the invention provides an electronic evidence storing and verifying method and device based on a block chain. Furthermore, when the electronic evidence is verified to be tampered, only the electronic evidence and the Mercker tree data to be verified need to be transmitted, so that data transmission in the verification process is reduced, and meanwhile, true transaction data are prevented from being leaked.
Drawings
FIG. 1 is a schematic flow chart of an electronic evidence storing and verifying method based on a block chain according to the present invention;
FIG. 2 is a schematic flow chart of S102 in the block chain-based electronic evidence storing and verifying method according to the present invention;
FIG. 3 is a schematic flow chart of S201 in the block chain-based electronic evidence storing and verifying method according to the present invention;
FIG. 4 is a schematic diagram of the generation of a Mercker tree according to one embodiment of the present invention;
FIG. 5 is a schematic diagram of the generation of a Mercker tree according to another embodiment of the present invention;
FIG. 6 is a block diagram of an apparatus for storing evidence and verifying electronic evidence based on block chains according to the present invention;
FIG. 7 is a block diagram of the query unit 42 in the apparatus for storing and verifying electronic evidence based on block chain according to the present invention;
fig. 8 is a block diagram of an obtaining unit 421 in the apparatus for storing and verifying electronic proof based on block chain according to the present invention.
Detailed Description
For a better understanding and practice, the invention is described in detail below with reference to the accompanying drawings.
Referring to fig. 1, an embodiment of the present invention provides a block chain-based electronic evidence storing and verifying method, including the following steps:
s101, receiving an electronic evidence to be verified and Mercker tree data where the electronic evidence to be verified is located; wherein the Mercker tree data includes a hash value of the electronic evidence to be verified and a root hash value.
The Mercker tree is a binary tree that may include a set of leaf nodes, a set of intermediate nodes, and a root node. The leaf nodes of the merkel tree are hash values of a file or a set of files, each intermediate node is obtained by hash operation after two adjacent leaf nodes are connected in series, and the root node is also obtained by hash operation after two adjacent intermediate nodes are connected in series, so any change of the leaf node data is transmitted to the intermediate nodes until the root node. The merkel tree may also include a set of leaf nodes and a root node. The leaf nodes of the merkel tree are hash values of files or file sets, and all the leaf nodes are connected in series and then subjected to hash operation to obtain root nodes. In the embodiment of the present application, each leaf node of the mercker tree is a hash value of each electronic evidence, and a set of leaf nodes of the mercker tree is obtained by calculating hash values of a plurality of electronic evidences. On the basis of a set of leaf nodes, intermediate nodes and/or root nodes are generated by the method described above.
In the embodiment of the application, the block chain storage and certification platform receives the electronic evidence to be verified and the merckel tree data where the electronic evidence to be verified is located. The business system has a plurality of electronic evidences, hash values of the electronic evidences are calculated respectively, and the Mercker tree is calculated and stored through the hash values of the electronic evidences. And finding the Merck tree data of the electronic evidence to be verified according to the Hash value of the electronic evidence to be verified.
S102, inquiring whether a root hash value corresponding to the electronic evidence to be verified is stored in a block chain evidence storage platform; the block chain evidence storing platform stores a root hash value transmitted by the service system; the root hash value is a root node value in the Mercker tree data generated by the business system according to the N electronic evidences.
In the embodiment of the application, N is the number of electronic evidences, and N is an integer. And after the business system generates the Mercker tree data according to a plurality of electronic evidences, linking the root hash value to the block chain evidence storage platform. After receiving the electronic evidence to be verified and the Mercker tree data where the electronic evidence to be verified is located, the block chain evidence storage platform queries whether the root hash value of the Mercker tree data already exists.
In an optional embodiment, referring to fig. 2, before the step S102 of querying whether the root hash value corresponding to the electronic evidence to be verified is stored in the blockchain evidence storing platform, the method further includes:
s201, obtaining new Mercker tree data according to the received leaf node data in the Mercker tree data;
s202, comparing the received Mercker tree data with new Mercker tree data obtained through calculation one by one;
s203, when the received Mercker tree data is consistent with the new Mercker tree data obtained through calculation, whether a root hash value corresponding to the electronic evidence to be verified is stored or not is inquired on a block chain evidence storage platform.
In the embodiment of the present application, the received mercker tree data is compared with the new mercker tree data obtained through calculation one by one, so as to ensure that the mercker tree data transmission process between the block chain evidence storage platform and the service system is error-free. When the Mercker data transmitted to the block chain evidence storing platform by the service system is consistent with the new Mercker tree data obtained by recalculation of the block chain evidence storing platform, the block chain evidence storing platform inquires whether a root Hash value corresponding to the electronic evidence to be verified is stored.
In an alternative embodiment, referring to fig. 3, step S201 may further include steps S2011 to S2013, which are specifically as follows:
and S2011, performing hash operation on the hash value of the leaf node in the Mercker tree data corresponding to the electronic evidence to be verified to generate the hash value of the intermediate node.
In the embodiment of the application, after two adjacent hash values of the leaf nodes of the merkel tree data are connected in series, hash operation is performed to obtain the hash value of the intermediate node.
And S2012, performing hash operation on the hash value of the intermediate node to generate a root hash value.
In this embodiment, after two adjacent hash values of the intermediate node of the merkel tree data are connected in series, hash operation is performed to obtain a root hash value.
S2013, obtaining new Mercker tree data according to the hash values of the leaf nodes, the hash values of the intermediate nodes and the root hash value.
In the embodiment of the present application, new merkel tree data is constructed by obtaining the hash value and the root hash value of the intermediate node.
S103, when the root hash value corresponding to the electronic evidence to be verified is stored in the block chain evidence storing platform, calculating a hash value according to the electronic evidence to be verified, and comparing the calculated hash value with the hash value of the electronic evidence to be verified.
In this embodiment of the present application, when the root hash value corresponding to the electronic evidence to be verified is stored in the block chain storage platform, the merkel tree data is correct. And calculating a hash value of the electronic evidence to be verified, and comparing the calculated hash value with the hash values of the leaf nodes of the Merckel tree.
S104, when the calculated hash value is consistent with the hash value of the electronic evidence to be verified, feeding back information that the electronic evidence to be verified is not tampered.
And when the hash value obtained by calculating the electronic evidence to be verified is compared with the hash value of the leaf node of the Mercker tree, the block chain evidence storage platform feeds back the information that the electronic evidence to be verified is not tampered to the service system.
In an optional embodiment, when the received merkel tree data is inconsistent with the new merkel tree data obtained by calculation, the information that the electronic evidence to be verified is tampered is fed back.
If the received Mercker tree data is inconsistent with the new Mercker tree data obtained through calculation, the information that the electronic evidence to be verified is tampered is fed back when the Mercker tree data stored in the service system is unreliable or errors occur in the Mercker tree data transmission process.
In an optional embodiment, when the root hash value corresponding to the electronic evidence to be verified is not stored in the blockchain evidence storing platform, feeding back information that the electronic evidence to be verified is tampered.
When the root hash value corresponding to the electronic evidence to be verified is not stored in the block chain evidence storage platform, namely the electronic evidence to be verified is tampered, the root hash value in the new computed Mercker tree data is correspondingly changed, and therefore the root hash value is inconsistent with the root hash value stored in the block chain evidence storage platform, and the information that the electronic evidence to be verified is tampered is fed back.
In an optional embodiment, when the calculated hash value is inconsistent with the hash value of the electronic evidence to be verified, feeding back information that the electronic evidence to be verified is tampered.
When the root hash value of the new Mercker tree is existed by the block chain storage platform query, the intermediate node hash value and the leaf node hash value in the new Mercker tree are both correct. Calculating a hash value of the electronic evidence to be verified, comparing the hash value with hash values of leaf nodes in a new Mercker tree one by one, and feeding back information of tampering of the electronic evidence to be verified when the hash value is different from hash values of all the leaf nodes in the new Mercker tree.
In an alternative embodiment, please refer to fig. 4, the merkel tree data includes hash values of N leaf nodes, hash values of at least two intermediate nodes, and a root hash value; performing hash operation on the electronic evidence to obtain a hash value of the leaf node; performing hash operation on two adjacent hash values of the leaf node after the two adjacent hash values are connected in series to obtain a hash value of the intermediate node; and performing hash operation after connecting two adjacent hash values of the intermediate node in series to obtain the root hash value.
Specifically, the merkel tree is generated by taking 4 electronic evidences as an example. The method comprises the steps of firstly respectively calculating Hash values of 4 electronic evidences to obtain a Hash1 ═ Hash (electronic evidence 1), a Hash2 ═ Hash (electronic evidence 2), a Hash3 ═ Hash (electronic evidence 3) and a Hash4 ═ Hash (electronic evidence 4), connecting a Hash value Hash1 of the electronic evidence 1 and a Hash value Hash2 of the electronic evidence 2 in series and then performing Hash operation to obtain a Hash value Hash12 ═ Hash (Hash1+ Hash2) of a first intermediate node, connecting a Hash value Hash3 of the electronic evidence 3 and a Hash value Hash4 of the electronic evidence 4 in series and then performing Hash operation to obtain a Hash value Hash34 ═ Hash (Hash3+ Hash4) of a second intermediate node, and connecting the obtained Hash value Hash12 of the first intermediate node and a Hash value Hash34 of the second intermediate node in series and then performing Hash operation to obtain a Hash value Hash (Hash).
In an alternative embodiment, referring to fig. 5, the merkel tree data includes hash values of N leaf nodes and a root hash value; performing hash operation on the electronic evidence to obtain a hash value of the leaf node; and performing hash operation on all the hash values of the leaf nodes after being connected in series to obtain the root hash value.
Specifically, the merkel tree is generated by taking 4 electronic evidences as an example. The Hash values of 4 electronic evidences are respectively calculated to obtain a Hash1 ═ Hash (electronic evidence 1), a Hash2 ═ Hash (electronic evidence 2), a Hash3 ═ Hash (electronic evidence 3) and a Hash4 ═ Hash (electronic evidence 4), all electronic evidence Hash values Hash1 to Hash4 are connected in series and then Hash operation is carried out, and a root Hash value Hash is obtained (Hash1+ Hash2+ Hash3+ Hash 4).
In an optional embodiment, the root hash value is a root node value in the mercker tree data generated by the business system according to the N random electronic proofs. The number of the electronic evidences which are combined and uplinked to the block chain evidence storing platform at each time is random, namely the value of N is a random number, so that the real uplink data volume of the user is protected.
By applying the embodiment of the invention, whether a root hash value corresponding to the electronic evidence to be verified is stored is inquired on a block chain evidence storage platform by receiving the electronic evidence to be verified and the Mercker tree data where the electronic evidence to be verified is located, when the root hash value is stored, the hash value is calculated according to the electronic evidence to be verified, the calculated hash value is compared with the hash value of the electronic evidence to be verified, and when the calculated hash value is consistent with the hash value of the electronic evidence to be verified, information that the electronic evidence to be verified is not tampered is fed back. Furthermore, when the electronic evidence is verified to be tampered, only the electronic evidence and the Mercker tree data to be verified need to be transmitted, so that data transmission in the verification process is reduced, and meanwhile, true transaction data are prevented from being leaked.
Referring to fig. 6, an embodiment of the present invention provides an apparatus 4 for storing and verifying an electronic evidence based on a block chain, including:
a receiving unit 41, configured to receive an electronic evidence to be verified and tacle tree data where the electronic evidence to be verified is located; wherein the Mercker tree data includes a hash value of the electronic evidence to be verified and a root hash value.
The query unit 42 is configured to query whether a root hash value corresponding to the electronic evidence to be verified is stored in the block chain evidence storage platform; the block chain evidence storing platform stores a root hash value transmitted by the service system; the root hash value is a root node value in the Mercker tree data generated by the business system according to the N electronic evidences.
And a comparing unit 43, configured to calculate a hash value according to the electronic evidence to be verified when the root hash value corresponding to the electronic evidence to be verified is stored in the block chain evidence storing platform, and compare the calculated hash value with the hash value of the electronic evidence to be verified.
And the feedback unit 44 is configured to feed back information that the electronic evidence to be verified is not tampered when the calculated hash value is consistent with the hash value of the electronic evidence to be verified.
Optionally, referring to fig. 7, before the querying unit 42 is configured to query whether the root hash value corresponding to the electronic evidence to be verified is stored in the blockchain evidence storing platform, the method further includes:
an obtaining unit 421, configured to obtain new merkel tree data according to the received leaf node data in the merkel tree data.
The first comparing unit 422 is configured to compare the received mercker tree data with the new mercker tree data obtained through calculation one by one.
The first query unit 423 is configured to query, when the received merkel tree data is consistent with the new merkel tree data obtained through calculation, whether a root hash value corresponding to the electronic evidence to be verified is stored in the block chain evidence storage platform.
Optionally, referring to fig. 8, the obtaining unit 421 includes:
an intermediate node generating unit 4211, configured to perform hash operation on the hash value of a leaf node in the merkel tree data corresponding to the electronic evidence to be verified, so as to generate a hash value of an intermediate node.
A root hash value generation unit 4212, configured to perform hash operation on the hash value of the intermediate node to generate a root hash value.
A new merkel tree construction unit 4213, configured to obtain new merkel tree data according to the hash values of the leaf nodes, the hash values of the intermediate nodes, and the root hash value.
By applying the embodiment of the invention, whether a root hash value corresponding to the electronic evidence to be verified is stored is inquired on a block chain evidence storage platform by receiving the electronic evidence to be verified and the Mercker tree data where the electronic evidence to be verified is located, when the root hash value is stored, the hash value is calculated according to the electronic evidence to be verified, the calculated hash value is compared with the hash value of the electronic evidence to be verified, and when the calculated hash value is consistent with the hash value of the electronic evidence to be verified, information that the electronic evidence to be verified is not tampered is fed back. Furthermore, when the electronic evidence is verified to be tampered, only the electronic evidence and the Mercker tree data to be verified need to be transmitted, so that data transmission in the verification process is reduced, and meanwhile, true transaction data are prevented from being leaked.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, to those skilled in the art, changes and modifications may be made without departing from the spirit of the present invention, and it is intended that the present invention encompass such changes and modifications.
Claims (10)
1. An electronic evidence storing and verifying method based on a block chain is characterized by comprising the following steps:
receiving an electronic evidence to be verified and the Mercker tree data where the electronic evidence to be verified is located; the Mercker tree data comprise a hash value of the electronic evidence to be verified and a root hash value;
inquiring whether a root hash value corresponding to the electronic evidence to be verified is stored in a block chain evidence storage platform; the block chain evidence storing platform stores a root hash value transmitted by the service system; the root hash value is a root node value in the Mercker tree data generated by the service system according to the N electronic evidences;
when a root hash value corresponding to the electronic evidence to be verified is stored in the block chain evidence storage platform, calculating a hash value according to the electronic evidence to be verified, and comparing the calculated hash value with the hash value of the electronic evidence to be verified;
and when the calculated hash value is consistent with the hash value of the electronic evidence to be verified, feeding back information that the electronic evidence to be verified is not tampered.
2. The method for storing and verifying electronic evidence based on block chains as claimed in claim 1, wherein:
before the step of querying whether the root hash value corresponding to the electronic evidence to be verified is stored in the block chain evidence storage platform, the method further includes:
obtaining new Mercker tree data according to the received leaf node data in the Mercker tree data;
comparing the received Mercker tree data with new Mercker tree data obtained through calculation one by one;
and when the received Mercker tree data is consistent with the new Mercker tree data obtained through calculation, inquiring whether a root hash value corresponding to the electronic evidence to be verified is stored in a block chain evidence storage platform.
3. The method for storing and verifying electronic evidence based on block chains as claimed in claim 2, wherein:
the obtaining new merkel tree data according to the received leaf node data in the merkel tree data includes:
performing hash operation on the hash value of a leaf node in the Mercker tree data corresponding to the electronic evidence to be verified to generate a hash value of an intermediate node;
performing hash operation on the hash value of the intermediate node to generate a root hash value;
and obtaining new Mercker tree data according to the hash values of the leaf nodes, the hash values of the intermediate nodes and the root hash value.
4. The method for storing and verifying electronic evidence based on block chains as claimed in claim 1, wherein: and when the received Mercker tree data is inconsistent with the new Mercker tree data obtained through calculation, feeding back information that the electronic evidence to be verified is tampered.
5. The method for storing and verifying electronic evidence based on block chains as claimed in claim 1, wherein: and when the root hash value corresponding to the electronic evidence to be verified is not stored in the block chain evidence storage platform, feeding back information of tampering of the electronic evidence to be verified.
6. The method for storing and verifying electronic evidence based on block chains as claimed in claim 1, wherein: and when the calculated hash value is inconsistent with the hash value of the electronic evidence to be verified, feeding back information of tampering of the electronic evidence to be verified.
7. The method for storing and verifying electronic evidence based on block chains as claimed in claim 1, wherein: the merkel tree data comprises hash values of N leaf nodes, hash values of at least two intermediate nodes and a root hash value; performing hash operation on the electronic evidence to obtain a hash value of the leaf node; performing hash operation on two adjacent hash values of the leaf node after the two adjacent hash values are connected in series to obtain a hash value of the intermediate node; and performing hash operation after connecting two adjacent hash values of the intermediate node in series to obtain the root hash value.
8. The method for storing and verifying electronic evidence based on block chains as claimed in claim 1, wherein: the merkel tree data includes hash values of N leaf nodes and a root hash value; performing hash operation on the electronic evidence to obtain a hash value of the leaf node; and performing hash operation on all the hash values of the leaf nodes after being connected in series to obtain the root hash value.
9. The method for storing and verifying electronic evidence based on block chains as claimed in claim 1, wherein: the root hash value is a root node value in the Mercker tree data generated by the business system according to the random N electronic evidences.
10. An electronic evidence storing and verifying device based on a block chain is characterized by comprising:
the receiving unit is used for receiving the electronic evidence to be verified and the Mercker tree data where the electronic evidence to be verified is located; the Mercker tree data comprise a hash value of the electronic evidence to be verified and a root hash value;
the query unit is used for querying whether a root hash value corresponding to the electronic evidence to be verified is stored in a block chain evidence storage platform; the block chain evidence storing platform stores a root hash value transmitted by the service system; the root hash value is a root node value in the Mercker tree data generated by the service system according to the N electronic evidences;
the comparison unit is used for calculating a hash value according to the electronic evidence to be verified when the root hash value corresponding to the electronic evidence to be verified is stored in the block chain evidence storing platform, and comparing the calculated hash value with the hash value of the electronic evidence to be verified;
and the feedback unit is used for feeding back information that the electronic evidence to be verified is not tampered when the calculated hash value is consistent with the hash value of the electronic evidence to be verified.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110271390.6A CN113129145B (en) | 2021-03-12 | 2021-03-12 | Electronic evidence storing and verifying method and device based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110271390.6A CN113129145B (en) | 2021-03-12 | 2021-03-12 | Electronic evidence storing and verifying method and device based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113129145A true CN113129145A (en) | 2021-07-16 |
| CN113129145B CN113129145B (en) | 2022-03-22 |
Family
ID=76773061
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110271390.6A Active CN113129145B (en) | 2021-03-12 | 2021-03-12 | Electronic evidence storing and verifying method and device based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113129145B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113255315A (en) * | 2021-07-19 | 2021-08-13 | 杭州天谷信息科技有限公司 | Method and system for configuring and generating evidence chain |
| CN114153849A (en) * | 2021-12-02 | 2022-03-08 | 深圳前海微众银行股份有限公司 | Data generation and verification method and device for block chain |
| CN114500433A (en) * | 2022-01-21 | 2022-05-13 | 北京送好运信息技术有限公司 | Multi-mail data preservation method based on block chain and Mercker tree |
| CN115456631A (en) * | 2022-09-30 | 2022-12-09 | 佛山众陶联供应链服务有限公司 | Block chain-based multi-level supply chain credit cross-level verification method and system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108897760A (en) * | 2018-05-22 | 2018-11-27 | 贵阳信息技术研究院（中科院软件所贵阳分部） | Electronic evidence chain integrity verification method based on Merkel tree |
| CN109101572A (en) * | 2018-07-17 | 2018-12-28 | 何晓行 | Card method, apparatus and server, storage medium are deposited based on block chain |
| US20190236716A1 (en) * | 2015-05-07 | 2019-08-01 | Lance Kasper | Consensus system for managing digital record |
| CN110969207A (en) * | 2019-11-29 | 2020-04-07 | 腾讯科技（深圳）有限公司 | Electronic evidence processing method, device, equipment and storage medium |
| CN111008840A (en) * | 2020-03-05 | 2020-04-14 | 支付宝(杭州)信息技术有限公司 | Service processing system, service processing method, device and equipment |
| CN111711655A (en) * | 2020-05-14 | 2020-09-25 | 特斯联科技集团有限公司 | Block chain-based electronic data evidence storing method, system, storage medium and terminal |
-
2021
- 2021-03-12 CN CN202110271390.6A patent/CN113129145B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190236716A1 (en) * | 2015-05-07 | 2019-08-01 | Lance Kasper | Consensus system for managing digital record |
| CN108897760A (en) * | 2018-05-22 | 2018-11-27 | 贵阳信息技术研究院（中科院软件所贵阳分部） | Electronic evidence chain integrity verification method based on Merkel tree |
| CN109101572A (en) * | 2018-07-17 | 2018-12-28 | 何晓行 | Card method, apparatus and server, storage medium are deposited based on block chain |
| CN110969207A (en) * | 2019-11-29 | 2020-04-07 | 腾讯科技（深圳）有限公司 | Electronic evidence processing method, device, equipment and storage medium |
| CN111008840A (en) * | 2020-03-05 | 2020-04-14 | 支付宝(杭州)信息技术有限公司 | Service processing system, service processing method, device and equipment |
| CN111711655A (en) * | 2020-05-14 | 2020-09-25 | 特斯联科技集团有限公司 | Block chain-based electronic data evidence storing method, system, storage medium and terminal |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113255315A (en) * | 2021-07-19 | 2021-08-13 | 杭州天谷信息科技有限公司 | Method and system for configuring and generating evidence chain |
| CN113255315B (en) * | 2021-07-19 | 2021-11-09 | 杭州天谷信息科技有限公司 | Method and system for configuring and generating evidence chain |
| CN114153849A (en) * | 2021-12-02 | 2022-03-08 | 深圳前海微众银行股份有限公司 | Data generation and verification method and device for block chain |
| 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 |
| CN115456631A (en) * | 2022-09-30 | 2022-12-09 | 佛山众陶联供应链服务有限公司 | Block chain-based multi-level supply chain credit cross-level verification method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113129145B (en) | 2022-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113129145B (en) | Electronic evidence storing and verifying method and device based on block chain | |
| CN110121727B (en) | Method and system for providing authenticated, auditable and immutable input for intelligent contracts | |
| CN108985772B (en) | Block chain verification method, device, equipment and storage medium | |
| US7412480B2 (en) | Device and method for updating code | |
| CN108200208B (en) | Logistics block chain consensus algorithm based on cloud computing | |
| JP2021502746A (en) | A system to protect the verification key from modification and to verify the validity of the legitimacy proof | |
| US11429475B1 (en) | Systems and methods for blockchain repair assurance tokens | |
| US20190207766A1 (en) | File based transmission validation and failure location identification system | |
| CN110599175A (en) | Block processing method and related equipment | |
| CN112396420A (en) | System and method for automatically processing repeated payment | |
| CN115186304A (en) | Transaction data verification method and system based on block chain | |
| CN109685657B (en) | Method and node device for processing transactions in a blockchain network and storage medium | |
| CN110324309A (en) | One kind being sent to method based on jurisdictional information | |
| US8712964B2 (en) | Systems and methods for updating a data store using a transaction store | |
| CN110633328B (en) | Information processing method, device and computer readable storage medium | |
| CN111242773A (en) | Virtual resource application docking method and device, computer equipment and storage medium | |
| US10963889B2 (en) | Cross-system object tracking platform | |
| CN111144958B (en) | Electronic invoice issuing method, device and system based on block chain | |
| EP1168165A2 (en) | Device and method for updating code | |
| CN115964407A (en) | Double-copy power network security audit method, system, medium and equipment | |
| CN111524011B (en) | Parallel link consensus validation method, apparatus, and storage medium | |
| CN112767084B (en) | Data security verification method and device based on cloud computing and server | |
| CN108632348A (en) | A kind of business method of calibration and device | |
| US20230177497A1 (en) | Currency management system and electronic signature device | |
| CN113849860A (en) | Anti-counterfeiting method and device for electronic credential, electronic equipment and storage medium |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20220127 Address after: 510630 / F, radio and television science and technology building, 163 xipingyun Road, Huangpu Avenue, Tianhe District, Guangzhou, Guangdong Applicant after: Guangzhou Radio and television Zhongda Digital Technology Co.,Ltd. Address before: 901, Radio & TV technology building, 163 xipingyun Road, Huangpu Avenue, Tianhe District, Guangzhou, Guangdong 510630 Applicant before: Guangzhou Octopus technology Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |