CN110969207A

CN110969207A - Electronic evidence processing method, device, equipment and storage medium

Info

Publication number: CN110969207A
Application number: CN201911202070.4A
Authority: CN
Inventors: 蔡弋戈; 秦青; 杨晨; 王乐庆; 李琴
Original assignee: Tencent Technology Shenzhen Co Ltd
Current assignee: Tencent Technology Shenzhen Co Ltd
Priority date: 2019-11-29
Filing date: 2019-11-29
Publication date: 2020-04-07
Anticipated expiration: 2039-11-29
Also published as: CN110969207B

Abstract

The embodiment of the application discloses an electronic evidence processing method, an electronic evidence processing device, electronic evidence processing equipment and a storage medium, wherein the method is applied to a block chain and comprises the following steps: receiving an attestation request submitted by a target object; classifying the duplicate electronic evidence according to the evidence types to obtain first electronic evidences of a plurality of evidence types, and determining hash values of the first electronic evidences; obtaining hash values of all second electronic evidences of the original electronic evidences; respectively sending the hash value of the first electronic evidence and the hash value of the second electronic evidence of the same evidence type to a consensus node so that the consensus node verifies whether the first electronic evidence and the second electronic evidence of each evidence type are consistent or not, and sending a signature confirmation message after the verification is passed; and receiving the signature confirmation message and submitting the first electronic evidence of the evidence type corresponding to the signature confirmation message to the court when the signature confirmation message meets the preset consensus strategy. By adopting the embodiment of the application, the electronic evidence can be verified based on the block chain, and the applicability is high.

Description

Electronic evidence processing method, device, equipment and storage medium

Technical Field

The present application relates to the field of computer technologies, and in particular, to a method, an apparatus, a device, and a storage medium for processing electronic evidence.

Background

With the popularization of internet applications, data generated in the internet often plays an important role in litigation as important electronic evidence. However, in the prior art, electronic evidence is often stored in databases of enterprises and users, and objectivity, integrity and authenticity of the electronic evidence cannot be ensured. On the other hand, when individuals, enterprises and the like deposit evidence for users, the individuals, the enterprises and the like often need to personally go to a court to submit the evidence, and the efficiency is low.

Therefore, how to perfect the management method of the electronic evidence and improve the reliability and the efficiency of the proof of the electronic evidence becomes an urgent problem to be solved.

Disclosure of Invention

The embodiment of the application provides an electronic evidence processing method, an electronic evidence processing device, electronic evidence processing equipment and a storage medium, which can be used for verifying electronic evidence based on a block chain and have high applicability.

In a first aspect, an embodiment of the present application provides an electronic evidence processing method, including:

receiving an attestation request submitted by a target object, wherein the attestation request carries a copy electronic evidence, a block height and an identity of the target object;

classifying the duplicate electronic evidence according to evidence types to obtain first electronic evidences of a plurality of evidence types, and determining a hash value of each first electronic evidence based on a hash determination mode corresponding to each evidence type, wherein the evidence types comprise a text type, a picture type and a video type;

determining a target block from the block chain based on the block height, and acquiring a hash value of each second electronic evidence of an original electronic evidence from the target block based on the identity, wherein the original electronic evidence is an evidence original of the duplicate electronic evidence;

respectively sending the hash value of the first electronic evidence and the hash value of the second electronic evidence of the same evidence type to a consensus node so that the consensus node verifies whether the first electronic evidence and the second electronic evidence of each evidence type are consistent or not, and sending a signature confirmation message after the verification is passed;

and receiving the signature confirmation message, and submitting the first electronic evidence of the evidence type corresponding to the signature confirmation message to a court when the signature confirmation message meets a preset consensus strategy.

With reference to the first aspect, in a possible implementation manner, before the receiving the attestation request submitted by the target object, the method further includes:

receiving a certificate storing request submitted by a target object, wherein the certificate storing request carries an original electronic evidence and a digital signature of the original electronic evidence;

determining whether the proof request is a valid request based on the original electronic evidence and the digital signature of the original electronic evidence;

if the proof-proving request is an effective request, classifying the original electronic evidence according to evidence types to obtain second electronic evidences of a plurality of evidence types, wherein the evidence types comprise a text type, a picture type and a video type;

determining the hash value of each second electronic evidence based on the hash determination mode corresponding to each evidence type;

and generating an identity identifier based on the identity information of the target object, marking the hash value of each second electronic evidence based on the identity identifier, storing the hash value of each second electronic evidence to a target block, and returning the block height of the target block to the target object.

With reference to the first aspect, in a possible implementation manner, the determining the hash value of each second electronic evidence based on the hash determination manner corresponding to each evidence type includes:

performing hash calculation on the second electronic evidence of the text type based on an information summarization algorithm to obtain a hash value of the second electronic evidence of the text type;

converting the second electronic evidence of the picture type into a gray scale map with a preset size, and determining a hash value of the second electronic evidence of the picture type based on each gray scale value of the gray scale map;

and determining binary data corresponding to the second electronic evidence of the video type, and performing hash calculation on the binary data based on the information digest algorithm to obtain a hash value of the second electronic evidence of the video type.

With reference to the first aspect, in a possible implementation manner, the storing the hash value of each second electronic evidence to the target block includes:

constructing a Merck tree based on the Hash value of the second electronic evidence of each evidence type to obtain a first Merck tree, a second Merck tree and a third Merck tree;

constructing a fourth Mercker tree based on the first Mercker tree, the second Mercker tree and the third Mercker tree;

and constructing a block body based on the fourth Mercker tree, constructing a block head based on the hash value of the root node of the fourth Mercker tree, and constructing a target block based on the block head and the block head.

With reference to the first aspect, in a possible implementation manner, after receiving the attestation request submitted by the target object, the method further includes:

confirming the evidence presenting notification information corresponding to the evidence presenting request, and confirming the evidence presenting time limit specified by the evidence presenting notification information;

determining the evidence-proving time of the target object submitting the evidence-proving request, and comparing the evidence-proving time with the evidence-proving time limit;

and if the proof time is within the proof time limit, the step of classifying the copy electronic proofs according to the proof types to obtain a first electronic proof of a plurality of proof types is executed, and if the proof time is not within the proof time limit, an proof overdue notice is returned to the target object.

With reference to the first aspect, in one possible implementation, the method further includes:

when the signature confirmation message corresponding to any evidence type does not meet a preset consensus strategy, calling an intelligent contract to verify whether the target first electronic evidence corresponding to any evidence type is legal evidence or not;

if the target first electronic evidence is legal evidence, submitting the target first electronic evidence to the court and sending a new evidence submission notice to the court;

and if the target first electronic evidence is not legal evidence, returning an invalid evidence notice to the target object, wherein the invalid evidence notice is used for explaining that the target first electronic evidence is invalid evidence.

With reference to the first aspect, in a possible implementation manner, the attestation request further carries a digital signature of the electronic evidence of the copy, and the method further includes:

acquiring a public key of the target object, and decrypting the digital signature of the copy electronic evidence based on the public key to obtain first abstract information of the copy electronic evidence;

determining second summary information of the copy electronic evidence;

and comparing the first abstract information with the second abstract information, and if the first abstract information is consistent with the second abstract information, determining that the proof request is a valid request.

In a second aspect, an embodiment of the present application provides an electronic evidence processing apparatus, including:

the system comprises a first receiving module, a second receiving module and a third receiving module, wherein the first receiving module is used for receiving an attestation request submitted by a target object, and the attestation request carries a copy electronic evidence, a block height and an identity of the target object;

the first determining module is used for classifying the copy electronic evidence according to evidence types to obtain first electronic evidences of a plurality of evidence types, and determining a hash value of each first electronic evidence based on a hash determining mode corresponding to each evidence type, wherein the evidence types comprise a text type, a picture type and a video type;

a second determining module, configured to determine a target block from the block chain based on the block height, and obtain a hash value of each second electronic evidence of an original electronic evidence from the target block based on the identity, where the original electronic evidence is an original evidence of the duplicate electronic evidence;

the first verification module is used for respectively sending the hash value of the first electronic evidence and the hash value of the second electronic evidence of the same evidence type to the consensus node so that the consensus node verifies whether the first electronic evidence and the second electronic evidence of each evidence type are consistent or not, and sends a signature confirmation message after the verification is passed;

and the first submitting module is used for receiving the signature confirmation message and submitting the first electronic evidence of the evidence type corresponding to the signature confirmation message to a court when the signature confirmation message meets a preset consensus strategy.

With reference to the second aspect, in a possible implementation manner, the apparatus further includes:

the second receiving module is further used for receiving a certificate storing request submitted by the target object, wherein the certificate storing request carries the original electronic evidence and the digital signature of the original electronic evidence;

the third determining module is further used for determining whether the proof request is a valid request based on the original electronic evidence and the digital signature of the original electronic evidence;

the classification module is further used for classifying the original electronic evidence according to evidence types to obtain second electronic evidences of a plurality of evidence types if the proof-proving request is an effective request, wherein the evidence types comprise a text type, a picture type and a video type;

the fourth determining module is further configured to determine a hash value of each second electronic evidence based on the hash determining mode corresponding to each evidence type;

and the storage module is further configured to generate an identity based on the identity information of the target object, mark the hash value of each second electronic evidence based on the identity, store the hash value of each second electronic evidence to a target block, and return the block height of the target block to the target object.

With reference to the second aspect, in one possible implementation, the fourth determining module includes:

the first processing unit is used for carrying out Hash calculation on the second electronic evidence of the text type based on an information summarization algorithm to obtain a Hash value of the second electronic evidence of the text type;

the second processing unit is used for converting the second electronic evidence of the picture type into a gray scale map with a preset size and determining a hash value of the second electronic evidence of the picture type based on each gray scale value of the gray scale map;

and the third processing unit is used for determining binary data corresponding to the second electronic evidence of the video type and carrying out hash calculation on the binary data based on the information summarization algorithm to obtain a hash value of the second electronic evidence of the video type.

With reference to the second aspect, in one possible implementation manner, the storage module includes:

the first construction unit is used for constructing the Mercker tree based on the Hash value of the second electronic evidence of each evidence type to obtain a first Mercker tree, a second Mercker tree and a third Mercker tree;

a second constructing unit, configured to construct a fourth mercker tree based on the first mercker tree, the second mercker tree, and the third mercker tree;

a third constructing unit, configured to construct a block based on the fourth merkel tree, construct a block header based on a hash value of a root node of the fourth merkel tree, and construct a target block based on the block header and the block header.

a fifth determining module, configured to determine the proof notification information corresponding to the proof request, and determine the proof deadline specified by the proof notification information;

the first comparison module is also used for determining the evidence demonstration time of the target object submitting the evidence demonstration request and comparing the evidence demonstration time with the evidence demonstration time limit;

the first processing module is further configured to, if the proof time is within the proof expiration, execute the step of classifying the copy electronic proofs according to evidence types to obtain first electronic proofs of a plurality of evidence types, and if the proof time is not within the proof expiration, return an proof expiration notice to the target object.

the second verification module is further used for calling an intelligent contract to verify whether the target first electronic evidence corresponding to any evidence type is legal or not when the signature confirmation message corresponding to any evidence type does not meet the preset consensus strategy;

the second submitting module is further used for submitting the target first electronic evidence to the court and sending a new evidence submitting notice to the court if the target first electronic evidence is legal evidence;

and the returning module is further used for returning an invalid evidence notification to the target object if the target first electronic evidence is not a legal evidence, wherein the invalid evidence notification is used for explaining that the target first electronic evidence is an invalid evidence.

the acquisition module is further used for acquiring a public key of the target object and decrypting the digital signature of the copy electronic evidence based on the public key to obtain first summary information of the copy electronic evidence;

the second processing module is also used for determining second summary information of the copy electronic evidence;

and the second comparison module is further used for comparing the first abstract information with the second abstract information, and if the first abstract information is consistent with the second abstract information, the proof request is determined to be an effective request.

In a third aspect, an embodiment of the present application provides an apparatus, which includes a processor and a memory, where the processor and the memory are connected to each other. The memory is configured to store a computer program that supports the terminal device to execute the method provided by the first aspect and/or any one of the possible implementation manners of the first aspect, where the computer program includes program instructions, and the processor is configured to call the program instructions to execute the method provided by the first aspect and/or any one of the possible implementation manners of the first aspect.

In a fourth aspect, the present application provides a computer-readable storage medium, which stores a computer program, where the computer program is executed by a processor to implement the method provided by the first aspect and/or any one of the possible implementation manners of the first aspect.

In the embodiment of the application, the duplicate electronic evidence submitted by the target object is classified according to the evidence types, the hash value of the first electronic evidence of each evidence type is determined, and then the hash values of the second electronic evidence of the original electronic evidence in the block chain can be compared to determine whether the first electronic evidence of the evidence type is the valid evidence, so that the classification processing and comparison of the duplicate electronic evidence can be realized, and the verification efficiency of the duplicate electronic evidence is improved. In addition, whether the first electronic evidence of the same evidence type is valid evidence or not is verified through the consensus node based on the first electronic evidence and the second electronic evidence of the same evidence type, the verification reliability of the first electronic evidence can be improved based on the verification results of the plurality of consensus nodes, and the applicability is higher.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.

Fig. 1 is a network architecture diagram of an electronic evidence processing method provided in an embodiment of the present application;

fig. 2 is a schematic flow chart of an electronic evidence processing method provided in an embodiment of the present application;

fig. 3 is another schematic flow chart diagram of an electronic evidence processing method provided in an embodiment of the present application;

FIG. 4 is a schematic diagram of a scenario for determining a hash value of an electronic evidence according to an embodiment of the present disclosure;

fig. 5 is a schematic diagram of another scenario for determining a hash value of an electronic evidence provided in an embodiment of the present application;

fig. 6 is a schematic diagram of another scenario for determining a hash value of an electronic evidence provided in an embodiment of the present application;

FIG. 7 is a schematic diagram of a scenario for building a Mercker tree according to an embodiment of the present application;

