CN108921552B - Evidence verification method and device - Google Patents

Evidence verification method and device Download PDF

Info

Publication number
CN108921552B
CN108921552B CN201810634929.8A CN201810634929A CN108921552B CN 108921552 B CN108921552 B CN 108921552B CN 201810634929 A CN201810634929 A CN 201810634929A CN 108921552 B CN108921552 B CN 108921552B
Authority
CN
China
Prior art keywords
hash value
contract
evidence
tampered
original
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810634929.8A
Other languages
Chinese (zh)
Other versions
CN108921552A (en
Inventor
张�诚
张行
林峰
丁雪
刘培旭
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Financial Certification Authority Co ltd
Original Assignee
China Financial Certification Authority Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Financial Certification Authority Co ltd filed Critical China Financial Certification Authority Co ltd
Priority to CN201810634929.8A priority Critical patent/CN108921552B/en
Publication of CN108921552A publication Critical patent/CN108921552A/en
Application granted granted Critical
Publication of CN108921552B publication Critical patent/CN108921552B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/389Keeping log of transactions for guaranteeing non-repudiation of a transaction

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Storage Device Security (AREA)

Abstract

In an embodiment of the present invention, a method for verifying an evidence is provided, including: calculating a first hash value of the evidence to be verified related to the contract; acquiring a first original hash value of the evidence to be verified from the contract, and matching the calculated first hash value with the first original hash value; when the first hash value obtained by calculation is successfully matched with the first original hash value, determining that the evidence to be verified is not tampered; in the scheme, the evidence itself is not stored in the contract, and the hash value related to the evidence is stored, so that if the evidence is tampered, the hash value of the tampered evidence is different from the hash value of the evidence which is not tampered, whether the evidence is tampered or not is easily identified, the complexity of verifying whether the evidence is tampered or not is reduced, and the efficiency is improved.

Description

Evidence verification method and device
Technical Field
The invention relates to the technical field of electronic contracts, in particular to a method and a device for verifying evidences.
Background
With the rapid growth of the internet, electronic commerce has become widespread in various countries, which has caused a great change in the conventional transaction form. Electronic contracts are widely used by people as an important basis and means for electronic commerce operation, which greatly promotes the development of digital economy. Individuals, businesses, and governments are currently unable to handle daily transactions and other business activities without leaving electronic contracts.
In the field of electronic contracts, in many cases, some materials related to electronic contracts need to be stored, such as evidences, and at present, the materials are generally stored separately from the electronic contracts, so that the materials need to be verified separately when verifying whether the materials are tampered, and the defects of high complexity and long time consumption exist.
Disclosure of Invention
In view of the above, the present invention has been made to provide a method and apparatus for verifying evidence that overcomes or at least partially solves the above problems, and is used to solve the poor security problem in the prior art.
According to a first aspect of the present invention, there is provided a method of verifying evidence, comprising:
calculating a first hash value of the evidence to be verified related to the contract;
acquiring a first original hash value of the evidence to be verified from the contract, and matching the calculated first hash value with the first original hash value;
and when the first hash value obtained by calculation is successfully matched with the first original hash value, determining that the evidence to be verified is not tampered.
In one embodiment, before matching the calculated first hash value with the first original hash value, the method according to the above embodiment of the present invention includes:
adding the first raw hash value to the contract.
In some embodiments, the method of any of the above embodiments of the present invention, adding the first raw hash value to the contract, comprises:
adding the first raw hash value to the contract in the form of an attachment by a file editing function.
In some embodiments, according to the method of any one of the above embodiments of the present invention, the evidence to be verified is in a format of at least one of a document, a picture, audio and video.
In some embodiments, the matching the calculated first hash value with the first original hash value according to the method of any of the above embodiments of the present invention includes:
judging whether the contract is tampered or not;
and when the contract is judged not to be tampered, matching the calculated first hash value with the first original hash value.
In some embodiments, the method of determining whether the contract is tampered includes:
calculating a second hash value of the contract;
judging whether the calculated second hash value is matched with the second original hash value of the contract or not;
determining that the contract has not been tampered with, comprising:
and when the second hash value obtained by calculation is judged to be matched with the second original hash value, determining that the contract is not tampered.
In a second aspect of embodiments of the present invention, there is provided an apparatus for verifying evidence, comprising:
the calculating unit is used for calculating a first hash value of the evidence to be verified related to the contract;
the matching unit is used for acquiring a first original hash value of the evidence to be verified from the contract and matching the calculated first hash value with the first original hash value;
and the determining unit is used for determining that the evidence to be verified is not tampered when the first hash value obtained by calculation is successfully matched with the first original hash value.
In one embodiment, the apparatus according to the foregoing embodiment of the present invention further includes an adding unit, configured to add the first original hash value to the contract.
In some embodiments, according to the apparatus of any one of the above embodiments of the present invention, the adding unit adds the first original hash value to the contract, including:
adding the first raw hash value to the contract in the form of an attachment by a file editing function.
In some embodiments, according to the apparatus of any one of the above embodiments of the present invention, the to-be-verified evidence is in a format of at least one of a document, a picture, audio and video.
In some embodiments, according to the apparatus of any one of the above embodiments of the present invention, the matching unit matching the calculated first hash value with the first original hash value includes:
judging whether the contract is tampered or not;
and when the contract is judged not to be tampered, matching the calculated first hash value with the first original hash value.
In some embodiments, according to the apparatus of any one of the above embodiments of the present invention, the determining, by the matching unit, whether the contract is falsified includes:
calculating a second hash value of the contract;
judging whether the calculated second hash value is matched with the second original hash value of the contract or not;
the matching unit determines that the contract has not been tampered with, including:
and when the second hash value obtained by calculation is judged to be matched with the second original hash value, determining that the contract is not tampered.
In an embodiment of the present invention, a method for verifying an evidence is provided, including: calculating a first hash value of the evidence to be verified related to the contract; acquiring a first original hash value of the evidence to be verified from the contract, and matching the calculated first hash value with the first original hash value; when the first hash value obtained by calculation is successfully matched with the first original hash value, determining that the evidence to be verified is not tampered; in the scheme, the evidence itself is not stored in the contract, and the hash value related to the evidence is stored, so that if the evidence is tampered, the hash value of the tampered evidence is different from the hash value of the evidence which is not tampered, whether the evidence is tampered or not is easily identified, the complexity of verifying whether the evidence is tampered or not is reduced, and the efficiency is improved.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
FIG. 1 is a flow chart of verifying evidence presented in accordance with an embodiment of the present invention;
FIG. 2 is a schematic diagram of an apparatus for verifying evidence according to an embodiment of the present invention;
FIG. 3 is another schematic diagram of an apparatus for verifying evidence presented in accordance with an embodiment of the present invention;
fig. 4 is another schematic diagram of an apparatus for verifying evidence proposed according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
FIG. 1 schematically shows a flowchart of a method 10 of accessing a page validation proof according to an embodiment of the invention. As shown in fig. 1, the method 10 may include steps 100, 110, and 120.
Step 100: calculating a first hash value of the evidence to be verified related to the contract;
step 110: acquiring a first original hash value of the evidence to be verified from the contract, and matching the calculated first hash value with the first original hash value;
step 120: and when the first hash value obtained by calculation is successfully matched with the first original hash value, determining that the evidence to be verified is not tampered.
In this embodiment of the present invention, step 110 describes that, to obtain the first original hash value from the contract, before matching the calculated first hash value with the first original hash value, the following operations are further included:
adding the first raw hash value to the contract.
In embodiments of the present invention, optionally, the adding of the first raw hash value to the contract may occur before the contract is signed.
There are multiple ways to add the first original hash value to the contract, and optionally, the following ways may be adopted:
adding the first raw hash value to the contract in the form of an attachment by a file editing function.
It should be noted that there may be multiple formats of the contract, and optionally, the Format may be PDF (Portable Document Format), or may also be word Format, or may also be excel Format, which is not limited herein.
When the contract is in PDF format, the first original hash value is added to the contract in the form of an attachment by the file editing function, the following manner may be adopted:
and adding the first original hash value into the contract in the form of an attachment through a file editing function based on PDF rules.
Similarly, when the contract is in word format, the first original hash value is added to the contract in the form of an attachment by the file editing function, the following manner may be adopted:
adding the first original hash value to the contract in the form of an attachment through a file editing function based on word rules;
when the contract is in excel format, the first original hash value is added to the contract in the form of an attachment by the file editing function, the following way can be adopted:
and adding the first original hash value into the contract in the form of an attachment through a file editing function based on an excel rule.
Of course, for documents of other formats, the manner of addition is similar to that described above and will not be described in detail here.
It should be noted that, the first original hash value is added to the contract in the form of an attachment, but may also be added to the contract in the form of a text or in other ways, and is not limited herein. Of course, this description applies to documents of different formats.
In the embodiment of the invention, the related knowledge of the hash algorithm is simply introduced.
The principle of the hash algorithm is to calculate the remainder according to the number of hash value servers of the data frame, and in this way, it is determined to which hash value server the content in the data frame is to be sent. In fact, it can be said that the relationship between sets corresponding to each other is equivalent to the process of mapping one data frame in one set to the corresponding data frame in another set.
The working principle of the hash table is to convert a data frame into a number form according to a certain set algorithm, for example, a hash algorithm, perform remainder calculation on the array length by the numbers, take the remainder, use the result as the next mark of the array, store the numerical value, and store the numerical value in the array space under the numerical index. If a query command is issued with respect to the hash table, the hash function may be used to convert the data frame into a corresponding array under its token, thereby obtaining the corresponding hash value from within the space.
The Hash algorithms used in the embodiments of the present invention are various, and optionally, the following may be used, for example, the MD4 Algorithm, the MD5 Algorithm, or the SHA 1(Secure Hash Algorithm, Secure Hash) Algorithm may also be used, and of course, other Hash algorithms may also be used, which is not specifically limited herein.
In this embodiment of the present invention, optionally, the to-be-verified evidence is in a format of at least one of a document, a picture, audio, and a video.
Of course, the above are just a few examples of the format of the evidence to be verified, and the invention is not limited to this in practical applications.
It should be noted that, in the embodiment of the present invention, that the first hash value obtained by calculation is successfully matched with the first original hash value may mean that the first hash value is completely consistent with the first original hash value, and of course, in a special case, the first hash value and the first original hash value may also mean that the first hash value and the first original hash value are successfully matched when an error between the two is within a certain range.
In the embodiment of the present invention, it may be determined whether the contract is tampered, and when the contract is not tampered, the first hash value of the evidence and the first original hash value are matched, that is, when the calculated first hash value and the first original hash value are matched, the following manner may be adopted:
judging whether the contract is tampered or not;
and when the contract is judged not to be tampered, matching the calculated first hash value with the first original hash value.
There are various ways to determine whether the contract is tampered, and optionally, the following ways may be adopted:
calculating a second hash value of the contract;
judging whether the calculated second hash value is matched with the second original hash value of the contract or not;
determining that the contract has not been tampered with, comprising:
and when the second hash value obtained by calculation is judged to be matched with the second original hash value, determining that the contract is not tampered.
The fact that the contract is not tampered may mean that the second hash value of the contract is the same as the second original hash value, or that a difference value between the second hash value of the contract and the second original hash value belongs to a certain range, or of course, other manners may also be used, and the details are not limited herein.
In an embodiment of the present invention, a device 20 for verifying an evidence is further provided, including:
a calculating unit 200, configured to calculate a first hash value of an evidence to be verified related to a contract;
a matching unit 210, configured to obtain a first original hash value of the evidence to be verified from the contract, and match the calculated first hash value with the first original hash value;
a determining unit 220, configured to determine that the evidence to be verified has not been tampered when the calculated first hash value is successfully matched with the first original hash value.
In the embodiment of the present invention, the matching unit 210 describes that the first original hash value is to be obtained from the contract, and then the apparatus 20 further includes an adding unit 230, configured to add the first original hash value to the contract.
In embodiments of the present invention, optionally, the adding of the first raw hash value to the contract may occur before the contract is signed.
In this embodiment of the present invention, there are various ways for the adding unit 230 to add the first original hash value to the contract, and optionally, the following ways may be adopted:
adding the first raw hash value to the contract in the form of an attachment by a file editing function.
It should be noted that there may be multiple formats of the contract, and optionally, the format may be PDF, or word format, or excel format, which is not specifically limited herein.
When the contract is in PDF format, the first original hash value is added to the contract in the form of an attachment by the file editing function, the following manner may be adopted:
and adding the first original hash value into the contract in the form of an attachment through a file editing function based on PDF rules.
Similarly, when the contract is in word format, the first original hash value is added to the contract in the form of an attachment by the file editing function, the following manner may be adopted:
adding the first original hash value to the contract in the form of an attachment through a file editing function based on word rules;
when the contract is in excel format, the first original hash value is added to the contract in the form of an attachment by the file editing function, the following way can be adopted:
and adding the first original hash value into the contract in the form of an attachment through a file editing function based on an excel rule.
Of course, for documents of other formats, the manner of addition is similar to that described above and will not be described in detail here.
It should be noted that, the first original hash value is added to the contract in the form of an attachment, but may also be added to the contract in the form of a text or in other ways, and is not limited herein. Of course, this description applies to documents of different formats.
In the embodiment of the invention, the related knowledge of the hash algorithm is simply introduced.
The principle of the hash algorithm is to calculate the remainder according to the number of hash value servers of the data frame, and in this way, it is determined to which hash value server the content in the data frame is to be sent. In fact, it can be said that the relationship between sets corresponding to each other is equivalent to the process of mapping one data frame in one set to the corresponding data frame in another set.
The working principle of the hash table is to convert a data frame into a number form according to a certain set algorithm, for example, a hash algorithm, perform remainder calculation on the array length by the numbers, take the remainder, use the result as the next mark of the array, store the numerical value, and store the numerical value in the array space under the numerical index. If a query command is issued with respect to the hash table, the hash function may be used to convert the data frame into a corresponding array under its token, thereby obtaining the corresponding hash value from within the space.
The hash algorithms adopted in the embodiment of the present invention are various, and optionally, the following several kinds of hash algorithms may be adopted, for example, the MD4 algorithm, the MD5 algorithm, or the SHA 1 algorithm may also be adopted, and of course, other hash algorithms may also be adopted, which is not specifically limited herein.
In this embodiment of the present invention, optionally, the to-be-verified evidence is in a format of at least one of a document, a picture, audio, and a video.
Of course, the above are just a few examples of the format of the evidence to be verified, and the invention is not limited to this in practical applications.
It should be noted that, in the embodiment of the present invention, that the first hash value obtained by calculation is successfully matched with the first original hash value may mean that the first hash value is completely consistent with the first original hash value, and of course, in a special case, the first hash value and the first original hash value may also mean that the first hash value and the first original hash value are successfully matched when an error between the two is within a certain range.
In the embodiment of the present invention, it may be determined whether the contract is tampered, and then the first hash value of the evidence and the first original hash value are matched under the condition that the contract is not tampered, that is, the matching unit 210 matches the calculated first hash value and the first original hash value, where the method includes:
judging whether the contract is tampered or not;
and when the contract is judged not to be tampered, matching the calculated first hash value with the first original hash value.
Wherein the determining, by the matching unit 210, whether the contract is tampered includes:
calculating a second hash value of the contract;
judging whether the calculated second hash value is matched with the second original hash value of the contract or not;
the matching unit 210 determines that the contract has not been tampered with, including:
and when the second hash value obtained by calculation is judged to be matched with the second original hash value, determining that the contract is not tampered.
The fact that the contract is not tampered may mean that the second hash value of the contract is the same as the second original hash value, or that a difference value between the second hash value of the contract and the second original hash value belongs to a certain range, or of course, other manners may also be used, and the details are not limited herein.
Exemplary device
Having described the method and apparatus of an exemplary embodiment of the present invention, an apparatus for verifying evidence according to another exemplary embodiment of the present invention is next described.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or program product. Thus, various aspects of the invention may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
In some possible embodiments, the apparatus for verifying evidence according to the present invention may comprise at least one processing unit, and at least one memory unit. Wherein the storage unit stores program code which, when executed by the processing unit, causes the processing unit to perform the steps of the method for verifying evidence according to various exemplary embodiments of the present invention described in the above section "exemplary method" of the present specification. For example, the processing unit may perform step 100 as shown in fig. 1: calculating a first hash value of the evidence to be verified related to the contract; step 110: acquiring a first original hash value of the evidence to be verified from the contract, and matching the calculated first hash value with the first original hash value; step 120: and when the first hash value obtained by calculation is successfully matched with the first original hash value, determining that the evidence to be verified is not tampered.
An apparatus 30 for verifying evidence according to this embodiment of the present invention is described below with reference to fig. 3. The apparatus 30 for verifying evidence shown in fig. 3 is only an example and should not bring any limitation to the function and the scope of use of the embodiment of the present invention.
As shown in fig. 3, the means for verifying evidence 30 is in the form of a general purpose computing device. The components of the apparatus for verifying evidence 30 may include, but are not limited to: the at least one processing unit 16, the at least one memory unit 28, and the bus 18 that connects the various system components (including the memory unit 28 and the processing unit 16).
Bus 18 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.
The storage unit 28 may include readable media in the form of volatile memory, such as Random Access Memory (RAM)31 and/or cache memory 32, and may further include Read Only Memory (ROM) 34.
Storage unit 28 may also include a program/utility 41 having a set (at least one) of program modules 42, such program modules 42 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
The apparatus for validating evidence 30 may also communicate with one or more external devices 14 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the apparatus for validating evidence 30, and/or with any devices (e.g., router, modem, etc.) that enable the apparatus for validating evidence 30 to communicate with one or more other computing devices. Such communication may be through an input/output (I/O) interface 22. Also, the apparatus for verifying evidence 30 may also communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) through the network adapter 21. As shown, the network adapter 21 communicates with the other modules of the apparatus for validating evidence 30 over the bus 18. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the apparatus for verifying evidence 30, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Exemplary program product
In some possible embodiments, aspects of the invention may also be implemented in the form of a program product comprising program code for causing a device to perform the steps of the method for verifying evidence according to various exemplary embodiments of the invention described in the above section "exemplary method" of this specification, when the program product is run on the device, e.g. the device may perform the steps 100 as shown in fig. 1: calculating a first hash value of the evidence to be verified related to the contract; step 110: acquiring a first original hash value of the evidence to be verified from the contract, and matching the calculated first hash value with the first original hash value; step 120: and when the first hash value obtained by calculation is successfully matched with the first original hash value, determining that the evidence to be verified is not tampered.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
As shown in fig. 4, a program product 40 for verifying evidence according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited in this regard and, in the present document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device over any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., over the internet using an internet service provider).
It should be noted that although in the above detailed description several means or sub-means of the device for verifying evidence are mentioned, this division is only not mandatory. Indeed, the features and functions of two or more of the devices described above may be embodied in one device, according to embodiments of the invention. Conversely, the features and functions of one apparatus described above may be further divided into embodiments by a plurality of apparatuses.
Moreover, while the operations of the method of the invention are depicted in the drawings in a particular order, this does not require or imply that the operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
While the spirit and principles of the invention have been described with reference to several particular embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, nor is the division of aspects, which is for convenience only as the features in such aspects may not be combined to benefit. The invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims (2)

