CN111368003B - Management method of multi-chain anchoring data - Google Patents

Management method of multi-chain anchoring data Download PDF

Info

Publication number
CN111368003B
CN111368003B CN202010150812.XA CN202010150812A CN111368003B CN 111368003 B CN111368003 B CN 111368003B CN 202010150812 A CN202010150812 A CN 202010150812A CN 111368003 B CN111368003 B CN 111368003B
Authority
CN
China
Prior art keywords
data
anchoring
anchored
same
local server
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
CN202010150812.XA
Other languages
Chinese (zh)
Other versions
CN111368003A (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.)
Anhui Zhongke lattice Technology Co.,Ltd.
Original Assignee
Anhui Zhongkezhilian Information Technology 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 Anhui Zhongkezhilian Information Technology Co ltd filed Critical Anhui Zhongkezhilian Information Technology Co ltd
Priority to CN202010150812.XA priority Critical patent/CN111368003B/en
Publication of CN111368003A publication Critical patent/CN111368003A/en
Application granted granted Critical
Publication of CN111368003B publication Critical patent/CN111368003B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2255Hash tables
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/62Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/64Protecting data integrity, e.g. using checksums, certificates or signatures

Abstract

The invention relates to the field of data processing and information security, in particular to a management method of multi-chain anchoring data. Which comprises the following steps: step S1, anchoring of data; step S2, auditing of the data. The invention can better realize the cross-chain management of the anchoring data on the chain.

Description

Management method of multi-chain anchoring data
Technical Field
The invention relates to the field of data processing and information security, in particular to a management method of multi-chain anchoring data.
Background
Currently, blockchain technology is considered suitable for many areas, such as finance, medical care, identity management, asset registration, government agencies, the internet of things, and the like. Anchoring data in the blockchain makes the data verifiable and independently auditable as one of the potential applications of the blockchain.
The block chains are various in types, and users can use the block chains of different types to anchor data, so that the user data can be dispersedly anchored to the different block chains; thus, two challenges are faced, first, a single blockchain provides an ordered, tamper-resistant state transition event log, but anchoring on different blockchains achieves an unordered result that depends on the time stamp of the anchor chain; a second challenge is that the blockchain may be corrupted or forked resulting in loss of the user's anchor data.
Disclosure of Invention
The present invention provides a method of managing multi-chain anchor data that overcomes some or all of the deficiencies of the prior art.
The management method of the multi-chain anchoring data comprises the following steps:
step S1, anchoring of data;
step S2, auditing of the data.
Preferably, step S1 specifically includes the following steps:
step S11, using the data to be anchored and its item as a piece of data, and storing them in the local server;
and step S12, marking each piece of data, marking the same piece of data to be anchored in the same batch, and performing Merkle Tree operation on all pieces of data with the same mark when the number of the pieces of data with the same mark in the local server reaches a set threshold value so as to generate Merkle Root.
Step S13, generating unique ID to identify the current anchoring content;
step S14, finding the ID of the last anchor content and recording as PrevID, which is used to connect to the last anchor result;
step S15, selecting a block chain for anchoring, where the anchoring content includes Merkle Root, ID, PrevID, and list (prevchain); where list (prevchain) is initialized to null, when the block chain selected this time by the user is different from the last time, list (prevchain) is filled with a snapshot of the last anchor result (anchored successively on the same chain).
Step S16, obtain the target blockchain transaction number Txid, and store the Merkle Root, ID, PrevID, List (prevChain), target blockchain type TargetChain, and target blockchain transaction number Txid in the local server, and the anchoring is completed.
Preferably, the corresponding entry is generated by performing a Hash calculation on the data to be anchored.
Preferably, in step S12, marking each data by marking one flag for each data while performing Hash calculation on the data to be anchored in step S11, where the flags marked for the same batch of data to be anchored have the same value; the flag marked by each piece of data is stored in the local server, and the number of the same data in the same batch is calculated by calculating the number of the same flag entries in the local server. Therefore, the management of the same batch of data can be preferably realized.
Preferably, in step S12, the threshold is 1024.
Preferably, step S2 specifically includes the following steps:
step S21, the data content to be audited is called from the local server;
step S22, obtaining the same batch data with the same mark (i.e. the same flag) as the content to be audited from the local server, carrying out Hash calculation to generate local data items, and carrying out Merkle Tree operation to generate Merkle Root;
step S23, acquiring anchoring information associated with the content to be evaluated from the local server, and finding the anchoring content according to the anchored target block chain type TargetChain and the target block chain transaction number Txid;
step S24, verifying whether the Merkle Root generated in the step S22 is consistent with the Merkle Root anchored in the block chain or not, if so, auditing the result to be real, and if not, entering the next step;
step S25, trace back the data across chains through the snapshots in the list (prevchain).
The scheme in the invention is that:
1. the method can pack batch data to generate Merkle Root and anchor the Merkle Root in the block chain, and the block chain needs to be used for payment, so that the method saves the user cost, and meanwhile, the privacy of the user is well protected because the anchoring content is not real data.
2. By adding the ID of the current anchor content and the PrevID of the last anchor content in the anchor data, the user data can be connected in series on different block chains through the IDs, so that the data are ordered, the generation sequence of the data can be distinguished conveniently, and a virtual chain is formed logically.
3. By adding List (prevChain) in the anchor data, the data continuously anchored on the same block chain can be formed into a snapshot and recorded on another block chain, the audit of the data can be completed by using the block content and the snapshot, and the security of the data is enhanced through the security of a plurality of chains.
Drawings
Fig. 1 is a schematic flowchart of user data anchoring in embodiment 1;
FIG. 2 is a schematic view of a multi-stranded anchor structure in example 1;
fig. 3 is a schematic flow chart of user data auditing in embodiment 1.
Detailed Description
For a further understanding of the invention, reference should be made to the following detailed description taken in conjunction with the accompanying drawings and examples. It is to be understood that the examples are illustrative of the invention and not limiting.
Example 1
The embodiment provides a management method of multi-chain anchor data, which comprises the following steps:
step S1, anchoring of data;
step S2, auditing of the data.
Through the method in the embodiment, the management of cross-chain anchoring data can be preferably realized.
As shown in fig. 1, step S1 specifically includes the following steps:
step S11, using the data to be anchored and its item as a piece of data, and storing them in the local server;
and step S12, marking each piece of data, marking the same piece of data to be anchored in the same batch, and performing Merkle Tree operation on all pieces of data with the same mark when the number of the pieces of data with the same mark in the local server reaches a set threshold value so as to generate Merkle Root.
Step S13, generating unique ID to identify the current anchoring content;
step S14, finding the ID of the last anchor content and recording as PrevID, which is used to connect to the last anchor result;
step S15, with reference to fig. 2, selecting a block chain for anchoring, where the anchoring content includes Merkle Root, ID, PrevID, and list (prevchain); where list (prevchain) is initialized to null, when the block chain selected this time by the user is different from the last time, list (prevchain) is filled with a snapshot of the last anchor result (user anchors on the same chain multiple times in succession).
Step S16, obtain the target blockchain transaction number Txid, and store the Merkle Root, ID, PrevID, List (prevChain), target blockchain type TargetChain, and target blockchain transaction number Txid in the local server, and the anchoring is completed.
In the embodiment, batch data can be packaged to generate the Merkle Root and anchored in the block chain, the block chain needs to be used for paying, so that the user cost is saved, and meanwhile, the privacy of the user is well protected due to the fact that the anchored content is not real data.
In this embodiment, by adding the ID of the current anchor content and the PrevID of the previous anchor content to the anchor data, the user data can be connected in series on different blockchains through the IDs, so that the data is ordered, which is beneficial to distinguishing the generation sequence of the data, and logically forms a virtual chain.
In this embodiment, by adding a list (prevchain) to the anchor data, the data that is continuously anchored on the same block chain can be snapshot-formed and recorded on another block chain, and the data can be audited by using the block content and the snapshot, so that the security of the data is enhanced by the security of multiple chains.
In step S11, a corresponding entry is generated by performing a Hash calculation on the data to be anchored.
In step S12, marking each data by marking one flag for each data while performing Hash calculation on the data to be anchored in step S11, where the flags marked for the same batch of data to be anchored have the same value; the flag marked by each piece of data is stored in the local server, and the number of the same data in the same batch is calculated by calculating the number of the same flag entries in the local server. Therefore, the management of the same batch of data can be preferably realized.
In step S12, the threshold is set to 1024. The data can be anchored better.
As shown in fig. 3, step S2 specifically includes the following steps:
step S21, the data content to be audited is called from the local server;
step S22, obtaining the same batch data with the same mark (i.e. the same flag) as the content to be audited from the local server, carrying out Hash calculation to generate local data items, and carrying out Merkle Tree operation to generate Merkle Root;
step S23, acquiring anchoring information associated with the content to be evaluated from the local server, and finding the anchoring content according to the anchored target block chain type TargetChain and the target block chain transaction number Txid;
step S24, verifying whether the Merkle Root generated in the step S22 is consistent with the Merkle Root anchored in the block chain or not, if so, auditing the result to be real, otherwise, entering the next step;
in step S25, if the data in the chain is lost due to block chain bifurcation or the like, the data is traced back across chains by using the snapshot in the list (prevchain).
In this embodiment, when data on a chain is lost due to reasons such as block chain bifurcation, cross-chain tracing can be performed through a list (prevchain) snapshot, so that user data in different block chains can be connected in order, the problem that data cannot be audited due to block chain faults is effectively prevented, and the security of the data on the chain can be enhanced better.
The present invention and its embodiments have been described above schematically, without limitation, and what is shown in the drawings is only one of the embodiments of the present invention, and the actual structure is not limited thereto. Therefore, if the person skilled in the art receives the teaching, without departing from the spirit of the invention, the person skilled in the art shall not inventively design the similar structural modes and embodiments to the technical solution, but shall fall within the scope of the invention.