FIG. 8 is a block diagram according to an embodiment of the present disclosure;

FIG. 9 is a schematic diagram of an electronic evidence processing apparatus of the type provided by an embodiment of the present application;

fig. 10 is a schematic structural diagram of an apparatus provided in an embodiment of the present application.

Detailed Description

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

Referring to fig. 1, fig. 1 is a network architecture diagram of an electronic evidence processing method according to an embodiment of the present application. In fig. 1, when the blockchain 20 receives an attestation request submitted by the target object 10, it may obtain a copy electronic evidence carried in the attestation request, and classify the copy electronic evidence according to an evidence type to obtain a first electronic evidence of multiple evidence types. The target object may be an individual, a group, or a corporate representative, and may be determined based on an actual application scenario, which is not limited herein. In addition, the proof request submitted by the target object 10 may be a proof request triggered when the target object 10 submits the complaint to the court 30 as an original report, or may be a proof request triggered when the target object 10 is reported to be proof based on a proof notification notified by the court 30, or may specifically be determined based on an actual application scenario, which is not limited herein. The evidence types include, but are not limited to, text types, picture types, and video types, and are not limited thereto. After obtaining the plurality of first electronic proofs, the blockchain 20 may determine a hash value of each first electronic proof according to a hash determination manner corresponding to the evidence type. Further, the blockchain 20 may obtain the height of the block carried in the proof-holding request and the identity information of the target object 10, further determine the target block based on the height of the block, and determine a hash value of each second electronic proof of the original electronic proof from the target block based on the identity information of the target object 10, where the original electronic proof is an original proof of the duplicate electronic proof. After determining the hash value of each second electronic evidence of the original electronic evidence, the blockchain 20 may respectively send the hash value of the first electronic evidence and the hash value of the second electronic evidence of the same evidence type to the consensus node, so that the consensus node verifies whether the first electronic evidence and the second electronic evidence of each evidence type are consistent, and sends a signature confirmation message after the verification is passed. When the signature confirmation message sent by the consensus node meets the preset consensus policy, it may be determined that the first electronic evidence and the second electronic evidence of the evidence type corresponding to the signature confirmation message are consistent, which indicates that the first electronic evidence of the evidence type submitted by the target object 10 is a valid electronic evidence, and thus the block chain 20 may submit the first electronic evidence of the evidence type to the court 30.

Referring to fig. 2, fig. 2 is a schematic flow chart of the electronic evidence processing method provided in the embodiment of the present application. The electronic proof processing method shown in fig. 2 may include the following steps S1 to S5.

And S1, receiving the evidence demonstration request submitted by the target object.

In some possible embodiments, when the target object needs to submit evidence to the court, an attestation request carrying the duplicate electronic evidence may be submitted to demonstrate to the court. Furthermore, the verification request carries a digital signature of the copy electronic evidence besides the copy electronic evidence, wherein the digital signature of the copy electronic evidence is obtained by signing the copy electronic evidence based on a private key of the target object before the target object submits the verification request, and the digital signature of the copy electronic evidence can prevent the copy electronic evidence from being tampered and further can indicate that the source of the verification request is the target object. In addition, the proof request may further carry a block height and an identity of the target object, where the block height and the identity are used to determine a hash value of each second electronic evidence of the original evidence of the duplicate evidence from the blockchain, which may be specifically described in the following detailed description.

Further, when the proof request is a request submitted by a target object in response to proof notification information issued by a court, the proof notification information corresponding to the proof request can be determined and the proof period specified in the proof notification information can be determined. And comparing the proof period with the proof time of the proof request submitted by the target object, if the proof time is within the proof period, further processing based on the content carried by the proof request, and if the proof time is out of the proof period, returning a proof overdue notice to the target object to inform that the current time of the target object exceeds the deadline specified by the proof notice information.

S2, classifying the duplicate electronic evidence according to the evidence types to obtain first electronic evidences of a plurality of evidence types, and determining the hash value of each first electronic evidence based on the hash determination mode corresponding to each evidence type.

In some feasible manners, after receiving the proof request submitted by the target object, the public key of the target object may be further acquired, or the public key of the target object is determined from the stored public key library, so as to decrypt the digital signature of the copy electronic proof based on the public key of the target object, and obtain the digest information of the copy electronic proof. On the other hand, the copy electronic evidence carried in the proof-proving request can be obtained, and the hash calculation is carried out on the copy electronic evidence to obtain another summary information of the copy electronic evidence. At this time, the two pieces of summary information of the electronic evidence of the copy can be compared, and if the two pieces of summary information are completely consistent, it indicates that the electronic evidence of the copy submitted by the target object is not tampered and the proof request is indeed submitted by the target object during the period from the time the proof request is submitted by the target object to the time the proof request is received, so that the proof request can be determined to be a valid request. On the other hand, if the two pieces of summary information of the copy electronic evidence are inconsistent, the copy electronic evidence is falsified in the submission process of the proof request. If the digital signature of the copy electronic evidence cannot be decrypted based on the public key of the target object, the target object is indicated to adopt other secret keys except the private key to sign the copy electronic evidence, or other objects submit the proof-proving request with the identity of the target object. The proof request may be determined to be an invalid request based on any of the above methods.

In some possible embodiments, when an attestation request submitted by a target object is a valid request, the electronic evidence of the copy carried by the attestation request may be classified according to different evidence types, where the evidence types include, but are not limited to, a text type, a picture type, a video type, and the like, and may be specifically determined based on an actual application scenario, which is not limited herein. For example, when the proof-holding request carries multiple copies of electronic evidence, the multiple copies of electronic evidence can be classified according to text evidence, picture evidence, video evidence and the like, and when the copy of electronic evidence carried in the proof-holding request is a file, the copy of electronic evidence can be split according to different evidence types to obtain multiple first electronic evidences. It should be particularly noted that the evidence type of the duplicate electronic evidence and the specific implementation manner of classifying based on the evidence type may be determined based on an actual application scenario, and are not limited herein.

In some feasible embodiments, after the duplicate electronic evidence is classified according to the evidence types to obtain first electronic evidences of multiple evidence types, hash values of the first electronic evidences can be determined based on a hash determination mode corresponding to each evidence type, where the hash determination mode corresponding to each evidence type is required to be consistent with a hash determination mode of hash values of second electronic evidences when the hash values of the second electronic evidences of the original electronic evidences are stored in the block chain. A specific process of storing the hash value of the second electron of the original electronic proof into the block chain may be referred to in fig. 3, and fig. 3 is another schematic flow chart of the electronic proof processing method provided in the embodiment of the present application. The electronic proof processing method shown in fig. 3 may include the following steps S201 to S205.

S201, receiving a certificate storing request submitted by a target object.

In some possible embodiments, when the target object needs to store the electronic evidence original to prevent the evidence from being lost, the electronic evidence original may be converted into the electronic evidence to obtain the original electronic evidence, and a storage request carrying the original electronic evidence is submitted to the block chain. The target object may be an individual, a group, or a corporate representative, and may be determined based on an actual application scenario, which is not limited herein. Further, the certificate storing request carries the digital signature of the original electronic evidence besides the original electronic evidence, wherein the digital signature of the original electronic evidence is obtained by signing the original electronic evidence based on a private key of the target object before the target object submits the certificate storing request, and the digital signature of the original electronic evidence can prevent the original electronic evidence from being tampered and further can indicate that the source of the certificate storing request is the target object.

S202, determining whether the proof request is a valid request based on the original electronic evidence and the digital signature of the original electronic evidence.

In some feasible embodiments, after receiving the certification storage request submitted by the target object, the public key of the target object may be further acquired, or the public key of the target object is determined from a stored public key library, so as to decrypt the digital signature of the original electronic certification based on the public key of the target object, and obtain the digest information of the original electronic certification. On the other hand, the original electronic evidence carried in the evidence storing request can be obtained, and the hash calculation is carried out on the original electronic evidence to obtain another abstract information of the original electronic evidence. At this time, the two pieces of summary information of the original electronic evidence can be compared, and if the two pieces of summary information are completely consistent, it indicates that the original electronic evidence submitted by the target object is not tampered and the evidence-saving request is indeed submitted by the target object during the period from the submission of the evidence-saving request by the target object to the receipt of the evidence-saving request, so that the evidence-saving request can be determined to be a valid request.

On the other hand, if the two pieces of summary information of the original electronic evidence are inconsistent, the original electronic evidence is falsified in the process of submitting the evidence storing request. If the digital signature of the original electronic evidence cannot be decrypted based on the public key of the target object, it indicates that the target object adopts other secret keys except the private key to sign the original electronic evidence, or that other objects submit the certificate storing request in the identity of the target object. The credential request may be determined to be an invalid request based on any of the above methods.

And S203, if the proof-proving request is an effective request, classifying the original electronic evidence according to the evidence types to obtain second electronic evidences of a plurality of evidence types.

In some feasible embodiments, when the proof-presenting request is determined to be an effective request, the original electronic evidence may be subjected to evidence classification according to the evidence types to obtain second electronic evidences of multiple evidence types, and a specific implementation manner may refer to an implementation manner of classifying duplicate evidences, which is not described herein again.

And S204, determining the hash value of each second electronic evidence based on the hash determination mode corresponding to each evidence type.

In some possible embodiments, after the raw electronic evidence is classified into a plurality of second electronic evidences, a hash determination manner may be determined based on an evidence type of each second electronic evidence, and a hash value of each second electronic evidence may be determined based on the corresponding hash determination manner. Specifically, for the second electronic evidence of which the evidence type is the text type, the hash calculation may be performed on the second electronic evidence by using an information summarization algorithm to obtain a hash value of the second electronic evidence of the text type. The above information Digest algorithms include, but are not limited to, Cyclic Redundancy Check-8 (Cyclic Redundancy Check-8, CRC8), Cyclic Redundancy Check-16 (Cyclic Redundancy Check-16, CRC16), Cyclic Redundancy Check-32 (Cyclic Redundancy Check-32, CRC32), information Digest Algorithm version 2(Message-Digest Algorithm 2, MD2), information Digest Algorithm version 4(Message-Digest Algorithm 4, MD4), information Digest Algorithm version 5(Message-Digest Algorithm 5, MD5), Secure Hash Algorithm 1(Secure Hash Algorithm1, SHA1), Secure Hash Algorithm MD 256(Secure Hash Algorithm 256, SHA256), Secure Hash Algorithm384 (Secure Hash Algorithm384, SHA384), Secure Hash Algorithm 512(Secure Hash Algorithm 512), Secure Hash Algorithm 512, Secure Hash Algorithm ma 512, and original Hash Algorithm Digest 512 (copy Algorithm 512, Hash Algorithm Digest Algorithm 512, and the like, The TIGER and Adler-3 algorithms may be determined based on actual application scenarios, and are not limited herein. The lengths and the expression forms of the hash values obtained by different information summarization algorithms are different. For example, a hash value represented by an 8-bit hexadecimal number is obtained based on CRC32, a hash value represented by a 32-bit hexadecimal number is obtained based on MD5, and a hash value having a length of 32 bytes (256 bits) is obtained based on SHA 256.

For example, referring to fig. 4, fig. 4 is a schematic view of a scenario for determining a hash value of an electronic evidence provided in an embodiment of the present application. The electronic proof shown in fig. 4 is a delinquent agreement, and it is not difficult to know that the electronic proof is a text-type electronic proof. At this time, if the protocol content of the owing protocol is hashed based on MD5, the hash value of the obtained 32-bit hexadecimal number is "d 89934a5070c213bee01eaa44ac328 ed", and if the protocol content is hashed based on SHA256, the hash value of the obtained 32-bit hexadecimal number is "5 c3ac6a25e8915341b10dc91c6843f4aa7ca828b 422df518764b1bf9f544d 7".

Optionally, in some possible embodiments, for the second electronic evidence of which the evidence type is the picture type, the second electronic evidence of the picture type may be converted into a grayscale map with a preset size, and the hash value of the second electronic evidence of the picture type is determined based on each grayscale value of the grayscale map. Specifically, in order to obtain the image features of the second electronic evidence as much as possible, the second electronic evidence may be scaled into a scaled graph with a preset size, where the preset size may be 8 × 8, 9 × 9, and the like, and may be determined based on an actual application scenario, which is not limited herein. Further, the Gray value of each pixel in the scaled graph may be calculated to convert the scaled graph into a Gray graph, and the Gray value corresponding to each pixel may be obtained based on any one of a floating point algorithm (Gray ═ R0.3 + G0.59 + B0.112), an integer method (Gray ═ R30 + G59 + B11)/100), a shift method (Gray ═ R76 + G151 + B28) > >8), and an average value method (Gray ═ R + G + B)/3), where Gray represents a Gray value, R represents a red color value, G represents a green color value, and B represents a blue color value. Optionally, the green color value corresponding to each pixel point may also be determined as the gray value corresponding to the pixel point, and the specific implementation manner may be determined based on an actual application scene, which is not limited herein. After the gray scale image of the second electronic evidence is obtained, the gray scale average value of all the gray scale values of the gray scale image can be obtained, each gray scale value in the gray scale image is traversed to compare each gray scale value in the gray scale image with the gray scale average value, the gray scale value larger than the gray scale average value is recorded as 1, the gray scale value not larger than the gray scale average value is recorded as 0, then a data sequence composed of 0 and 1 can be obtained, and at the moment, the data sequence can be determined as the hash value of the second electronic evidence. The number of bits of the hash value (data sequence) of the second electronic proof is consistent with the number of gray values in the gray map, for example, if the size of the gray map is 8 × 8, the gray map includes 64 gray values, and the corresponding hash value of the second electronic proof is a data sequence consisting of 64 0 s or 1 s. It should be noted that, when traversing each gray value to compare it with the average value of the gray values, the sequence may be determined based on the actual application scenario, each gray value is compared only once, and the sequence of 1 or 0 in the data sequence corresponding to each gray value is consistent with the traversal sequence of the gray values.