1. A method of validating evidence, comprising:
calculating a first hash value of the evidence to be verified related to the contract;
acquiring a first original hash value of the evidence to be verified from the contract, and matching the calculated first hash value with the first original hash value;
when the first hash value obtained by calculation is successfully matched with the first original hash value, determining that the evidence to be verified is not tampered;
matching the calculated first hash value with the first original hash value, including: judging whether the contract is tampered or not; when the contract is judged not to be tampered, matching the calculated first hash value with the first original hash value;
judging whether the contract is tampered or not, comprising: calculating a second hash value of the contract; judging whether the calculated second hash value is matched with the second original hash value of the contract or not; determining that the contract has not been tampered with, comprising: when the second hash value obtained by calculation is judged to be matched with the second original hash value, determining that the contract is not tampered;
before matching the calculated first hash value with the first original hash value, the method includes:
adding the first raw hash value to the contract;
adding the first raw hash value to the contract, including:
adding the first original hash value to the contract in the form of an attachment by a file editing function;
the contract stores not the evidence to be verified per se but hash values related to the evidence;
the format of the evidence to be verified is at least one of a document, a picture, audio and video.
2. An apparatus for verifying evidence, comprising:
the calculating unit is used for calculating a first hash value of the evidence to be verified related to the contract;
the matching unit is used for acquiring a first original hash value of the evidence to be verified from the contract and matching the calculated first hash value with the first original hash value;
the determining unit is used for determining that the evidence to be verified is not tampered when the first hash value obtained through calculation is successfully matched with the first original hash value;
the matching unit matches the calculated first hash value with the first original hash value, and includes: judging whether the contract is tampered or not; when the contract is judged not to be tampered, matching the calculated first hash value with the first original hash value;
the matching unit judges whether the contract is tampered, and comprises the following steps: calculating a second hash value of the contract; judging whether the calculated second hash value is matched with the second original hash value of the contract or not;
the matching unit determines that the contract has not been tampered with, including: when the second hash value obtained by calculation is judged to be matched with the second original hash value, determining that the contract is not tampered;
the adding unit is used for adding the first original hash value into the contract;
the adding unit adds the first original hash value to the contract, including:
adding the first original hash value to the contract in the form of an attachment by a file editing function;
the contract stores not the evidence to be verified per se but hash values related to the evidence;
the format of the evidence to be verified is at least one of a document, a picture, audio and video.
CN201810634929.8A 2018-06-15 2018-06-15 Evidence verification method and device Active CN108921552B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810634929.8A CN108921552B (en) 2018-06-15 2018-06-15 Evidence verification method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810634929.8A CN108921552B (en) 2018-06-15 2018-06-15 Evidence verification method and device

Publications (2)

Publication Number Publication Date
CN108921552A CN108921552A (en) 2018-11-30
CN108921552B true CN108921552B (en) 2021-08-27

Family

ID=64421480

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810634929.8A Active CN108921552B (en) 2018-06-15 2018-06-15 Evidence verification method and device

Country Status (1)

Country Link
CN (1) CN108921552B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109756485B (en) * 2018-12-14 2022-11-18 平安科技(深圳)有限公司 Electronic contract signing method, electronic contract signing device, computer equipment and storage medium
CN110084072A (en) * 2019-04-30 2019-08-02 北京智签科技有限公司 A kind of electronic contract online verification method based on block chain network
CN110516206A (en) * 2019-07-23 2019-11-29 平安科技(深圳)有限公司 File comparison method, device, computer equipment and storage medium
CN110490599A (en) * 2019-08-23 2019-11-22 深圳前海微众银行股份有限公司 Verification method, system, device, equipment and the readable storage medium storing program for executing of evidence
CN111934851A (en) * 2020-07-26 2020-11-13 中国人民解放军93209部队 Flight plan verification method and device based on Hash algorithm
CN113378234B (en) * 2021-05-27 2023-04-07 浙江贝才之神网络科技有限公司 Data tampering detection method, system, computer device and storage medium
CN113343313A (en) * 2021-06-30 2021-09-03 中金金融认证中心有限公司 Verification report validity identification method, legal service system and readable storage medium

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103514410B (en) * 2013-09-30 2017-01-18 上海市数字证书认证中心有限公司 Dependable preservation and evidence collection system and method for electronic contract
CN104166936B (en) * 2014-08-14 2018-08-10 江苏买卖网电子商务有限公司 A kind of storage of electronic contract and verification method
CN105893861A (en) * 2014-09-28 2016-08-24 伊姆西公司 Method and system for generating two-dimensional codes
CN107316182A (en) * 2017-06-30 2017-11-03 福建亿榕信息技术有限公司 A kind of generation method of electronic contract chain of evidence and generation system

Also Published As

Publication number Publication date
CN108921552A (en) 2018-11-30

Similar Documents

Publication Publication Date Title
CN108921552B (en) Evidence verification method and device
CN111090628B (en) Data processing method and device, storage medium and electronic equipment
WO2021196935A1 (en) Data checking method and apparatus, electronic device, and storage medium
CA2852948C (en) System and method for optimizing the loading of data submissions
US11496291B2 (en) Validating received sensor data using computer cryptographic processing
US20160371244A1 (en) Collaboratively reconstituting tables
CN112966304B (en) Tamper-proof method and device for flow document, computer equipment and medium
US20220083507A1 (en) Trust chain for official data and documents
US11461411B2 (en) System and method for parsing visual information to extract data elements from randomly formatted digital documents
WO2019071907A1 (en) Method for identifying help information based on operation page, and application server
CN110765069B (en) Data migration method, device and system
CN107729944A (en) A kind of recognition methods, device, server and the storage medium of vulgar picture
US20200184109A1 (en) Certified information verification services
US20240028608A1 (en) Schema validation with support for ordering
CN117133006A (en) Document verification method and device, computer equipment and storage medium
CN107992457B (en) Information conversion method, device, terminal equipment and storage medium
US11681865B2 (en) Annotating a log based on log documentation
US11687574B2 (en) Record matching in a database system
CN116028917A (en) Authority detection method and device, storage medium and electronic equipment
CN113741864B (en) Automatic semantic service interface design method and system based on natural language processing
CN114444441A (en) Name similarity calculation method and device, storage medium and calculation equipment
CN115545753A (en) Partner prediction method based on Bayesian algorithm and related equipment
WO2019019456A1 (en) Claim settlement data processing method and apparatus, computer device and storage medium
CN109635228B (en) Method, device, equipment and storage medium for determining difference degree between ordered arrays
CN112926314A (en) Document repeatability identification method and device, 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
GR01 Patent grant
GR01 Patent grant