Claims (5)

1. A method of managing multi-chain anchor data, comprising the steps of:
step S1, anchoring of data;
step S2, auditing data;
in step S1, the method specifically includes the following steps:
step S11, using the data to be anchored and its item as a piece of data, and storing them in the local server;
step S12, marking each piece of data, marking the same piece of data to be anchored in the same batch, and performing Merkle Tree operation on all the data with the same mark when the number of the data with the same mark in the local server reaches a set threshold value so as to generate Merkle Root;
step S13, generating unique ID to identify the current anchoring content;
step S14, finding the ID of the last anchor content and recording as PrevID, which is used to connect to the last anchor result;
step S15, selecting a block chain for anchoring, where the anchoring content includes Merkle Root, ID, PrevID, and list (prevchain); the list (prevchain) is initialized to be empty, and when the block chain selected by the user at this time is different from the last time, the list (prevchain) is filled into a snapshot of the last segment of the anchoring result;
step S16, obtain the target blockchain transaction number Txid, and store the Merkle Root, ID, PrevID, List (prevChain), target blockchain type TargetChain, and target blockchain transaction number Txid in the local server, and the anchoring is completed.
2. A method for managing multi-chain anchor data according to claim 1, characterized in that: and generating a corresponding entry by performing Hash calculation on the data to be anchored.
3. A method for managing multi-chain anchor data according to claim 1, characterized in that: in step S12, marking each data by marking one flag for each data while performing Hash calculation on the data to be anchored in step S11, where the flags marked for the same batch of data to be anchored have the same value; the flag marked by each piece of data is stored in the local server, and the number of the same data in the same batch is calculated by calculating the number of the same flag entries in the local server.
4. A method for managing multi-chain anchor data according to claim 1, characterized in that: in step S12, the threshold is set to 1024.
5. A method for managing multi-chain anchor data according to claim 1, characterized in that: in step S2, the method specifically includes the following steps:
step S21, the data content to be audited is called from the local server;
step S22, obtaining the same batch of data with the same mark as the content to be checked from the local server, carrying out Hash calculation to generate local data items, and carrying out Merkle Tree operation to generate Merkle Root;
step S23, acquiring anchoring information associated with the content to be evaluated from the local server, and finding the anchoring content according to the anchored target block chain type TargetChain and the target block chain transaction number Txid;
step S24, verifying whether the Merkle Root generated in the step S22 is consistent with the Merkle Root anchored in the block chain or not, if so, auditing the result to be real, and if not, entering the next step;
step S25, trace back the data across chains through the snapshots in the list (prevchain).
CN202010150812.XA 2020-03-06 2020-03-06 Management method of multi-chain anchoring data Active CN111368003B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010150812.XA CN111368003B (en) 2020-03-06 2020-03-06 Management method of multi-chain anchoring data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010150812.XA CN111368003B (en) 2020-03-06 2020-03-06 Management method of multi-chain anchoring data