For example, referring to fig. 5, fig. 5 is a schematic diagram of another scenario for determining a hash value of an electronic evidence provided in an embodiment of the present application. Suppose that scaling the electronic proof results in 8 × 8 scaling maps, and after converting the scaling maps into gray-scale maps, the gray-scale maps of the electronic proof in fig. 5 are obtained. The gray values in the gray map of the electronic proof can be compared with the average gray value of 6.35 to obtain a 64 data sequence. Taking the gray value of the last line in the gray-scale map of the electronic evidence as an example, 8 gray values of "11, 2, 10, 4, 15, 4, 6, 3" can be compared with the average gray value of 6.35 to obtain a data sequence "10101000" according to the comparison sequence, and the data sequence is the data sequence 8 of the hash value of the electronic evidence.

Optionally, in some possible embodiments, in order to further improve the accuracy of the hash value of the second electronic evidence of the picture type, the frequency domain value of the grayscale map may be used to determine the hash value of the second electronic evidence. Specifically, the grayscale image of the second electronic evidence may be subjected to discrete cosine transform to obtain a discrete image having a size consistent with that of the grayscale image. At this time, a scaled discrete map with a certain size (which may be determined based on the actual application scenario, but is not limited thereto) may be determined from the upper left corner of the discrete map to obtain the low frequency part of the gray scale map. At this time, the frequency domain average value of all the pixel points of the scaled discrete graph can be determined, each frequency domain value of the scaled discrete graph is traversed to compare each frequency domain value in the scaled discrete graph with the frequency domain average value, the frequency domain value larger than the frequency domain average value is recorded as 1, the frequency domain value not larger than the frequency domain average value is recorded as 0, then a data sequence composed of 0 and 1 can be obtained, and at this time, the data sequence can be determined as the hash value of the second electronic evidence. The number of bits of the hash value (data sequence) of the second electronic evidence is consistent with the number of frequency domain values in the scaled discrete graph, for example, the size of the scaled discrete graph is 8 × 8, the scaled discrete graph contains 64 frequency domain values, and the corresponding hash value of the second electronic evidence is a data sequence consisting of 64 0 s or 1 s. It should be noted that, when traversing each frequency-domain value to compare it with the frequency-domain average value, the order of traversing each frequency-domain value to compare it with the frequency-domain average value may be determined based on the actual application scenario, each frequency-domain value is compared only once, and the order of 1 or 0 corresponding to each frequency-domain value in the data sequence coincides with the traversal order of the frequency-domain value.

For example, as shown in fig. 6, fig. 6 is a schematic diagram of another scenario for determining a hash value of an electronic evidence provided in the embodiment of the present application. As shown in fig. 6, the size of the gray scale map of the second electronic proof is 32 × 32, and discrete cosine transform is performed on the gray scale map to obtain a discrete map with the size of 32 × 32. At this time, the discrete graph includes 1024 frequency-domain values, and in order to ensure that the accurate frequency-domain value of the second electronic evidence is obtained, 8 rows are taken in the transverse direction and 8 rows are taken in the longitudinal direction from the first frequency-domain value at the upper left corner of the discrete graph, so as to obtain a scaled discrete graph with the size of 8 × 8. At this time, each frequency domain value in the scaled discrete map may be sequentially compared with the frequency domain average value of all frequency domain values in the scaled discrete map according to a certain sequence, and each time one frequency domain value is not less than the frequency domain average value, the frequency domain value is sequentially recorded as 0, and each time one frequency domain value is greater than the frequency domain average value, the frequency domain value is sequentially recorded as 1, so that a finally obtained 64-bit sequence composed of 1 and 0 is determined as the hash value of the second feature image of the first image.

Optionally, in some feasible embodiments, for the second electronic evidence with the evidence type being the video type, binary data corresponding to the second electronic evidence with the video type may be obtained, and the hash value of the second electronic evidence with the video type may be obtained by performing hash calculation on the binary data based on an information digest algorithm. For a specific implementation manner of performing the hash calculation on the binary data, reference may be made to an implementation manner of determining the hash value of the second electronic evidence of the text type based on an information summarization algorithm, which is not described herein again.

S205, generating an identity based on the identity information of the target object, marking the hash value of each second electronic evidence based on the identity, storing the hash value of each second electronic evidence to the target block, and returning the block height of the target block to the target object.

In some possible embodiments, after determining the hash value of each second electronic evidence, an identity may be generated based on the identity information of the target object to mark the hash value of the second electronic evidence to establish an association relationship between the target object and the second electronic evidence. The identity information of the target object may be carried in a certificate storing request submitted by the target object, or may be obtained from the target object after determining the hash value of each second electronic evidence, which may be specifically determined based on an actual application scenario, and is not limited herein. Further, the second electronic evidence can be classified and stored for the convenience of storage and management of the second electronic evidence. Specifically, the merck tree may be respectively constructed based on the hash value of the second electronic evidence of each evidence type, for example, a first merck tree may be constructed based on the hash value of the second electronic evidence of the text type, a second merck tree may be constructed based on the hash value of the second electronic evidence of the picture type, a third merck tree may be constructed based on the hash value of the second electronic evidence of the video type, and then the different types of second electronic evidence may be classified and stored. For the building process of any one of the first, second, and third mercker trees, hash values of the second electronic evidences of the same type may be arranged laterally (a specific arrangement manner may be based on the evidence generation time, the page number order, and the like, and may be determined based on an actual application scenario, which is not limited herein). When the number of the hash values of the second electronic evidence of the same type is even, every two hash values of the second electronic evidence can be connected in series in sequence, and hash calculation is performed on the hash values of the two second electronic evidences after the two second electronic evidences are connected in series to obtain a plurality of upper-layer hash values. Each upper-layer hash value (hereinafter referred to as a first upper-layer hash value for convenience of description) obtained at this time is obtained by connecting two basic hash values in series and then performing hash calculation. When the number of the first upper layer hash values is 1, only one upper layer hash value can be determined as the target hash value, and a merkel tree including two leaf nodes and a root node can be obtained. When the number of the first upper-layer nodes is not 1 and is an even number, connecting every two upper-layer hash values in series again and performing hash calculation to obtain at least one second upper-layer hash value, and so on until the last upper-layer hash value is obtained. At this time, the last upper-layer hash value is the hash value of the root node of the merkel tree, the rest upper-layer hash values are the hash values of the middle nodes of the merkel tree, and the hash values of the second electronic evidences are leaf nodes of the merkel tree.

Optionally, when the number of the hash values of the second electronic evidence of the same type is an odd number, the hash values of every two second electronic evidences may be sequentially connected in series and hash calculation may be performed on the hash values of the two second electronic evidences connected in series to obtain a plurality of upper-layer hash values. And at the moment, each obtained first upper-layer hash value is obtained by connecting two hash values of the second electronic evidence in series and then performing hash calculation, and one hash value of the second electronic evidence does not participate in the calculation of the first upper-layer hash value. At this time, the hash value of the second electronic evidence not participating in the calculation of the first hash value and the obtained first upper-layer hash value may be together obtained based on the implementation manner to obtain at least one second upper-layer hash value, and so on until the last upper-layer hash value is obtained. At this time, the last upper-layer hash value is the hash value of the root node of the merkel tree, and the rest upper-layer hash values are the hash values of the intermediate nodes of the merkel tree.

Optionally, when the number of the hash values of the second electronic evidence is an odd number, any one of the hash values of the second electronic evidence may be copied to obtain an even number of hash values of the second electronic evidence, and then every two hash values of the second electronic evidence are sequentially connected in series again and hash calculation is performed on the two hash values of the second electronic evidence after being connected in series to obtain a plurality of upper-layer hash values. And at the moment, each obtained first upper-layer hash value is obtained by connecting two hash values of the second electronic evidence in series and then performing hash calculation, and one hash value of the second electronic evidence does not participate in the calculation of the first upper-layer hash value. At this time, the hash value of the second electronic evidence participating in the calculation of the first hash value and the obtained first upper-layer hash value may be together obtained based on the implementation manner to obtain at least one second upper-layer hash value, and so on until the last upper-layer hash value is obtained. At this time, the last upper-layer hash value is the hash value of the root node of the merkel tree, and the rest upper-layer hash values are the hash values of the intermediate nodes of the merkel tree.

Further, when the number of the upper-layer hash values obtained from the hash values of the second electronic evidence based on any one of the above implementation manners is greater than 1 and is an odd number, the upper-layer hash values may be processed by using any one of the above processing methods for the hash values of the odd number of second electronic evidence, and a specific implementation manner is not limited herein.

In some possible embodiments, the hash value of the root node of the first mercker tree, the hash value of the root node of the second mercker tree, and the hash value of the root node of the third mercker tree may be further used as leaf nodes to construct a fourth mercker tree, respectively. Referring to fig. 7, fig. 7 is a schematic view of a scenario for building a mercker tree according to an embodiment of the present application. In fig. 7, hash values corresponding to leaf nodes in the first merkel tree are hash value 1 and hash value 2, hash value 1 and hash value 2 are hash values of the second electronic evidence of the same evidence type (e.g., text type), and hash value 12 is a hash value of a root node of the first merkel tree. Hash values corresponding to leaf nodes in the second merkel tree are hash value 3 and hash value 4, hash value 3 and hash value 4 are hash values of the second electronic evidence of the same evidence type (such as a picture type), and hash value 34 is a hash value of a root node of the second merkel tree. Hash values corresponding to leaf nodes in the third tachr tree are hash value 5 and hash value 6, hash value 5 and hash value 6 are hash values of the second electronic evidence of the same evidence type (such as a video type), and hash value 56 is a hash value of the root node of the first tachr tree. A fourth mercker tree can be further constructed based on the hash value of the root node of the first mercker tree (hash value 12), the hash value of the root node of the second mercker tree (hash value 34) and the hash value of the root node of the third mercker tree (hash value 56), wherein the hash value of the root node of the fourth mercker tree is 123456.

Further, in some possible embodiments, the block chain is composed of a plurality of blocks, each block includes a block header and a block body, the block header stores the characteristic value of the input information, and the version number, the timestamp, the difficulty value, and the like, and the block body stores the input information. Referring to fig. 8, fig. 8 is a schematic diagram illustrating a block according to an embodiment of the present disclosure. As shown in fig. 8, one block above each block is a parent block, and the next block also includes a block header and a block main body, where the block header stores an input information characteristic value of the current block, a block header characteristic value of the parent block, a version number, a timestamp, and a difficulty value, and so on, so that the block data stored in each block in the block chain is associated with the block data stored in the parent block, thereby ensuring the security of the input information in the block. When a new block is generated, the block hash value of the last block in the current block chain may be obtained as the block header characteristic value of the parent block in the block header of the new block, and the timestamp may be updated to the generation time of the new block. Meanwhile, different random numbers are tried, and the characteristic value calculation is carried out for multiple times, so that the calculated block head characteristic value can meet the following formula:

SHA256(SHA256(version+prev_hash+merkle_root+ntime+nbits+x))<TARGET

wherein, SHA256 is a characteristic value algorithm used for calculating a characteristic value; version is version information of the relevant block protocol in the block chain; prev _ hash is a block header characteristic value of a parent block of the new block; merkle root is an input information characteristic value; ntime is the update time of the update timestamp; nbits is the current difficulty, is a fixed value within a period of time, and is determined again after exceeding a fixed time period; x is a random number; TARGET is a feature threshold, which can be determined from nbits. Thus, when the random number satisfying the above formula is obtained by calculation, the block header of the new block can be constructed based on the hash value of the root node of the fourth merkel tree, the timestamp, the difficulty value, the version number, and the block header feature value of the parent block. And storing the complete fourth Merck tree and each second electronic evidence into a block body of the new block to obtain a new block, taking the new block as a target block for storing the original electronic evidence, and connecting the target block to the last block chain of the current block to finish the uplink storage of the original electronic evidence. Optionally, after the target block is chained, or after each second electronic proof of the original electronic proof is stored in the target block, the block height of the target block may be returned to the target object, so that the target object determines the target block storing the original electronic proof submitted by the target object from the block chain based on the block height.

And S3, determining a target block from the block chain based on the block height, and acquiring the hash value of each second electronic evidence of the original electronic evidence from the target block based on the identity.

In some possible embodiments, a target block corresponding to the height of the block may be determined from the block chain, a block body of the target block may be analyzed to obtain a mercker tree of the target block, and a hash value of a leaf node marked by the identity identifier may be determined from the mercker tree, where the hash value of one leaf node is a hash value of a second electronic evidence of the original electronic evidence. Optionally, each second electronic evidence of the original electronic evidence may be obtained from the block body of the target block, and the hash value of each second electronic evidence is obtained by performing hash operation on each second electronic evidence. Optionally, the block of the target block may be further analyzed to obtain a hash value of the root node in the block, and further, hash values of the second electronic evidences are obtained based on the hash values of the block.

And S4, respectively sending the hash value of the first electronic evidence and the hash value of the second electronic evidence of the same evidence type to the consensus node, so that the consensus node verifies whether the first electronic evidence and the second electronic evidence of each evidence type are consistent or not, and sending a signature confirmation message after the verification is passed.

In some possible embodiments, after determining the hash value of each first electronic evidence and obtaining the hash value of each second electronic evidence, the same type of first electronic evidence and the same type of second electronic evidence may be sent to the consensus node, so that the consensus node verifies whether the hash value of the first electronic evidence and the hash value of the second electronic evidence are consistent, and sends the signature confirmation message after verifying that the first electronic evidence and the second electronic evidence of one evidence type pass each time. At this time, the consensus node returns a signature confirmation message, which may be any form of information that the hash value of the first electronic evidence and the hash value of the second electronic evidence of the type used for description pass verification, and the specific information content is not limited herein. Meanwhile, the signature confirmation message generated by each consensus node can represent the generation node of the signature confirmation message, so that after the signature confirmation message of each consensus node is received, the consensus node which sends the signature confirmation message can be determined according to the signature confirmation message. Optionally, after generating the signature confirmation message, each common node may perform hash calculation on the signature confirmation message to generate a digest, and encrypt the digest by its own private key to prevent the signature confirmation message from being tampered.

And S5, receiving the signature confirmation message and submitting the first electronic evidence of the evidence type corresponding to the signature confirmation message to the court when the signature confirmation message meets the preset consensus strategy.

In some possible embodiments, signature confirmation messages sent by a plurality of consensus nodes in the block chain may be received, and it may be determined that the first electronic evidence and the second electronic evidence of the same type are consistent when each received signature confirmation message satisfies a preset consensus policy. The preset consensus strategy may be that when a certain proportion of the consensus nodes in all the consensus nodes in the block chain confirm that the hash value of the first electronic evidence and the hash value of the second electronic evidence of the same type are consistent, for example, when a signature confirmation message sent by ninety-five percent of the consensus nodes is received, the first electronic evidence and the second electronic evidence of the same type are considered to be consistent. Or, the preset consensus strategy may be that when receiving the signature confirmation message sent by the multiple consensus nodes in the block chain, it is determined whether the consensus node sending the signature confirmation message belongs to a preset consensus node based on the signature in the signature confirmation message, and the first electronic evidence and the second electronic evidence of the same type may be considered to be consistent after the consensus node sending the signature confirmation message is the preset consensus node and/or the consensus node sending the signature confirmation message exceeds all the consensus nodes in the block chain by a certain ratio. It should be particularly noted that the predetermined consensus policy may further include, but is not limited to, a workload certification mechanism (Proof of Work, PoW), a rights and interests certification mechanism (Proof of stamp, PoS), a rights and rights certification mechanism (freed Proof of stamp, DPoS) Practical Byzantine mechanism (PBFT), a Ripple consensus algorithm, and the like, and may be specifically determined based on an actual application scenario, which is not limited herein.

Further, when the first electronic evidence and the second electronic evidence of the same type are consistent, it is indicated that the first electronic evidence of the type in the copy electronic evidence submitted by the target object is a real and valid electronic evidence, and at this time, the first electronic evidence of the type can be submitted to the court, so that the court can further review the electronic evidence. When the signature confirmation message corresponding to any evidence type does not meet the preset consensus strategy, it is indicated that the electronic evidence (for convenience of description, hereinafter referred to as target electronic evidence) of the evidence type is tampered by the target object, or a new evidence submitted for the target object but the target object does not perform evidence saving processing on the new evidence, at this time, an intelligent contract can be called to verify whether the target electronic evidence is a legal evidence, a specific verification mode can be determined based on an actual application scene, and no limitation is made here. When the target electronic evidence is legal evidence, the target electronic evidence can be submitted to a court and a new evidence submitting notice is sent to the court so as to inform the court that the target electronic evidence is new evidence. When the target electronic evidence is not legal evidence, the target object may be returned an invalid evidence notification to inform the target object that the target electronic evidence is not legal evidence.

Referring to fig. 9, fig. 9 is a schematic structural diagram of an electronic evidence processing apparatus provided in an embodiment of the present application. The device 1 provided by the embodiment of the application comprises:

the first receiving module 10 is configured to receive an attestation request submitted by a target object, where the attestation request carries a copy electronic evidence, a block height, and an identity of the target object;

the first determining module 11 is configured to classify the duplicate electronic evidence according to evidence types to obtain first electronic evidences of multiple evidence types, and determine a hash value of each first electronic evidence based on a hash determining manner corresponding to each evidence type, where the evidence types include a text type, a picture type, and a video type;

a second determining module 12, configured to determine a target block from the block chain based on the block height, and obtain a hash value of each second electronic evidence of an original electronic evidence from the target block based on the identity, where the original electronic evidence is an original evidence of the duplicate electronic evidence;

the first verification module 13 is configured to send the hash value of the first electronic evidence and the hash value of the second electronic evidence of the same evidence type to a consensus node, so that the consensus node verifies whether the first electronic evidence and the second electronic evidence of each evidence type are consistent, and sends a signature confirmation message after the verification is passed;

the first submitting module 14 is configured to receive the signature confirmation message, and submit the first electronic evidence of the evidence type corresponding to the signature confirmation message to the court when the signature confirmation message satisfies a preset consensus policy.

In some possible embodiments, the above-mentioned device 1 further comprises:

the second receiving module 15 is further configured to receive a certificate storing request submitted by the target object, where the certificate storing request carries an original electronic evidence and a digital signature of the original electronic evidence;

the third determining module 16 is further configured to determine whether the proof request is a valid request based on the original electronic evidence and the digital signature of the original electronic evidence;

the classification module 17 is further configured to, if the proof-proving request is an effective request, classify the original electronic evidence according to evidence types to obtain second electronic evidences of multiple evidence types, where the evidence types include a text type, a picture type, and a video type;

the fourth determining module 18 is further configured to determine a hash value of each second electronic evidence based on the hash determining manner corresponding to each evidence type;

the storage module 19 is further configured to generate an identity identifier based on the identity information of the target object, mark the hash value of each second electronic evidence based on the identity identifier, store the hash value of each second electronic evidence in a target block, and return the block height of the target block to the target object.

In some possible embodiments, the fourth determining module 18 includes:

the first processing unit 181 is configured to perform hash calculation on the second electronic evidence of the text type based on an information summarization algorithm to obtain a hash value of the second electronic evidence of the text type;

a second processing unit 182, configured to convert the second electronic evidence of the picture type into a grayscale map with a preset size, and determine a hash value of the second electronic evidence of the picture type based on each grayscale value of the grayscale map;

the third processing unit 183 is configured to determine binary data corresponding to the second electronic evidence of the video type, and perform hash calculation on the binary data based on the information digest algorithm to obtain a hash value of the second electronic evidence of the video type.

In some possible embodiments, the storage module 19 includes:

a first constructing unit 191, configured to construct a merck tree based on the hash value of the second electronic evidence of each evidence type, to obtain a first merck tree, a second merck tree, and a third merck tree;

a second constructing unit 192, configured to construct a fourth mercker tree based on the first mercker tree, the second mercker tree, and the third mercker tree;

a third constructing unit 193, configured to construct a block based on the fourth merkel tree, construct a block header based on a hash value of a root node of the fourth merkel tree, and construct a target block based on the block header and the block header.

In some possible embodiments, the above-mentioned device 1 further comprises:

a fifth determining module 20, configured to determine the proof notification information corresponding to the proof request, and determine the proof deadline specified by the proof notification information;

the first comparing module 21 is further configured to determine an attestation time when the target object submits the attestation request, and compare the attestation time with the attestation deadline;

the first processing module 22 is further configured to, if the proof time is within the proof time limit, perform the step of classifying the copy electronic proofs according to the proof types to obtain a first electronic proof of a plurality of proof types, and if the proof time is not within the proof time limit, return an proof expiration notification to the target object.

In some possible embodiments, the above-mentioned device 1 further comprises:

the second verification module 23 is further configured to, when the signature confirmation message corresponding to any one of the evidence types does not satisfy the preset consensus policy, invoke an intelligent contract to verify whether the target first electronic evidence corresponding to the any one of the evidence types is a legal evidence;

