WO2019237275A1 - Système de vérification d'authenticité basé sur une technologie de chaîne de blocs - Google Patents

Système de vérification d'authenticité basé sur une technologie de chaîne de blocs Download PDF

Info

Publication number
WO2019237275A1
WO2019237275A1 PCT/CN2018/091019 CN2018091019W WO2019237275A1 WO 2019237275 A1 WO2019237275 A1 WO 2019237275A1 CN 2018091019 W CN2018091019 W CN 2018091019W WO 2019237275 A1 WO2019237275 A1 WO 2019237275A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
group
data
file
recorded
Prior art date
Application number
PCT/CN2018/091019
Other languages
English (en)
Chinese (zh)
Inventor
汪华东
Original Assignee
汪华东
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 汪华东 filed Critical 汪华东
Priority to PCT/CN2018/091019 priority Critical patent/WO2019237275A1/fr
Publication of WO2019237275A1 publication Critical patent/WO2019237275A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14—Error detection or correction of the data by redundancy in operation

Definitions

  • the present invention relates to a blockchain system, and more particularly to a authenticity verification system based on the blockchain technology.
  • the blockchain is a chain data structure that combines data blocks (also called technical files called data pages) in a chronological order, and uses a password.
  • a distributed ledger that is guaranteed to be untamperable and unforgeable by the academic method.
  • blockchain technology uses blockchain data structures to verify and store data, uses distributed node consensus algorithms to generate and update data, uses cryptography to ensure the security of data transmission and access, and uses automated scripting.
  • a new type of distributed infrastructure and computing method for smart contracts composed of code to program and manipulate data. That is, the so-called blockchain contains two different concepts of "block” and "chain”.
  • a plurality of nodes including a blockchain are established in a unified environment platform to form a blockchain operating system, which has excellent tamper-resistant functions.
  • Hash (hash function): Hash, generally translated as “hash”, but also directly transliterated as “hash”, that is, any length of input (also known as pre-image), through the hash algorithm, transform Into a fixed-length output, which is the hash value.
  • This conversion is a compression map, that is, the space of the hash value is usually much smaller than the space of the input. Different inputs may be hashed into the same output, so it is impossible to determine the unique input value from the hash value. But the same input will necessarily get the same output. Simply put, it is a function that compresses messages of any length to a fixed-length message digest.
  • Block The so-called block is used to receive broadcast data. All nodes record at the same time, and then after a certain period of time, the node device that has obtained the accounting right performs a seal and broadcasts the value used for the seal to other nodes. If all nodes successfully seal the block by using the value for sealing, the block has the authenticity recognized by the entire system. For example, the current Bitcoin blockchain system performs block seals every ten minutes.
  • Each node performs a large number of HASH operations on the block to be sealed at the same time.
  • the first node that calculates the value of the block that can be sealed has the accounting right, it broadcasts the value to other nodes for verification.
  • mining The so-called mining is that each node obtains accounting rights through a large number of operations.
  • the computer used for mining is called a mining machine. Because the mining process consumes a lot of electricity, manpower, and computing power, mining is a very huge carbon emission process and is very unfriendly to the environment. And for the same block, only the first mining machine that has completed mining can obtain the right to account, and in the process, all kinds of energy consumed by other nodes are wasteful resources.
  • Digital currency A virtual currency based on the above-mentioned blockchain technology. At the beginning of the introduction of blockchain technology, in order to encourage each node to mine, the first node that successfully obtained the right to keep accounts is rewarded. Rewards are generated out of thin air without value attributes, such as Bitcoin in the prior art. But digital currency is recorded by computer language at every node in the blockchain system, and has technical attributes.
  • the anti-tampering function described in the blockchain is based on the fact that the block cannot be modified after it is sealed.
  • other nodes cannot use the value used for the seal in combination with the data of the block. Hash operations that conform to the rules.
  • the tampering node can only abandon changing the block, and copy the block that most nodes consider legitimate from other nodes.
  • the computer can only judge the legality of the input record based on the blockchain's method of judging whether the record is correct or not, and cannot combine the actual work with whether the input record conforms to the actual production record.
  • a node when an enterprise uses the blockchain for private chain operation, a node writes a record that is recognized by other nodes: reduce the number of goods N from point A, and then increase the number of goods N at point B.
  • This record computer will consider it legal, so each node makes the same record, and then goes through mining and sealing, so that a record is always recorded in a block and cannot be modified. Then in actual work, it is not as good as financial data recording. There is no loss between the two points. If the company's goods have a loss of M after the goods are shipped from point A, it should be correct to increase the number of goods NM at point B. data record. As a result, when a certain block was written in the past, an erroneous record has been written. However, the wrong record is considered legal by the computer, and the company's running account book will continue the error and expand avalanche effect. This makes it difficult for enterprises to use small blockchain systems for accounting applications.
  • the present invention aims to provide a self-healing, authenticity verification system based on blockchain technology that can be directly used in commercial applications.
  • An authenticity verification system based on the blockchain technology includes: a plurality of blocks continuously connected in the form of a blockchain starting from an initial block, a buffer block, and a verification file;
  • the plurality of consecutive blocks include at least a continuous group-first block, a group-second block, a group-third block, and a group-first block, and a group-second block.
  • Group 2 composed of two blocks, group two and third blocks, the sequence number of group one is higher than the sequence number of group two, and the blocks in group one and the blocks in group two do not overlap, that is, the condition n1 + 3 is satisfied ⁇ n2;
  • the verification file verifies that the second block of group one contains erroneous data
  • the data of the second block of group one is copied to the buffer block and the erroneous data is simultaneously corrected and overwritten to the buffer during the copying process Block; record the jump pointer of the chain check in the first block of group two and copy the data of the buffer block to the second block of group two after the seal of the first block of group two is completed, and verify the file at the same time
  • a new mapping relationship is generated with the second block of group two
  • the third block of group two records the hash value of the second block of group two, and then continues to record the data that was originally to be connected to the first block of group two.
  • the authenticity verification system based on the blockchain technology described in the present invention has the advantage that the blockchain technology that originally does not have the correction function can obtain the self-repairing function, and all the data can also obtain other It is necessary to point out that the legitimacy of the node is that the most superior part of the blockchain is that the data of the block cannot be tampered with.
  • the biggest advantage of the present invention is that it does not modify the past block, but it will have The block of wrong data is corrected and recorded, that is, the original wrong data is still retained on its corresponding block. Looking at the system as a whole, no data has been tampered with.
  • the authenticity verification system with correction function can be directly applied to micro-private chains, especially suitable for the development and application of blockchain technology by small and medium-sized enterprises, and has great commercial value.
  • the hash value of the verification file is recorded in the first block of group two.
  • the tampering and traceability of the verification file can be legally recognized by the entire system.
  • the jump pointer is: when performing chain check, jump from group two first block, group one first block, group two second block, and group one third block in sequence, Then, when the third block from group one returns to the first block of group two in the original chain check sequence, it jumps directly to the third block of group two.
  • the original straight-chain structure can be improved.
  • the continuous line of data recording is still carried out in a straight-chain structure, but the backtracking of the data is carried out in a round-chain structure.
  • the actual record structure of the data is not changed. In the case, the correction function is implemented.
  • the blocks from the initial block to the first block of the group one are sealed with blank records, and the initial data are recorded starting from the second block of the group one. It can be known from the above description that the system according to the present invention can only repair erroneous data of non-initial blocks. Therefore, for the repairability of the entire chain of data, the initial blocks are replaced with blank records.
  • the group-first block is an initial block, and the initial data is recorded starting from the group-second block. Can reduce the number of blank blocks and reduce computing pressure.
  • the jump pointer recorded in the first block of group two is broadcast to all other nodes in the same system, and all other nodes are in the first block of group two. Record the jump pointer synchronously. The integrity of the entire system can be guaranteed, and all data can meet the consensus algorithm of the distributed nodes.
  • the verification file is an audio file or a video file
  • the video file records a change process of data contained in the corresponding block.
  • FIG. 1 is a schematic diagram of the self-healing working principle of the authenticity verification system based on the blockchain technology according to the present invention
  • FIG. 2 is a schematic diagram of the data chain type inspection working principle of the authenticity verification system based on the blockchain technology according to the present invention.
  • a block chain technology-based authenticity verification system includes: a plurality of blocks continuously connected in a block chain form from an initial block a0, and a buffer block a ', and a verification file V; wherein the plurality of consecutive blocks include at least a continuous group of a first block an1, a group of a second block an1 + 1, and a group of a third block an1 + 2 Group one of group 1, and group two consisting of group two first block an2, group two second block an2 + 1, group two third block an2 + 2, the sequence number n1 of group one is greater than group two
  • the serial number n2 is in the front, and the blocks in group 1 and the blocks in group 2 do not overlap, that is, the condition n1 + 3 ⁇ n2 is satisfied; the mapping relationship between the verification file V and the second block an1 + 1 of the group is used for calibration Check the authenticity of the second block an1 + 1 of the group;
  • the verification file V verifies that the group one second block an1 + 1 contains erroneous data
  • the data of the group one second block an1 + 1 is copied to the buffer block a 'and the data is copied during the copying process.
  • the erroneous data is corrected at the same time and covers the buffer block a '; the jump pointer of the chain check is recorded in the first block an2 of group two, and the buffer block a' is
  • the data is copied to the second block an2 + 1 of group two, and a new mapping relationship is generated between the verification file V and the second block an2 + 1 of group two; the third block an2 + 2 of group two records the second area of group two
  • the hash value of block an2 + 1 1, and then continue to record the data that was originally to be connected to the first block an2 of group two.
  • the hash value of the verification file V is recorded in the first block an2 of the group two.
  • the jump pointer is: from the second block an2, the first block an1, the second block an2 + 1, and the third block an1 during the chain check. +2 jump, then jump from group one third block an1 + 2 back to group two first block an2 in the original chain check order and jump directly to group two third block an2 + 2.
  • the blocks from the initial block a0 to the first block an1 of the group one are sealed with blank records, and the initial data are recorded starting from the second block an1 + 1 of the group one.
  • the best and most extreme solution is that the group one first block an1 is the initial block a0, and the initial data is recorded starting from the group one second block an1 + 1. Can reduce the number of blank blocks and reduce computing pressure.
  • the verification file V may be an audio file or a video file that records a data change process of the corresponding block, or may be a decryption key file or a digital signature certificate of the data contained in the block.
  • An enterprise such as an crocodile product series production chain
  • its production chain includes at least: feeding units, flesh processing units, proteolysis units, peptide product units, transportation units, sales units, server units, etc.
  • Enterprises in the production chain can adapt to apply the authenticity check system of the present invention.
  • a node is set corresponding to each functional unit in the enterprise, and then all nodes are set to the same blockchain system for synchronous accounting. For example, during the transfer of N tons of crocodile meat to the proteolysis unit by the skin processing unit, the weight of M tons was reduced when the proteolysis unit was reached due to theft. However, when the flesh processing unit performed shipping accounting, it carried out a quantity of N tons, and at the same time notified all nodes, and received a quantity of N tons in the proteolysis unit. Since all nodes have recorded the same data, the computer will consider the record to be legal and record the entry and exit of the N tons of goods and seal the block completely.
  • the seal time of a general block is much shorter than the actual calculation time or other physical operation time, for example, the existing Bitcoin blockchain is sealed for 10 minutes, so the physical operation time may be "day" As a unit, the difference between the authenticity check of the data and the seal time of the block is very large. Therefore, the self-repair function according to the present invention is completed by two sets of relatively independent blocks.
  • the actual number of proteolytic units at the receiving node is insufficient due to the theft.
  • the verification file V in the transportation process has been obtained through various other existing technical means, such as For video files or audio files, the mapping relationship of the verification file V to the delivery record has been completed by recording. After verifying the records of the incoming and outgoing goods by the verification file V, it can be known that the record is actually incorrect data, that is, the receiving node should not record that the quantity of goods received is N tons. However, the block corresponding to the record has been sealed and cannot be modified. Therefore, the system performs the described repair function.
  • the block where the record is located is a group one second block an1 + 1, and the data of the group one second block an1 + 1 is copied to the buffer block a 'and the error data is copied during the copy process
  • the buffer block a ' was corrected and covered, that is, the amount of the proteolysis unit of the receiving node was corrected to NM tons. Record the chain check jump pointer in the first block an2 of group two and copy the data of the buffer block a 'to the second block an2 + 1 of group 2 after the first block an2 of group 2 is sealed.
  • a new mapping relationship is generated between the verification file V and the second block an2 + 1 of the group two, and the hash value of the verification file V is recorded in the first block an2 of the group two; the third block an2 + 2 of the group two records the group The hash value of the second block an2 + 1, and then continue to record the data that was originally to be connected to the first block an2 of group two.
  • the data is checked according to the block sequence number, and when the first block an2 of group two is checked, the jump pointer recorded in the first block an2 of group two is read.
  • the jump pointer jump from group two first block an2, group one first block an1, group two second block an2 + 1, group one third block an1 + 2, and then from group one third
  • the block an1 + 2 returns to the first block an2 of group two in the original chain check sequence, it jumps directly to the third block an2 + 2 of group two.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Storage Device Security (AREA)