Publications (2)

Publication Number Publication Date
CN111368003A CN111368003A (en) 2020-07-03
CN111368003B true CN111368003B (en) 2020-10-16

Family

ID=71206616

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010150812.XA Active CN111368003B (en) 2020-03-06 2020-03-06 Management method of multi-chain anchoring data

Country Status (1)

Country Link
CN (1) CN111368003B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112435128B (en) * 2021-01-27 2021-10-22 江苏恒鸿供应链管理有限公司 Supply chain tracing system based on multi-level block chain technology

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108876369A (en) * 2018-06-05 2018-11-23 上海和数软件有限公司 Data communications method, device and computer readable storage medium based on block chain
CN108924114A (en) * 2018-06-25 2018-11-30 北京奇虎科技有限公司 Data are anchored method and device on a kind of chain
CN109145612A (en) * 2018-07-05 2019-01-04 东华大学 The cloud data sharing method of anti-data tampering, user's collusion is realized based on block chain
CN109165190A (en) * 2018-07-11 2019-01-08 南京邮电大学 A kind of electronic data based on block chain intelligence contract deposits card method
CN109345388A (en) * 2018-09-20 2019-02-15 百度在线网络技术(北京)有限公司 Block chain intelligence contract verification method, device and storage medium
CN109409122A (en) * 2018-09-13 2019-03-01 远光软件股份有限公司 File memory method and its electronic equipment, storage medium
CN109426949A (en) * 2017-08-29 2019-03-05 华为技术有限公司 Across the chain method of commerce of one kind and device
CN110245517A (en) * 2019-05-29 2019-09-17 杭州秘猿科技有限公司 A kind of across chain method, apparatus, system and the electronic equipment of block chain
CN110287167A (en) * 2019-05-31 2019-09-27 安徽中科智链信息科技有限公司 A kind of testament management system and method based on block chain technology
CN110771120A (en) * 2019-02-28 2020-02-07 阿里巴巴集团控股有限公司 System and method for blockchain based authentication

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11074495B2 (en) * 2013-02-28 2021-07-27 Z Advanced Computing, Inc. (Zac) System and method for extremely efficient image and pattern recognition and artificial intelligence platform
EP3257221B1 (en) * 2015-02-13 2022-03-09 Yoti Holding Limited Digital identity
US10637669B2 (en) * 2017-02-24 2020-04-28 Guardtime Sa Data and data lineage control, tracking, and verification
CN108038184B (en) * 2017-12-08 2020-04-17 横琴密达科技有限责任公司 Data storage method and system based on block chain and intelligent block chain
US10558471B2 (en) * 2018-02-09 2020-02-11 Merck Sharp & Dohme Corp. Proof of configuration
US11169985B2 (en) * 2018-07-27 2021-11-09 Oracle International Corporation System and method for supporting SQL-based rich queries in hyperledger fabric blockchains
CN109634959B (en) * 2018-11-30 2020-12-25 北京瑞卓喜投科技发展有限公司 Block indexing method and block indexing device
CN109951490A (en) * 2019-03-27 2019-06-28 远光软件股份有限公司 Webpage integrity assurance, system and electronic equipment based on block chain

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109426949A (en) * 2017-08-29 2019-03-05 华为技术有限公司 Across the chain method of commerce of one kind and device
CN108876369A (en) * 2018-06-05 2018-11-23 上海和数软件有限公司 Data communications method, device and computer readable storage medium based on block chain
CN108924114A (en) * 2018-06-25 2018-11-30 北京奇虎科技有限公司 Data are anchored method and device on a kind of chain
CN109145612A (en) * 2018-07-05 2019-01-04 东华大学 The cloud data sharing method of anti-data tampering, user's collusion is realized based on block chain
CN109165190A (en) * 2018-07-11 2019-01-08 南京邮电大学 A kind of electronic data based on block chain intelligence contract deposits card method
CN109409122A (en) * 2018-09-13 2019-03-01 远光软件股份有限公司 File memory method and its electronic equipment, storage medium
CN109345388A (en) * 2018-09-20 2019-02-15 百度在线网络技术(北京)有限公司 Block chain intelligence contract verification method, device and storage medium
CN110771120A (en) * 2019-02-28 2020-02-07 阿里巴巴集团控股有限公司 System and method for blockchain based authentication
CN110245517A (en) * 2019-05-29 2019-09-17 杭州秘猿科技有限公司 A kind of across chain method, apparatus, system and the electronic equipment of block chain
CN110287167A (en) * 2019-05-31 2019-09-27 安徽中科智链信息科技有限公司 A kind of testament management system and method based on block chain technology

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于区块链的档案数据保护与共享方法;谭海波 等;《软件学报》;20190411(第09期);2620-2635 *