the second submitting module 24 is further configured to submit the target first electronic evidence to the court and send a new evidence submitting notification to the court if the target first electronic evidence is a legal evidence;

the returning module 25 is further configured to, if the target first electronic evidence is not a legal evidence, return an invalid evidence notification to the target object, where the invalid evidence notification is used to indicate that the target first electronic evidence is an invalid evidence.

In some possible embodiments, the above-mentioned device 1 further comprises:

the obtaining module 26 is further configured to obtain a public key of the target object, and decrypt the digital signature of the copy electronic evidence based on the public key to obtain first digest information of the copy electronic evidence;

the second processing module 27 is further configured to determine second summary information of the duplicate electronic evidence;

the second comparing module 28 is further configured to compare the first summary information with the second summary information, and if the first summary information is consistent with the second summary information, determine that the attestation request is a valid request.

In a specific implementation, the apparatus 1 may execute, through each built-in functional module thereof, the implementation manners provided in each step in fig. 2 and/or fig. 8, which may specifically refer to the implementation manners provided in each step, and no further description is given here.

Referring to fig. 10, fig. 10 is a schematic structural diagram of an apparatus provided in an embodiment of the present application. As shown in fig. 10, the apparatus 1000 in the present embodiment may include: the processor 1001, the network interface 1004, and the memory 1005, and the apparatus 1000 may further include: a user interface 1003, and at least one communication bus 1002. Wherein a communication bus 1002 is used to enable connective communication between these components. The user interface 1003 may include a Display screen (Display) and a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface and a standard wireless interface. The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface). The memory 1004 may be a high-speed RAM memory or a non-volatile memory (e.g., at least one disk memory). The memory 1005 may optionally be at least one memory device located remotely from the processor 1001. As shown in fig. 10, a memory 1005, which is a kind of computer-readable storage medium, may include therein an operating system, a network communication module, a user interface module, and a device control application program.

In the device 1000 shown in fig. 10, the network interface 1004 may provide network communication functions; the user interface 1003 is an interface for providing a user with input; and the processor 1001 may be used to invoke a device control application stored in the memory 1005 to implement:

In some possible embodiments, the processor 1001 is further configured to:

In some possible embodiments, the processor 1001 is configured to:

In some possible embodiments, the processor 1001 is further configured to:

determining second summary information of the copy electronic evidence;

It should be understood that in some possible embodiments, the processor 1001 may be a Central Processing Unit (CPU), and the processor may be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), field-programmable gate arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The memory may include both read-only memory and random access memory, and provides instructions and data to the processor. The portion of memory may also include non-volatile random access memory. For example, the memory may also store device type information.

In a specific implementation, the device 1000 may execute, through each built-in functional module thereof, the implementation manners provided in each step in fig. 2 and/or fig. 8, which may specifically refer to the implementation manners provided in each step, and no further description is given here.

An embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and is executed by a processor to implement the method provided in each step in fig. 2 and/or fig. 8, which may specifically refer to the implementation manner provided in each step, and is not described herein again.

The computer readable storage medium may be an internal storage unit of the task processing device provided in any of the foregoing embodiments, for example, a hard disk or a memory of an electronic device. The computer readable storage medium may also be an external storage device of the electronic device, such as a plug-in hard disk, a Smart Memory Card (SMC), a Secure Digital (SD) card, a flash card (flash card), and the like, which are provided on the electronic device. The computer readable storage medium may further include a magnetic disk, an optical disk, a read-only memory (ROM), a Random Access Memory (RAM), and the like. Further, the computer readable storage medium may also include both an internal storage unit and an external storage device of the electronic device. The computer-readable storage medium is used for storing the computer program and other programs and data required by the electronic device. The computer readable storage medium may also be used to temporarily store data that has been output or is to be output.

The terms "first", "second", and the like in the claims and in the description and drawings of the present application are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus. Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments. The term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.

Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of illustrating clearly the interchangeability of hardware and software. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

The above disclosure is only for the purpose of illustrating the preferred embodiments of the present application and is not to be construed as limiting the scope of the present application, so that the present application is not limited thereto, and all equivalent variations and modifications can be made to the present application.

Claims

1. An electronic evidence processing method applied to a block chain, the method comprising:

classifying the copy electronic evidence according to evidence types to obtain first electronic evidences of a plurality of evidence types, and determining a hash value of each first electronic evidence based on a hash determination mode corresponding to each evidence type, wherein the evidence types comprise a text type, a picture type and a video type;

and receiving the signature confirmation message and submitting the first electronic evidence of the evidence type corresponding to the signature confirmation message to a court when the signature confirmation message meets a preset consensus strategy.

2. The method of claim 1, wherein prior to receiving the attestation request submitted by the target object, the method further comprises:

3. The method according to claim 2, wherein the determining the hash value of each second electronic evidence based on the hash determination corresponding to each evidence type comprises:

binary data corresponding to the second electronic evidence of the video type is determined, and the hash value of the second electronic evidence of the video type is obtained by performing hash calculation on the binary data based on the information digest algorithm.

4. The method of claim 2, wherein storing the hash value of each second electronic proof to a target chunk comprises:

building a block body based on the fourth Mercker tree, building a block head based on the hash value of the root node of the fourth Mercker tree, and building a target block based on the block head and the block head.

5. The method of claim 1, wherein after receiving the attestation request submitted by the target object, the method further comprises:

confirming the evidence-proving notification information corresponding to the evidence-proving request, and confirming the evidence-proving period specified by the evidence-proving notification information;

determining the evidence proving time for the target object to submit the evidence proving request, and comparing the evidence proving time with the evidence proving deadline;

and if the proof-presenting time is within the proof-presenting time limit, executing the step of classifying the copy electronic evidence according to evidence types to obtain first electronic evidences of a plurality of evidence types, and if the proof-presenting time is not within the proof-presenting time limit, returning an out-of-date proof notification to the target object.

6. The method of claim 1, further comprising:

and if the target first electronic evidence is not legal evidence, returning an invalid evidence notification to the target object, wherein the invalid evidence notification is used for indicating that the target first electronic evidence is invalid evidence.

7. The method of claim 1, wherein the attestation request further carries a digital signature of the electronic evidence of the copy, the method further comprising:

determining second summary information of the copy electronic evidence;

and comparing the first abstract information with the second abstract information, and if the first abstract information is consistent with the second abstract information, determining that the proof-proving request is an effective request.

8. An electronic evidence processing apparatus, characterized in that the apparatus comprises:

the first verification module is used for respectively sending the hash value of the first electronic evidence and the hash value of the second electronic evidence of the same evidence type to the consensus node so as to enable the consensus node to verify whether the first electronic evidence and the second electronic evidence of each evidence type are consistent or not, and sending a signature confirmation message after the verification is passed;

9. A device comprising a processor and a memory, the processor and memory interconnected;

the memory for storing a computer program comprising program instructions, the processor being configured to invoke the program instructions to perform the method of any of claims 1 to 7.

10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which is executed by a processor to implement the method of any one of claims 1 to 7.