Abstract

Système de vérification d'authenticité basé sur une technologie de chaîne de blocs, faisant intervenir: une pluralité de blocs reliés sous la forme d'une chaîne de blocs, un bloc tampon et un fichier de vérification; comportant au moins un groupe un continu et un groupe deux continu, le numéro de série du groupe un étant antérieur à celui du groupe deux, et les blocs du groupe un ne se recouvrant pas avec ceux du groupe deux; et la génération d'une relation de mappage entre le fichier de vérification et un second bloc du groupe un. Le système ne modifie pas le bloc précédent; au lieu de cela, il corrige et enregistre le bloc comprenant des données d'erreur sur un nouveau bloc dans le futur; autrement dit, les données d'erreur d'origine restent conservées sur leur bloc correspondant, et le système dans son ensemble n'altère aucune donnée. Le système de vérification d'authenticité doté de la fonction de correction peut être appliqué directement à une micro-chaîne privée.
PCT/CN2018/091019 2018-06-13 2018-06-13 Système de vérification d'authenticité basé sur une technologie de chaîne de blocs WO2019237275A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2018/091019 WO2019237275A1 (fr) 2018-06-13 2018-06-13 Système de vérification d'authenticité basé sur une technologie de chaîne de blocs

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2018/091019 WO2019237275A1 (fr) 2018-06-13 2018-06-13 Système de vérification d'authenticité basé sur une technologie de chaîne de blocs

Publications (1)

Publication Number Publication Date
WO2019237275A1 true WO2019237275A1 (fr) 2019-12-19

Family

ID=68842434

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/091019 WO2019237275A1 (fr) 2018-06-13 2018-06-13 Système de vérification d'authenticité basé sur une technologie de chaîne de blocs

Country Status (1)

Country Link
WO (1) WO2019237275A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106850802A (zh) * 2017-02-04 2017-06-13 先锋支付有限公司 一种区块链生成方法、分布式节点和区块链网络
US9774578B1 (en) * 2016-05-23 2017-09-26 Accenture Global Solutions Limited Distributed key secret for rewritable blockchain
CN107277781A (zh) * 2017-05-03 2017-10-20 上海点融信息科技有限责任公司 移动宽带网络下的区块链多播网络、区块链设备及其通信方法
CN107423163A (zh) * 2017-03-24 2017-12-01 北京瑞卓喜投科技发展有限公司 整体串行增加区块的区块链的勘误方法及系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9774578B1 (en) * 2016-05-23 2017-09-26 Accenture Global Solutions Limited Distributed key secret for rewritable blockchain
CN106850802A (zh) * 2017-02-04 2017-06-13 先锋支付有限公司 一种区块链生成方法、分布式节点和区块链网络
CN107423163A (zh) * 2017-03-24 2017-12-01 北京瑞卓喜投科技发展有限公司 整体串行增加区块的区块链的勘误方法及系统
CN107277781A (zh) * 2017-05-03 2017-10-20 上海点融信息科技有限责任公司 移动宽带网络下的区块链多播网络、区块链设备及其通信方法

Similar Documents

Publication Publication Date Title
US12003647B2 (en) Reduced-step blockchain verification of media file
KR102263985B1 (ko) 검증, 감사 가능한, 그리고 불변의 입력을 스마트 계약에 제공하는 방법 및 시스템
US11539527B2 (en) Peer node recovery via approximate hash verification
US20220292214A1 (en) Blockchain endorsement with approximate hash verification
US12061569B2 (en) Blockchain data archiving method, apparatus, and computer-readable storage medium
CN107577427B (zh) 用于区块链系统的数据迁移方法、设备和存储介质
CN110647582B (zh) 区块链网络共识校验的方法、装置、存储介质和计算机设备
US20200364214A1 (en) Blockchain data storage based on shared nodes and error correction code
CN110874739B (zh) 实现高完整性、高带宽、低延迟、安全处理的分布式计算和存储网络
US11689356B2 (en) Approximate hash verification of unused blockchain output
US12010213B2 (en) Pruning entries in tamper-evident data stores
KR20210003234A (ko) 분할된 블록체인 네트워크에서 블록체인의 블록을 유지하는 것
US20200382280A1 (en) Committing data to blockchain based on approximate hash verification
CN110135860B (zh) 一种基于区块链技术的农作物种子安全溯源系统
US20210049715A1 (en) Blockchain-based data procesing method, apparatus, and electronic device
US11095434B2 (en) Shared blockchain data storage based on error correction code
CN109493048B (zh) 基于区块链的财务记账方法、装置、设备及存储介质
US20210034460A1 (en) Shared blockchain data storage based on error correction code
CN113472543A (zh) 基于区块链的就业数据处理方法、装置、电子设备及介质
US20240037284A1 (en) Method and system for registering digital documents
CN113362068B (zh) 一种轻节点验证区块链状态转移的方法
US12033196B2 (en) Accelerated invoicing using predictive freight events
CN110730074A (zh) 一种嵌套式可溯源数字孪生体的实现方法及数据结构
WO2019237275A1 (fr) Système de vérification d'authenticité basé sur une technologie de chaîne de blocs
CN111506929A (zh) 一种结合区块链技术的产品流转标识方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18922356

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 23.04.2021)

122 Ep: pct application non-entry in european phase

Ref document number: 18922356

Country of ref document: EP

Kind code of ref document: A1