Also Published As

Publication number Publication date
CN111368003A (en) 2020-07-03

Similar Documents

Publication Publication Date Title
US20200374126A1 (en) Method for storing an object on a plurality of storage nodes
JP5989183B2 (en) Data signature generation method, data signature verification method, and management computer
CN111898360B (en) Text similarity detection method and device based on block chain and electronic equipment
US10303887B2 (en) Data verification methods and systems using a hash tree, such as a time-centric merkle hash tree
CN108520464B (en) Real-time automatic supervision reporting system based on traditional block chain
CN109829726B (en) Block chain-based drug information management method and system
CN111316279A (en) Computer-implemented system and method for connecting a blockchain with a digital twin set
US20100115284A1 (en) Support of tamper detection for a log of records
US11664974B2 (en) Summary chains in distributed systems
CN108494557A (en) Social security digital certificate management method, computer readable storage medium and terminal device
Frühwirt et al. Towards a forensic-aware database solution: Using a secured database replication protocol and transaction management for digital investigations
CN112395300A (en) Data processing method, device and equipment based on block chain and readable storage medium
CN109522747A (en) A kind of anti-tamper diary record system and method based on block chain
US20160134495A1 (en) Logging device and log aggregation device
US20190074974A1 (en) Cryptographically Linking Related Events Processed Across Multiple Processing Systems
CN111368003B (en) Management method of multi-chain anchoring data
CN109525949A (en) Register method and device, storage medium, server, user terminal
WO2022206439A1 (en) Method and apparatus for providing cross-chain message
He et al. Public integrity auditing for dynamic regenerating code based cloud storage
CN110347678B (en) Financial data storage method, system, device and equipment
CN114462998A (en) Log tamper-proofing method, system and storage medium
CN108880823A (en) A kind of method and system generating the block chain quickly to navigate
Etoh et al. Study of log file dispersion management method
CN113032842B (en) Webpage tamper-proof system and method based on cloud platform
Mazumdar et al. Tamper-resistant database logging on mobile devices

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
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20210825

Address after: 230000 Room 501, block B, Anhui Institute of industrial technology innovation, No. 2221, Changjiang West Road, high tech Zone, Hefei, Anhui

Patentee after: Anhui Zhongke lattice Technology Co.,Ltd.

Address before: 231283 floor 38, land innovation center, high tech Zone, Hefei, Anhui Province

Patentee before: ANHUI ZHONGKEZHILIAN INFORMATION TECHNOLOGY Co.,Ltd.