CN109934015B - Block data message-adding method, block chain node and storage medium - Google Patents
Block data message-adding method, block chain node and storage medium Download PDFInfo
- Publication number
- CN109934015B CN109934015B CN201910122566.4A CN201910122566A CN109934015B CN 109934015 B CN109934015 B CN 109934015B CN 201910122566 A CN201910122566 A CN 201910122566A CN 109934015 B CN109934015 B CN 109934015B
- Authority
- CN
- China
- Prior art keywords
- data
- block
- hash value
- hash
- algorithm
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Storage Device Security (AREA)
Abstract
The invention provides a block data credit increasing method, a block chain node and a computer storage readable storage medium. The block data trust increasing method comprises the following steps: acquiring target data, certificate storing data of the target data and a first Hash value of the certificate storing data; performing Hash operation on the evidence storing data by using a first Hash algorithm to obtain a second Hash value, wherein the first Hash algorithm is a special Hash algorithm for the evidence storing data; if the second Hash value is the same as the first Hash value, the target data, the evidence storing data and the first Hash value are used as the same data record; and generating the blocks of the block chain according to the data records.
Description
Technical Field
The present invention relates to the field of information technology, and in particular, to a method for increasing a local data credit, a block chain node, and a storage medium.
Background
The block chain is formed by linking a plurality of blocks according to a certain sequence. Various data are written in the block chain, the data are stored on the block chain, and the block chain is stored by adopting a distributed block chain network, so that the data of the block chain can hardly be tampered; however, if the authenticity or reliability of the data itself written into the blockchain is not good, the reliability of the blockchain is reduced and the blockchain resources are wasted.
Disclosure of Invention
The invention provides a region data message-increasing method, a block chain node and a storage medium.
A block data trust increasing method comprises the following steps:
acquiring target data, certificate storing data of the target data and a first Hash value of the certificate storing data;
performing Hash operation on the evidence storing data by using a first Hash algorithm to obtain a second Hash value, wherein the first Hash algorithm is a special Hash algorithm for the evidence storing data;
if the second Hash value is the same as the first Hash value, constructing a data record by using the target data, the certificate storing data and the first Hash value;
and generating the blocks of the block chain according to the data records.
Based on the above scheme, the method further comprises:
performing Hash operation on all the evidence storing data stored in the same block by using the first Hash algorithm to obtain a third Hash value;
and writing the third Hash value into a corresponding block.
Based on the above scheme, the generating a block of a block chain according to the data record includes:
writing the data record into the data set of the block;
the writing the third Hash value into the corresponding block includes:
and writing the third Hash value into the metadata of the corresponding block.
Based on the above scheme, the method further comprises:
after the verification node receives the block, performing Hash operation on all the verification data in the block by using the first Hash algorithm to obtain a fourth Hash value;
and if the fourth Hash value is different from the third Hash value, the block is not verified, wherein the block which is not verified refuses to be linked into the block chain.
Based on the above scheme, the method further comprises:
if the fourth Hash value is the same as the third Hash value, determining that the block passes the verification through a voting mechanism; and the verified block is used for being linked into the block chain.
Based on the above scheme, the metadata further includes: a timestamp of the block.
Based on the above scheme, the evidence storage data comprises: performing Hash operation on the target data by using a second Hash algorithm to obtain a fifth Hash value; wherein the second Hash algorithm is different from the first Hash algorithm.
Based on the above scheme, the method further comprises:
and if the second Hash value is different from the first Hash value, refusing to write the data record into a block.
A block link point, comprising:
a network interface;
a memory;
and the processor is respectively connected with the network interface and the memory and is used for controlling the communication of the network interface and the information storage of the memory through the execution of a computer program and realizing the block data trust increasing method provided by at least one technical scheme.
A computer-readable storage medium storing a computer program; after being executed by a processor, the computer program can implement the block data trust increasing method provided by at least one technical scheme.
According to the technical scheme provided by the invention, a first Hash value obtained by Hash operation on the evidence storing data is received, then before a block is generated, the Hash operation is carried out on the received evidence storing data by using a first Hash algorithm to obtain a second Hash value, and then the target data, the evidence storing data and the first Hash value are written into the block as a data record when the first Hash value and the second Hash value are the same; at least reducing the phenomenon of counterfeit of the stored data and low reliability of the data in the written block caused by tampering in the transmission process, and improving the reliability of the data written in the block chain.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments made with reference to the following drawings:
fig. 1 is a schematic flow chart illustrating a block data trust increasing method according to an embodiment of the present invention;
fig. 2 is a schematic flow chart illustrating another block data trust increasing method according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a block data trust enhancing apparatus according to an embodiment of the present invention;
fig. 4 is a flowchart illustrating a block data trust increasing method according to another embodiment of the present invention;
fig. 5 is a block diagram according to an embodiment of the invention.
Fig. 6 is a schematic diagram of a certificate store according to an embodiment of the present invention.
Detailed Description
The present invention is described in further detail below with reference to the attached drawing figures.
The invention provides a block chain node which can realize the block data increase method. The blockchain node may include one or more processors (e.g., Central Processing Units (CPUs)), input/output interfaces, network interfaces, and memory.
The Memory may include volatile Memory in a computer-readable medium, Random Access Memory (RAM), and/or nonvolatile Memory such as Read-Only Memory (ROM) or flash Memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, Phase Change RAM (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), flash Memory or other Memory technology, Compact Disc Read-Only Memory (CD-ROM), Digital Versatile Disc (DVD) or other optical storage, magnetic cassettes, tape disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include non-transitory computer readable media (transient media), such as modulated data signals and carrier waves.
As shown in fig. 1, the present embodiment provides a block data trust enhancing method, including:
step S101: acquiring target data, certificate storing data of the target data and a first Hash value of the certificate storing data;
step S102: performing Hash operation on the evidence storing data by using a first Hash algorithm to obtain a second Hash value, wherein the first Hash algorithm is a special Hash algorithm for the evidence storing data;
step S103: if the second Hash value is the same as the first Hash value, constructing a data record by using the target data, the certificate storing data and the first Hash value;
step S104: and generating the blocks of the block chain according to the data records.
The method provided by the embodiment can be applied to the accounting node of the block chain network. The accounting node may receive the target data broadcast in the blockchain network and the evidence data of the target data. In this embodiment, receiving the target data and the evidence data together further includes: the Hash value of the data to be certified, in this embodiment, is referred to as the first Hash value in order to distinguish the different Hash values.
The target data can be various data which need to be written into the block chain and stored by utilizing the distributed storage technology of the block chain. Such as transaction data for various digital currencies, ownership transfer data for various networked products, and the like.
In some embodiments, the credentialing data may be data indicating that the corresponding application is a creditor of the target data. In some embodiments, the forensic data may include: the target data provides user information of the user. In still other embodiments, the evidence data may further include: a data attribute of the target data. For example, the data attributes may include: the data type of the target data, or the service corresponding to the target data.
In other embodiments, the evidence data further comprises: a timestamp of the deposit of the certificate.
After the accounting node acquires the target data, the evidence storing data and the first Hash value, the data are not directly used as a data record and written into the block; instead, a special Hash algorithm (referred to as a first Hash algorithm in this embodiment) for storing the authentication data is used to perform a Hash operation, so as to obtain a second Hash value generated by the accounting node. If the authentication data is not tampered, the first Hash value and the second Hash value are the same because the first Hash value and the second Hash value are agreed to adopt the same first Hash algorithm. If the second Hash value is different from the first Hash value, the authenticity and the integrity of the certificate-storing data are damaged, wherein the certificate-storing data are considered to be tampered or modified; meanwhile, if the authenticity and integrity of the evidence data are damaged, the target data received together with the evidence data are possibly tampered and damaged; writing such data into a block results in a reduced reliability of the data written in the block chain. In this embodiment, only when the second Hash value is the same as the first Hash value, the target data, the verification data, and the first Hash value are used as a data record to generate a block forming a block chain, so that the reliability of the data in the block chain is improved.
In some embodiments, as shown in fig. 5, the method further comprises:
step S105: performing Hash operation on all the evidence storing data stored in the same block by using the first Hash algorithm to obtain a third Hash value;
step S106: and writing the third Hash value into a corresponding block.
In this embodiment, a Hash operation is further performed on all the authentication data written into the same block by using the first Hash algorithm to obtain a Hash value, which is referred to as a third Hash value in this embodiment, and the Hash value is a Hash value of all the authentication data in the whole block.
For example, if a block includes S block records, and S pieces of credential data are corresponding to the block records, the third Hash value is: and performing Hash operation on the S pieces of evidence storing data by using a first Hash algorithm to obtain the result.
In this embodiment, the reliability of the whole block can be improved again by generating the third Hash value.
In some embodiments, the S104 may include:
writing the data record into the data set of the block;
the step S106 may include:
and writing the third Hash value into the metadata of the corresponding block.
One block of the block chain comprises: a data block header and a data body; the data block header can be used for linking between different blocks; the data volume includes: data sets and metadata. The data set is mainly used for storing data that needs to be written to the block chain, e.g. the data record. In this embodiment, the data record provided further includes a first Hash value of the authentication data generated by using the dedicated first Hash algorithm.
In this embodiment, the accounting node further generates a third Hash value based on the first Hash algorithm, and the third Hash value is written into the metadata of the block, and the metadata of the block includes data describing the block.
In some embodiments, the metadata of the tile further comprises: a timestamp of the tile, which may be a generation timestamp of the tile.
In still other embodiments, the metadata for the block may further include: generating a node identification of an accounting node of the block; the node identification facilitates tracing for subsequent blocks. If the block is formally linked into the current block chain through the verification of the verification node in the block chain network of the block broadcast, a plurality of accounting nodes in the block chain network can copy the block and store the copy of the block.
In some embodiments, the method further comprises:
after the verification node receives the block, performing Hash operation on all the verification data in the block by using the first Hash algorithm to obtain a fourth Hash value;
and if the fourth Hash value is different from the third Hash value, the block is not verified, wherein the block which is not verified refuses to be linked into the block chain.
In this embodiment, after receiving a block to be verified from the blockchain network, the verification node performs a Hash operation on all the verification data in the block by using a dedicated first Hash algorithm to generate a fourth Hash value, and if the block is not tampered in the broadcasting process of the block, the fourth Hash value should be the same as the third Hash value. If the fourth Hash value is different from the third Hash value, the current block is an abnormal block, and the verification of the block can be determined not to pass, so that the block chain is rejected to enter the block chain. If the fourth Hash value is the same as that in the third Hash, the block can be formally linked into a block chain by a voting mechanism after the verification nodes meeting the predetermined number or the predetermined proportion all pass the verification of the block.
Therefore, in some embodiments, the method further comprises: and the fourth Hash value is the same as the third Hash value, and the block is determined to pass the verification through a voting mechanism, and the block is linked into a block chain.
In some embodiments, the method further comprises:
the evidence storage data comprises: performing Hash operation on the target data by using a second Hash algorithm to obtain a fifth Hash value; wherein the second Hash algorithm is different from the first Hash algorithm.
In this embodiment, a second Hash algorithm is used to perform a Hash operation on the target data to obtain a fifth Hash value, and the fifth Hash value may be used to verify the authenticity and integrity of the target data. And the fifth Hash value is a component forming the evidence storing data.
In this embodiment, the fifth Hash value and the first Hash value are generated by using different Hash algorithms; thus, the evidence data has independent Hash algorithm relative to the target data. Therefore, authenticity and integrity of the deposit certificate data are verified without depending on target data; thus, the reliability of the data record in the writing block is improved again.
As shown in fig. 3, the present example provides a block data trust enhancing apparatus, including:
the obtaining module 101 is configured to obtain target data, credential storage data of the target data, and a first Hash value of the credential storage data;
the first Hash module 102 is configured to perform a Hash operation on the credential data by using a first Hash algorithm to obtain a second Hash value, where the first Hash algorithm is a Hash algorithm dedicated to the credential data;
the constructing module 103 is configured to construct a data record for the target data, the certificate storing data and the first Hash value if the second Hash value is the same as the first Hash value;
a generating module 104, configured to generate a block of a block chain according to the data record.
In some embodiments, the apparatus further comprises:
the second Hash module is used for carrying out Hash operation on all the evidence storing data stored in the same block by utilizing the first Hash algorithm to obtain a third Hash value;
and the first writing module is used for writing the third Hash value into a corresponding block.
In some embodiments, the generating module 104 is specifically configured to write the data record into the data set of the block;
the first writing module is specifically configured to write the third Hash value into metadata of a corresponding block.
In some embodiments, the block link point may further include:
the receiving module is used for carrying out Hash operation on all the evidence storage data in the block by utilizing the first Hash algorithm after the verification node receives the block to obtain a fourth Hash value;
and the verification module is used for determining that the block is not verified if the fourth Hash value is different from the third Hash value, wherein the block which is not verified refuses to be linked into the block chain.
In some embodiments, the verification module is further configured to determine that the block is verified through a voting mechanism if the fourth Hash value and the third Hash value are the same; and the verified block is used for being linked into the block chain.
In some embodiments, the metadata further comprises: a timestamp of the block. The timestamp of the chunk may be a timestamp of the time of generation of the chunk.
In some embodiments, the forensic data comprises: performing Hash operation on the target data by using a second Hash algorithm to obtain a fifth Hash value; wherein the second Hash algorithm is different from the first Hash algorithm.
In some embodiments, the apparatus further comprises:
and the rejection module is used for rejecting to write the data record into a block if the second Hash value is different from the first Hash value.
Several specific examples are provided below in connection with any of the embodiments described above:
example one:
in the example, a special Hash algorithm for data notarization is added in each data block and each piece of evidence storage data on an evidence storage block chain, so that the evidence storage data has the characteristics of data safety and non-falsification of the block chain, and the authenticity of the data is approved by a notarization institution on the aspect of business and law.
The example provides a Hash algorithm for embedding a data notarization into a certificate-storing block chain data block and specific certificate-storing data, so that the data security and the non-falsification characteristic meet the requirement of electronic data notarization specification, and provides audit information to support rapid verification and historical audit on the certificate-storing block chain certificate-storing data; the block chain processing method provided by the present example includes:
storing the certificate data, calculating a Hash value of the certificate data by using a special Hash algorithm and storing the Hash value and the data;
verifying the certificate storing data by adopting a special Hash algorithm;
and forcibly adopting a data notarization special Hash algorithm to carry out Hash calculation on the evidence storage data set contained in the whole block, and attaching the Hash result to the block for storage as an inherent part of the block chain.
When the electronic data (the electronic data is one of the target data) of the certificate is verified, the Hash value of the data block related to the data and the certificate data is compared, and whether the electronic data is complete or not is judged.
This example also provides a data credentialing apparatus, comprising:
and the evidence storage data unit is used for storing information such as a Hash value of evidence storage data of the notarization proprietary Hash algorithm, a timestamp of the evidence storage data and the like.
And the additional verification unit is used for storing information such as the value and the time stamp of the notarization special Hash algorithm.
The Hash value obtained by a proprietary algorithm contained in each piece of evidence storing data is verified, so that the integrity of the data can be quickly confirmed and the data can not be tampered, and the evidence storing data is considered to be in accordance with the electronic data standard of the data notarization.
By checking the Hash value obtained by the proprietary algorithm of the whole block, the integrity and the non-falsification of the data of the whole block can be quickly confirmed, and the data is considered to be in accordance with the electronic data standard of the data notarization.
The electronic data of the stored certificate can quickly confirm whether the electronic data meets the requirements of the electronic data notarization.
And performing Hash calculation on the certificate storage data every time by adopting a data notarization special method, and adding a Hash result to the certificate storage data for simultaneous storage.
Before a block chain generates a new block, each piece of evidence storing data is verified by adopting a data notarization proprietary Hash method.
When a new block of the block chain is stored, firstly, a data notarization proprietary Hash method is adopted to carry out Hash calculation on a storage data set contained in the whole block, and a Hash result is attached to the block for storage.
When the electronic data of the certificate is verified, whether the electronic evidence is complete and not tampered can be judged by comparing the Hash values stored in the blocks of the certificate storing block chain, and whether the electronic evidence meets the requirements of electronic data notarization.
Example 2:
as shown in fig. 4, the present example provides a block data trust increasing method, including:
initiating a data storage certificate application;
based on the deposit certificate application, the deposit certificate data is primarily sorted, and the primary sorting includes but is not limited to: acquiring data needing to be written into the evidence storing data, such as user information such as a user account and the like, data attributes and Hash values of electronic data needing to be written into a block chain and the like;
calculating a Hash value using a dedicated algorithm (corresponding to the aforementioned first Hash algorithm);
appending the Hash value to the credential data;
collecting certificate storing information (namely collecting certificate storing data and a Hash value);
creating a new block of the block chain;
verifying each piece of certificate storing data and the Hash value;
calculating a Hash value of the valid credential data set (i.e. generating a third Hash value of all the credential data by using the first Hash algorithm), which may also be referred to as a block Hash value;
appending the block Hash value to the block;
updating a block chain account book; if the corresponding block is placed in the block chain, the updating of the block certificate book is completed.
Fig. 5 is a schematic diagram of a blockchain book, and in fig. 5, three blocks (also called data blocks) are shown, namely B0, B1 and B2. Each block has its own data block header H. The data block headers of B0, B1, and B2 are H0, H1, and H2, respectively. The data block head of the next block stores the information of the previous block, and the linking between two adjacent blocks is completed, so that a block chain is formed.
Further included in each block is: a data set; the datasets for B0, B1, and B2 are D0, D1, and D2, respectively. And storing written target data, the certificate storage record and the Hash value of the certificate storage record in the data set. Fig. 6 shows the content of a single certificate of presence record, including: certificate storage header information (TH3), certificate storage detailed data (TD3), metadata information of certificate storage T3, a Hash value (MS3) of the proprietary algorithm to certificate storage T3 data, and a timestamp of certificate storage T3. TD3 may include: and one or more of user information such as a user account corresponding to the target data, data attributes of the target data, a Hash value of the target data and the like.
In this example, the forensic data is written in the form of a certified record into the data set in the block.
Further included in each block is: the block metadata, metadata for B0, B1, and B2, are M0, M1, and M2, respectively. The metadata of the block stores information such as a timestamp of the block, and in this example, also stores a block Hash value.
The present embodiment also provides a block link point, including:
a network interface;
a memory;
and a processor, connected to the network interface and the memory, respectively, for controlling communication of the network interface and information storage of the memory through execution of a computer program, and implementing the block data trust method provided in one or more of the foregoing embodiments, for example, one or more of the methods shown in fig. 1, fig. 2, and fig. 4.
The present embodiment also provides a computer-readable storage medium storing a computer program; the computer program, when executed by a processor, can implement the block data trust method provided by one or more of the foregoing embodiments, for example, one or more of the methods shown in fig. 1, fig. 2, and fig. 4. The computer readable storage medium may be a non-transitory storage medium, which may also be referred to as a non-transitory storage medium, and typical non-transitory storage media include, but are not limited to, flash memory.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
It should be noted that the present invention may be implemented in software and/or in a combination of software and hardware, for example, as an Application Specific Integrated Circuit (ASIC), a general purpose computer or any other similar hardware device. In one embodiment, the software program of the present invention may be executed by a processor to implement the steps or functions described above. Also, the software programs (including associated data structures) of the present invention can be stored in a computer readable recording medium, such as RAM memory, magnetic or optical drive or diskette and the like. Further, some of the steps or functions of the present invention may be implemented in hardware, for example, as circuitry that cooperates with the processor to perform various steps or functions.
In addition, some of the present invention can be applied as a computer program product, such as computer program instructions, which when executed by a computer, can invoke or provide the method and/or technical solution according to the present invention through the operation of the computer. Program instructions which invoke the methods of the present invention may be stored on a fixed or removable recording medium and/or transmitted via a data stream on a broadcast or other signal-bearing medium and/or stored within a working memory of a computer device operating in accordance with the program instructions. An embodiment according to the invention herein comprises an apparatus comprising a memory for storing computer program instructions and a processor for executing the program instructions, wherein the computer program instructions, when executed by the processor, trigger the apparatus to perform a method and/or solution according to embodiments of the invention as described above.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned. Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the apparatus claims may also be implemented by one unit or means in software or hardware. The terms first, second, etc. are used to denote names, but not any particular order.
Claims (6)
1. A block data trust increasing method is characterized by comprising the following steps:
acquiring target data, certificate storing data of the target data and a first Hash value of the certificate storing data;
performing Hash operation on the evidence storing data by using a first Hash algorithm to obtain a second Hash value, wherein the first Hash algorithm is a special Hash algorithm for the evidence storing data;
if the second Hash value is the same as the first Hash value, constructing a data record by using the target data, the certificate storing data and the first Hash value;
performing Hash operation on all the evidence storing data stored in the same block by using the first Hash algorithm to obtain a third Hash value;
generating a block of a block chain according to the data record; writing the data record into the data set of the block; writing the third Hash value into metadata of a corresponding block;
after the verification node receives the block, performing Hash operation on all the verification data in the block by using the first Hash algorithm to obtain a fourth Hash value;
if the fourth Hash value is different from the third Hash value, the block is not verified, wherein the block which is not verified refuses to be linked into a block chain;
if the fourth Hash value is the same as the third Hash value, determining that the blocks which meet the verification that the verification nodes with the preset number or the preset proportion pass the verification through a voting mechanism; and the verified block is used for being linked into the block chain.
2. The method of claim 1, wherein the metadata further comprises: a timestamp of the block.
3. The method of claim 1,
the evidence storage data comprises: performing Hash operation on the target data by using a second Hash algorithm to obtain a fifth Hash value; wherein the second Hash algorithm is different from the first Hash algorithm.
4. The method of claim 1, further comprising:
and if the second Hash value is different from the first Hash value, refusing to write the data record into a block.
5. A block link point, comprising:
a network interface;
a memory;
a processor, connected to the network interface and the memory respectively, for controlling the communication of the network interface and the information storage of the memory through the execution of a computer program, and implementing the method provided by any one of claims 1 to 4.
6. A computer-readable storage medium storing a computer program; the computer program, when executed by a processor, is capable of implementing the method as claimed in any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910122566.4A CN109934015B (en) | 2019-02-19 | 2019-02-19 | Block data message-adding method, block chain node and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910122566.4A CN109934015B (en) | 2019-02-19 | 2019-02-19 | Block data message-adding method, block chain node and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109934015A CN109934015A (en) | 2019-06-25 |
| CN109934015B true CN109934015B (en) | 2021-04-09 |
Family
ID=66985713
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910122566.4A Active CN109934015B (en) | 2019-02-19 | 2019-02-19 | Block data message-adding method, block chain node and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109934015B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110457952A (en) * | 2019-07-04 | 2019-11-15 | 阿里巴巴集团控股有限公司 | A kind of monitoring and managing method of data record, device and equipment |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101145913B (en) * | 2007-10-25 | 2010-06-16 | 东软集团股份有限公司 | A method and system for network security communication |
| CN105610578B (en) * | 2016-01-25 | 2019-05-03 | 杭州复杂美科技有限公司 | Block chain information deposits card and method for secret protection |
| US9960920B2 (en) * | 2016-01-26 | 2018-05-01 | Stampery Inc. | Systems and methods for certification of data units and/or certification verification |
| CN106708438A (en) * | 2016-12-16 | 2017-05-24 | 盛科网络（苏州）有限公司 | Method and device for lowering Hash conflict probability |
| CN107944868A (en) * | 2017-12-07 | 2018-04-20 | 杭州趣链科技有限公司 | A kind of electronics deposit system and management method based on block chain intelligence contract |
| CN108629038A (en) * | 2018-05-11 | 2018-10-09 | 北京奇虎科技有限公司 | Webpage based on block chain deposits card method and system |
| CN108664770B (en) * | 2018-05-22 | 2022-02-08 | 上海七印信息科技有限公司 | High-reliability existence proving method based on block chain technology |
-
2019
- 2019-02-19 CN CN201910122566.4A patent/CN109934015B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109934015A (en) | 2019-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109559224B (en) | Credit investigation evaluation method and device and electronic equipment | |
| WO2018176966A1 (en) | Method and apparatus for processing financial data based on blockchain, and electronic device | |
| WO2020029631A1 (en) | Transaction method and system based on centralized settlement and blockchain deposit certificates | |
| CN108881165B (en) | Multi-center authentication system with block issuing mechanism | |
| WO2020029629A1 (en) | Transaction method and system based on centralized settlement and block chain storage | |
| US20210049715A1 (en) | Blockchain-based data procesing method, apparatus, and electronic device | |
| CN110189122B (en) | Method and device for anchoring time for data on block chain and electronic equipment | |
| US20200211024A1 (en) | Blockchain-based recordkeeping method and apparatus | |
| CN111353180A (en) | Block chain evidence storing method, evidence obtaining method and system | |
| US11663595B1 (en) | Blockchain transactional identity verification | |
| CN106650495A (en) | File verification method and device | |
| CN114553515B (en) | Block chain-based NFT asset checking method, business processing method and hardware | |
| CN110851538A (en) | Block chain-based content generation method, device, equipment and storage medium | |
| JPWO2019038839A1 (en) | Blockchain management device, blockchain management method and program | |
| US20200193430A1 (en) | Determining generation time for blockchain data | |
| US11570005B2 (en) | Systems and methods for proving immutability of blockchains | |
| CN107609874B (en) | Transaction log data verification method and verification system | |
| CN113343313A (en) | Verification report validity identification method, legal service system and readable storage medium | |
| CN109934015B (en) | Block data message-adding method, block chain node and storage medium | |
| US20190286841A1 (en) | Detecting alterations of journal data structures | |
| CN110059087B (en) | Data attribute identification method, device and equipment in block chain type account book | |
| CN111367776A (en) | Recording method, device, equipment and storage medium of resource transfer service | |
| CN111242649A (en) | Enterprise qualification detection method and device based on block chain and storage medium | |
| CN110390183A (en) | Digital publishing rights transaction deposit system based on block chain | |
| CN108519985B (en) | Bidirectional block chain, data processing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |