CN109194486A - Believable cooperation model and data model, metadata storage and co-verification algorithm - Google Patents
Believable cooperation model and data model, metadata storage and co-verification algorithm Download PDFInfo
- Publication number
- CN109194486A CN109194486A CN201810964031.7A CN201810964031A CN109194486A CN 109194486 A CN109194486 A CN 109194486A CN 201810964031 A CN201810964031 A CN 201810964031A CN 109194486 A CN109194486 A CN 109194486A
- Authority
- CN
- China
- Prior art keywords
- metadata
- signature
- block chain
- block
- data
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/561—Adding application-functional data or data for application control, e.g. adding metadata
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Bioethics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Library & Information Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention discloses a kind of believable cooperation model, including accumulation layer, validation layer and block link layer, for the metadata management in trustless environment, and the related data model based on block chain is provided, including signature metadata, meta data block and metadata block chain.It is also proposed simultaneously for metadata storage and co-verification algorithm.Believable cooperation model of the invention not only effectively can store and verify metadata, can also provide enhanced scalability.Data model of the invention has data integrity, accuracy and trackability.Metadata stores algorithm, and the metadata returned in collaborative network by verifying node is all accurately, to have data accuracy for any given signature.Metadata validation synergetic, as long as being worked normally in collaborative network more than the node of half, so that it may obtain the copy of respective meta-data.Also it can get the respective meta-data of signature, it is meant that the metadata in believable cooperation model is traceable.
Description
Technical field
The invention belongs to computer database technology fields, and in particular to believable cooperation model and data model, first number
According to storage and co-verification algorithm.
Background technique
Outsourcing data service is increasingly taken seriously, because it can be efficiently against the limit of mass data storage capacity
System.Based on outsourcing data service, it has been proposed that more and more application programs, for example in the service of outer bag data, data are all
Data are contracted out to cloud service provider (CSP, Cloud Service Provider), Hou Zheti by person (DO, Data Owner)
Mass data is managed for distributed storage strategy.But it is insecure that data are managed by a CSP, because CSP is logical
It is often half trust.If half credible CSP unilaterally closes or interrupt service, DO will encounter complicated problem, such as Data Migration,
Error in data and privacy leakage.
It is that data are contracted out to multiple CSP (Multi- that the conventional method of data reliability is improved in untrusted environment
CSP).Each CSP saves the copy of DO initial data, and DO then can obtain base data replicas by retrieval metadata
Physical location.But in order to ensure the consistency DO of all copies is individually communicated with each CSP, while DO also needs
The metadata of each copy is managed, this greatly increases the work load of DO.
As the local solution for improving metadata management efficiency between more CSP, DO usually stores metadata in the
In tripartite's metadata management (TPMM, Third Party Metadata Management).DO sends out the copy of all metadata
It is sent to TPMM, TPMM provides the service of storage and verifying metadata.Obviously this improves the efficiency of management, but utilizes centralization
TPMM inevitably some problems in terms of information reliability.For example, due to losing physical control, metadata is disliked
Meaning leakage is distorted.In order to solve this problem, it would be desirable to which the model of a decentralization manages incredible Multi-
Metadata in CSP environment.
Summary of the invention
In order to solve the above technical problems, the invention proposes believable cooperation model and data model, metadata storage and
Co-verification algorithm.Believable cooperation model based on block chain, i.e. (RCOM, Reliable Collaborative
Model), for the metadata management in trustless environment.
The present invention provides a kind of data model of believable cooperation model, comprising: signature metadata, meta data block and first number
According to block chain；
Signature metadata is made of signature and two elements of metadata, gives user C, sigcIndicate the signature of C, metacTable
Show the correspondence metadata of C, the signature metadata table of user C is shown as < sigc, metac>, give one group of signature metadata Ssigmeta=
{<sig1, meta1>,<sig2, meta2>...,<sigm, metam>, by SsigmetaThe Merkle tree root of generation is unique；
Meta data block includes metadata build and metadata block, metadata build include father's meta data block cryptographic Hash,
The Merkle tree root and timestamp of the cryptographic Hash of current meta data block, all signature metadata；In metadata block, all label
Name metadata constructs Merkle tree；
Metadata block chain is made of multiple meta data blocks, and current meta data block is counted by the cryptographic Hash of father's meta data block
It calculates.
In the data model of believable cooperation model of the invention, origin meta data block is defined as MB0, define two members
Data block chain is respectively as follows: MBC1={ MB11, MB12..., MB1mAnd MBC2={ MB21, MB22..., MB2m}；Only at two
The block head of meta data block on all corresponding positions of metadata block chain, which corresponds to, identical could illustrate MBC1And MBC2With phase
Same state.
The present invention also provides a kind of believable cooperation models, comprising: accumulation layer, validation layer and block link layer；
Accumulation layer is that the bottom of believable cooperation model is made of united CSP, and each CSP has the distribution of oneself to deposit
Storage system is used to manage mass data and generates the copy of signature metadata；
Validation layer constitutes collaborative network by some VP, and in this collaborative network, each VP can store and verify the label of DO
Name metadata；All VP manage the copy of local metadata block chain, and synchronize local metadata block chain and global first number
According to the state of block chain；In metadata memory phase, each VP collects signature metadata to construct meta data block and local is written
Metadata block chain；In the metadata validation stage, VP first check for local metadata block chain state whether with global first number
According to the state consistency of block chain, local metadata block chain then is retrieved using signature and returns to corresponding signature metadata；
Block link layer is used to manage the state of global metadata block chain, and all VP in validation layer can read block
Link layer is to synchronize the state of local metadata block chain.
In believable cooperation model of the invention, global metadata block chain be it is read-only, i.e., if any signature is first
Data change, then node must rebuild new meta data block, and be re-write global metadata block chain.
Also a kind of metadata based on believable cooperation model of the present invention stores algorithm, includes the following steps:
Step 1: the collection for setting DO is combined into SDO={ DO1, DO2..., DOm}；The initial data of each DO is F, then all DO
The set expression of initial data is SF={ F1, F2 ..., Fm }；SVP={ VP1, VP2..., VPsIndicate to constitute collaborative network
One group of verifying node；SCSP={ CSP1, CSP2..., CSPmIndicate to be provided with multiple CSP, and each CSP and collaborative network
Keep connection；
Step 2:SDOIn all DO all generate oneself public key pub_k and private key pri_k, send public key pub_k to
Collaborative network is simultaneously signed with initial data of the private key pri_k to oneself, and the initial data S of signature is generatedF={ < sig1, F1
>,<sig2, F2>...<sigm, Fm>}；
Step 3:DO is by the original data transmissions of signature to accumulation layer；
Step 4:SVPIn each VP duplication DO be stored in the signature metadata in accumulation layer, by all signature metadata sets
The copy of conjunction is expressed as Ssigmeta={ < sig1, meta1>,<sig2, meta2>...,<sigm, metam>}；
Step 5:SVPIn each VP S is verified by using the distinctive public key pub_k of each DOsigmetaIn all label
Name, wherein the VP for successfully completing verification process sends the message being proved to be successful to other VP；
Step 6: working as SVPIn VP receive more than half in all VP be proved to be successful message after terminate current verifying
Process simultaneously waits next request；
Step 7: we assume that SsuccOne group of verifying node for completing proving program is represented, S is randomly choosedsuccIn VP, i.e.,
VPsucc；Then VPsuccUtilize SsigmetaConstruction Merkle tree simultaneously generates meta data block；
Step 8:VPsuccLocal metadata block chain, VP is written into meta data blocksuccMeta data block is linked to entirely by acquisition
The write-in permission of office's metadata block chain, and other VP are sent to for synchronizing the message of local metadata block chain；
Step 9: when each VP receives the synchronous message of the local metadata block chain of progress, can all synchronize local metadata
Block chain is to match global block chain state.
The present invention also provides a kind of metadata co-verification algorithm based on believable cooperation model, comprising the following steps:
Step 1: the collection for setting DO is combined into SDO={ DO1, DO2..., DOm}；SVP={ VP1, VP2..., VPsIndicate to constitute
One group of verifying node of collaborative network；SCSP={ CSP1, CSP2..., CSPmIndicate to be provided with multiple CSP, and each CSP
It keeps connecting with collaborative network；
Its corresponding signature is sent collaborative network S by step 2:DOVP={ VP1, VP2..., VPs, and each VP is examined
Whether the state for looking into local metadata block chain is consistent with the state of global metadata block chain；
Step 3: if the state of local metadata block chain and the state of global metadata block chain are inconsistent, the VP
The block link layer of believable cooperation model must be linked to synchronize local metadata block chain；If having consistent state, the VP
Local metadata block chain will be retrieved to obtain corresponding signature metadata；
Step 4: when obtaining all signature metadata of DO, which is proved to be successful what is be calculated by signature metadata
Message and signature metadata abstract be sent to other VP；
Step 5: working as SVPIn VP receive the message being proved to be successful that the VP of more than half in all VP is sent and they
Abstract it is consistent when, terminate current verification process and will signature metadata return to DO.
The present invention is based on block chains to devise a believable collaboration mould for the metadata management in untrusted environment
Type, i.e. (RCOM, Reliable Collaborative Model), and the data model based on RCOM is given, and be based on
RCOM metadata stores algorithm and co-verification algorithm, not only effectively can store and verify metadata, can also provide height
Scalability.Data model of the invention has data integrity, data accuracy and data trackability.
The integrality of data: in metadata memory phase, VPsCo-verification signature.Metadata with invalid signature is not
It can be stored in metadata block chain.In addition, if signature changes (such as replacement signature algorithm or encryption equipment), then must
New signature must be used to regenerate signature metadata.Meanwhile the data configuration in meta data block is Merkle tree, by < sigc,
Metac > composition respectively indicates signature and metadata, and wherein Merkle tree root changes with sigc or metac mono-, this ensures
The integrality of metadata.
Data accuracy: by verifying the signature provided, the metadata based on RCOM stores algorithm, each verifying node
(Verification Peers, VP) only could modify global block chain when receiving and being more than certain amount of message.In addition,
At any time, only one VP can update global metadata block chain, and this avoids block chain bifurcateds.At the same time, institute
There is VP that can synchronize the local state of metadata block chain periodically to maintain data consistency.This method ensures to be stored in
Metadata in each VP is consistent.Therefore, the metadata returned in the collaborative network of RCOM by VPs is for any given
Signature is all accurate.
Data are traceable: in RCOM model, data and signature are uploaded to and provide the CSP of storage service by DO, and CSP will be first
Data are sent to collaborative network.Therefore, metadata can be obtained by signing accordingly.According to the metadata validation based on RCOM
Synergetic, as long as working normally in collaborative network more than the node of half, we are obtained with the copy of respective meta-data.
Since metadata generally includes the information of initial data, such as the physical location of copy, the quantity of copy, if given meta-data region
Block chain SMBC={ MB1, MB2, MBmWherein MBi(i ∈ [0, m]) indicates meta data block, we can obtain signature
Respective meta-data, it means that the metadata in RCOM is traceable.
Detailed description of the invention
Fig. 1 is the structure chart of the believable cooperation model of the present invention；
Fig. 2 is the structure chart of the data model of the believable cooperation model of the present invention；
Fig. 3 is that the present invention is based on the flow charts that the metadata of believable cooperation model stores algorithm；
Fig. 4 is that the present invention is based on the flow charts of the metadata validation synergetic method of believable cooperation model.
Specific embodiment
The specific embodiment of the invention is described in detail with reference to the accompanying drawing.
As shown in Fig. 2, a kind of data model of believable cooperation model of the invention characterized by comprising signature member
Data, meta data block and metadata block chain.
Metadata (Metadata) generally includes the information of initial data, such as the physical location of copy, the quantity of copy.
Signature metadata is made of signature and two elements of metadata, gives user C, sigcIndicate the signature of C, metacTable
Show the correspondence metadata of C.Signature metadata table is shown as < sigc, metac>, give one group of signature metadata Ssigmeta={ < sig1,
meta1>,<sig2, meta2>...,<sigm, metam>, by SsigmetaThe Merkle tree root of generation is unique.
Meta data block (Metadata Block, MB) consists of two parts, including metadata build and metadata block, member
Data block head includes the Merkle tree of the cryptographic Hash of father's meta data block, the cryptographic Hash of current meta data block, all signature metadata
Root and timestamp；In metadata block, all signature metadata construct Merkle tree.An example of MB is shown in Fig. 2
Son.
Metadata block chain (Metadata Block chain, MBC) is made of, current meta data block multiple meta data blocks
It is calculated by the cryptographic Hash of father's meta data block.That is, each MBi+1By having its previous MBiCryptographic Hash calculate, MBi+1
=Hash (MBi)。
Further, origin meta data block is defined as MB0, define two metadata block chains and be respectively as follows: MBC1={ MB11,
MB12..., MB1mAnd MBC2={ MB21, MB22..., MB2m}；Only on all corresponding positions of two metadata block chains
The block head of meta data block correspond to and identical could illustrate MBC1And MBC2State having the same.That is, MBC1And MBC2Only exist
MBC1.MB1i-> Header=MBC2.MB2iState having the same when -> Header, wherein [0, m] i ∈.
As shown in Figure 1, a kind of believable cooperation model of the invention, comprising: accumulation layer, validation layer and block link layer；
Accumulation layer is that the bottom of RCOM is made of united CSP, and each CSP has the distributed memory system of oneself to be used for
Management mass data and the copy for generating signature metadata；
Validation layer constitutes collaborative network by some VP, and in this collaborative network, each VP can store and verify the label of DO
Name metadata；All VP manage the copy of local metadata block chain, and synchronize local metadata block chain and global first number
According to the state of block chain；In metadata memory phase, each VP collects signature metadata to construct meta data block and local is written
Metadata block chain；In the metadata validation stage, VP first check for local metadata block chain state whether with global first number
According to the state consistency of block chain, local metadata block chain then is retrieved using signature and returns to corresponding signature metadata；
Block link layer is used to manage the state of global metadata block chain, and all VP in the validation layer of RCOM can be read
Block link layer is taken to synchronize the state of local metadata block chain.
Further, global metadata block chain is read-only, i.e., if any signature metadata changes, node is necessary
New meta data block is rebuild, and is re-write global metadata block chain.
As shown in figure 3, the present invention also provides a kind of, the metadata based on believable cooperation model stores algorithm, including as follows
Step:
Step 1: the collection for setting data owner DO is combined into SDO={ DO1, DO2..., DOm}；The initial data of each DO is F,
Then the set expression of the initial data of all DO is SF={ F1, F2 ..., Fm }；SVP={ VP1, VP2..., VPsIndicate to constitute
One group of verifying node of collaborative network；SCSP={ CSP1, CSP2..., CSPmIndicate to be provided with multiple CSP, and each CSP
It keeps connecting with collaborative network；
Step 2:SDOIn all DO all generate oneself public key pub_k and private key pri_k, send public key pub_k to
Collaborative network is simultaneously signed with initial data F of the private key pri_k to oneself, and the initial data S of signature is generatedF={ < sig1, F1
>,<sig2, F2>...<sigm, Fm>}；
Step 3:DO is by the initial data S of signatureFAccumulation layer is transferred to improve reliabilty and availability；
Step 4:SVPIn each VP duplication DO be stored in the signature metadata in accumulation layer, by all signature metadata sets
The copy of conjunction is expressed as Ssigmeta={ < sig1, meta1>,<sig2, meta2>...,<sigm, metam>}；
Step 5:SVPIn each VP S is verified by using the distinctive public key pub_k of each DOsigmetaIn all label
Name, wherein the VP for successfully completing verification process sends the message m essage being proved to be successful to other VPsucc；
Step 6: working as SVPIn VP receive more than half in all VP be proved to be successful message after terminate current verifying
Process simultaneously waits next request；
Step 7: we assume that SsuccOne group of verifying node for completing proving program is represented, S is randomly choosedsuccIn VP, i.e.,
VPsucc；Then VPsuccUtilize SsigmetaConstruction Merkle tree simultaneously generates meta data block MB；
Step 8:VPsuccLocal metadata block chain, VP is written into meta data blocksuccMeta data block is linked to entirely by acquisition
The write-in permission of office's metadata block chain, and other VP are sent to for synchronizing the message of local metadata block chain；
Step 9: when each VP receives the synchronous message of the local metadata block chain of progress, can all synchronize local metadata
Block chain is to match global block chain state.
As shown in figure 4, the present invention also provides a kind of metadata co-verification algorithm based on believable cooperation model, including
Following steps:
Step 1: the collection for setting DO is combined into SDO={ DO1, DO2..., DOm}；SVP={ VP1, VP2..., VPsIndicate to constitute
One group of verifying node of collaborative network；SCSP={ CSP1, CSP2..., CSPmIndicate to be provided with multiple CSP, and each CSP
It keeps connecting with collaborative network；
Its corresponding signature is sent collaborative network S by step 2:DOVP={ VP1, VP2..., VPs, and each VP is examined
Whether the state for looking into local metadata block chain is consistent with the state of global metadata block chain；
Step 3: if the state of local metadata block chain and the state of global metadata block chain are inconsistent, the VP
The block link layer of believable cooperation model must be linked to synchronize local metadata block chain；If having consistent state, the VP
Local metadata block chain will be retrieved to obtain corresponding signature metadata；
Step 4: when obtaining all signature metadata of DO, which is proved to be successful what is be calculated by signature metadata
Message and signature metadata abstract be sent to other VP；
Step 5: working as SVPIn VP receive the message being proved to be successful that the VP of more than half in all VP is sent and they
Abstract it is consistent when, terminate current verification process and will signature metadata return to DO.
The foregoing is merely presently preferred embodiments of the present invention, the thought being not intended to limit the invention, all of the invention
Within spirit and principle, any modification, equivalent replacement, improvement and so on be should all be included in the protection scope of the present invention.
Claims (6)
1. a kind of data model of believable cooperation model characterized by comprising signature metadata, meta data block and first number
According to block chain；
Signature metadata is made of signature and two elements of metadata, gives user C, sigcIndicate the signature of C, metacIndicate C
Correspondence metadata, the signature metadata table of user C is shown as < sigc, metac>, give one group of signature metadata Ssigmeta=<
sig1, meta1>,<sig2, meta2>...,<sigm, metam>, by SsigmetaThe Merkle tree root of generation is unique；
Meta data block includes metadata build and metadata block, and metadata build includes the cryptographic Hash, current of father's meta data block
The Merkle tree root and timestamp of the cryptographic Hash of meta data block, all signature metadata；In metadata block, all signature members
Data configuration Merkle tree；
Metadata block chain is made of multiple meta data blocks, and current meta data block is calculated by the cryptographic Hash of father's meta data block.
2. the data model of believable cooperation model as described in claim 1, which is characterized in that origin meta data block is defined as
MB0, define two metadata block chains and be respectively as follows: MBC1={ MB11, MB12..., MB1mAnd MBC2={ MB21, MB22...,
MB2m}；The block head of meta data block only on all corresponding positions of two metadata block chains corresponds to identical ability explanation
MBC1And MBC2State having the same.
3. a kind of believable cooperation model characterized by comprising accumulation layer, validation layer and block link layer；
Accumulation layer is that the bottom of believable cooperation model is made of united CSP, and each CSP has the distributed storage system of oneself
Unite for manage mass data and generate signature metadata copy；
Validation layer constitutes collaborative network by some VP, and in this collaborative network, each VP can store and verify the signature member of DO
Data；All VP manage the copy of local metadata block chain, and synchronize local metadata block chain and global metadata area
The state of block chain；In metadata memory phase, each VP collects signature metadata to construct meta data block and local first number is written
According to block chain；In the metadata validation stage, VP first check for local metadata block chain state whether with global metadata area
Then the state consistency of block chain retrieves local metadata block chain using signature and returns to corresponding signature metadata；
Block link layer is used to manage the state of global metadata block chain, and all VP in validation layer can read block link layer
To synchronize the state of local metadata block chain.
4. believable cooperation model as claimed in claim 3, which is characterized in that global metadata block chain be it is read-only, i.e.,
If any signature metadata changes, node must rebuild new meta data block, and be re-write global metadata area
Block chain.
5. a kind of metadata based on believable cooperation model stores algorithm, which comprises the steps of:
Step 1: the collection for setting DO is combined into SDO={ DO1, DO2..., DOm}；The initial data of each DO is F, then all DO's is original
The set expression of data is SF={ F1, F2 ..., Fm }；SVP={ VP1, VP2..., VPsIndicate to constitute one group of collaborative network
Verify node；SCSP={ CSP1, CSP2..., CSPmIndicate to be provided with multiple CSP, and each CSP and collaborative network are kept
Connection；
Step 2:SDOIn all DO all generate oneself public key pub_k and private key pri_k, send cooperation for public key pub_k
Network is simultaneously signed with initial data of the private key pri_k to oneself, and the initial data S of signature is generatedF={ < sig1, F1>,<
sig2, F2>...<sigm, Fm>}；
Step 3:DO is by the original data transmissions of signature to accumulation layer；
Step 4:SVPIn each VP duplication DO be stored in the signature metadata in accumulation layer, by all signature collection of metadata
Copy is expressed as Ssigmeta={ < sig1, meta1>,<sig2, meta2>...,<sigm, metam>}；
Step 5:SVPIn each VP S is verified by using the distinctive public key pub_k of each DOsigmetaIn all signatures,
The VP for wherein successfully completing verification process sends the message being proved to be successful to other VP；
Step 6: working as SVPIn VP receive more than half in all VP be proved to be successful message after terminate current verification process
And wait next request；
Step 7: we assume that SsuccOne group of verifying node for completing proving program is represented, S is randomly choosedsuccIn VP, i.e.,
VPsucc；Then VPsuccUtilize SsigmetaConstruction Merkle tree simultaneously generates meta data block；
Step 8:VPsuccLocal metadata block chain, VP is written into meta data blocksuccIt obtains and meta data block is linked to global member
The write-in permission of data block chain, and other VP are sent to for synchronizing the message of local metadata block chain；
Step 9: when each VP receives the synchronous message of the local metadata block chain of progress, can all synchronize local metadata block
Chain is to match global block chain state.
6. a kind of metadata co-verification algorithm based on believable cooperation model, which comprises the following steps:
Step 1: the collection for setting DO is combined into SDO={ DO1, DO2..., DOm}；SVP={ VP1, VP2..., VPsIndicate to constitute coorporative network
One group of verifying node of network；SCSP={ CSP1, CSP2..., CSPmIndicate be provided with multiple CSP, and each CSP with cooperate
Network keeps connection；
Its corresponding signature is sent collaborative network S by step 2:DOVP={ VP1, VP2..., VPs, and each VP checks this
Whether the state of ground metadata block chain is consistent with the state of global metadata block chain；
Step 3: if the state of local metadata block chain and the state of global metadata block chain are inconsistent, the VP is necessary
The block link layer of believable cooperation model is linked to synchronize local metadata block chain；If having consistent state, which all can
Local metadata block chain is retrieved to obtain corresponding signature metadata；
Step 4: when obtaining all signature metadata of DO, which disappears being proved to be successful of being calculated by signature metadata
Breath and the abstract of signature metadata are sent to other VP；
Step 5: working as SVPIn VP receive the message being proved to be successful that the VP of more than half in all VP is sent and they are plucked
When wanting consistent, terminates current verification process and signature metadata is returned into DO.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810964031.7A CN109194486A (en) | 2018-08-23 | 2018-08-23 | Believable cooperation model and data model, metadata storage and co-verification algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810964031.7A CN109194486A (en) | 2018-08-23 | 2018-08-23 | Believable cooperation model and data model, metadata storage and co-verification algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109194486A true CN109194486A (en) | 2019-01-11 |
Family
ID=64919630
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810964031.7A Pending CN109194486A (en) | 2018-08-23 | 2018-08-23 | Believable cooperation model and data model, metadata storage and co-verification algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109194486A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109936620A (en) * | 2019-01-21 | 2019-06-25 | 中国联合网络通信集团有限公司 | Storage method and device, system and storage medium based on block chain |
| CN110110990A (en) * | 2019-04-30 | 2019-08-09 | 德稻全球创新网络（北京）有限公司 | A kind of mobile communication system of interfirm cooperation Project cooperation |
| CN110601857A (en) * | 2019-09-25 | 2019-12-20 | 东北大学 | Data interaction method based on local-global block chain cooperation |
| CN111258508A (en) * | 2020-02-16 | 2020-06-09 | 西安奥卡云数据科技有限公司 | Metadata management method in distributed object storage |
| CN112487492A (en) * | 2019-04-04 | 2021-03-12 | 创新先进技术有限公司 | Data verification method, system and equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105630609A (en) * | 2016-02-24 | 2016-06-01 | 杭州复杂美科技有限公司 | Block chain packing and storing method |
| CN105868369A (en) * | 2016-03-30 | 2016-08-17 | 电子科技大学 | Data model verification system and method based on Merkle tree structure |
| WO2017112664A1 (en) * | 2015-12-21 | 2017-06-29 | Kochava Inc. | Self regulating transaction system and methods therefor |
| WO2017204943A1 (en) * | 2016-05-24 | 2017-11-30 | Mastercard International Incorporated | Method and system for an efficient consensus mechanism for permissioned blockchains using audit guarantees |
| CN108021821A (en) * | 2017-11-28 | 2018-05-11 | 北京航空航天大学 | Multicenter block chain transaction intimacy protection system and method |
| CN108400872A (en) * | 2018-02-24 | 2018-08-14 | 清华大学 | A kind of block chain information transmission method based on star cooperateed with and system |
-
2018
- 2018-08-23 CN CN201810964031.7A patent/CN109194486A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017112664A1 (en) * | 2015-12-21 | 2017-06-29 | Kochava Inc. | Self regulating transaction system and methods therefor |
| CN105630609A (en) * | 2016-02-24 | 2016-06-01 | 杭州复杂美科技有限公司 | Block chain packing and storing method |
| CN105868369A (en) * | 2016-03-30 | 2016-08-17 | 电子科技大学 | Data model verification system and method based on Merkle tree structure |
| WO2017204943A1 (en) * | 2016-05-24 | 2017-11-30 | Mastercard International Incorporated | Method and system for an efficient consensus mechanism for permissioned blockchains using audit guarantees |
| CN108021821A (en) * | 2017-11-28 | 2018-05-11 | 北京航空航天大学 | Multicenter block chain transaction intimacy protection system and method |
| CN108400872A (en) * | 2018-02-24 | 2018-08-14 | 清华大学 | A kind of block chain information transmission method based on star cooperateed with and system |
Non-Patent Citations (4)
| Title |
|---|
| GUY ZYSKIND; OZ NATHAN: ""Decentralizing Privacy: Using Blockchain to Protect Personal Data"", 《2015 IEEE SECURITY AND PRIVACY WORKSHOPS》 * |
| TIEN TUAN ANH DINH,WANG,: ""BLOCKBENCH: A Framework for Analyzing Private Blockchains"", 《PROCEEDINGS OF THE 2017 ACM INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA》 * |
| 翟社平; 李兆兆; 段宏宇; 高山: "" 区块链关键技术中的数据一致性研究"", 《计算机技术与发展》 * |
| 郝琨; 信俊昌; 黄达; 王国仁: ""去中心化的分布式存储模型"", 《计算机工程与应用》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109936620A (en) * | 2019-01-21 | 2019-06-25 | 中国联合网络通信集团有限公司 | Storage method and device, system and storage medium based on block chain |
| CN109936620B (en) * | 2019-01-21 | 2022-02-01 | 中国联合网络通信集团有限公司 | Block chain-based storage method, device, system and storage medium |
| CN112487492A (en) * | 2019-04-04 | 2021-03-12 | 创新先进技术有限公司 | Data verification method, system and equipment |
| CN112487492B (en) * | 2019-04-04 | 2023-11-17 | 创新先进技术有限公司 | Data verification method, system and equipment |
| CN110110990A (en) * | 2019-04-30 | 2019-08-09 | 德稻全球创新网络（北京）有限公司 | A kind of mobile communication system of interfirm cooperation Project cooperation |
| CN110601857A (en) * | 2019-09-25 | 2019-12-20 | 东北大学 | Data interaction method based on local-global block chain cooperation |
| CN110601857B (en) * | 2019-09-25 | 2021-08-17 | 东北大学 | Data interaction method based on local-global block chain cooperation |
| CN111258508A (en) * | 2020-02-16 | 2020-06-09 | 西安奥卡云数据科技有限公司 | Metadata management method in distributed object storage |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109194486A (en) | Believable cooperation model and data model, metadata storage and co-verification algorithm | |
| CN114079660B (en) | High-performance distributed storage block data, time stamp, cross-chain communication and data collaboration method | |
| Wu et al. | VQL: Efficient and verifiable cloud query services for blockchain systems | |
| Rhea et al. | Pond: The {OceanStore} Prototype | |
| Batten et al. | pStore: A secure peer-to-peer backup system | |
| CN113742782B (en) | Block chain access authority control method based on privacy protection and block chain system | |
| CN107276762B (en) | A kind of working method and device of multi-protocols block chain | |
| Maniatis et al. | Secure history preservation through timeline entanglement | |
| EP3731494A1 (en) | Blockchain maintaining method and apparatus, server, and computer-readable storage medium | |
| CN113438084B (en) | Green power source tracing method and system based on R-PBFT consensus algorithm and timestamp | |
| CN108923932A (en) | A kind of decentralization co-verification model and verification algorithm | |
| CN103442057A (en) | Cloud storage system based on user collaboration cloud | |
| CN110225012B (en) | Method for checking and updating ownership of outsourced data based on alliance chain | |
| CN106156359A (en) | A kind of data synchronization updating method under cloud computing platform | |
| CN110163009B (en) | Method and device for safety verification and repair of HDFS storage platform | |
| CN104580395A (en) | Multi-cloud cooperative storage middleware system based on existing cloud storage platform | |
| CN111783128A (en) | Verifiable distributed database access control method | |
| Mo et al. | Enabling non-repudiable data possession verification in cloud storage systems | |
| CN110691078B (en) | Block chain-based data dynamic reliability verification method | |
| CN111026711A (en) | Block chain based data storage method and device, computer equipment and storage medium | |
| CN110673966A (en) | Data interaction method based on block chain up-link down cooperation | |
| CN103491137A (en) | Data synchronizing system and data synchronizing method | |
| CN111832069B (en) | Multi-block chain on-chain data storage system and method based on cloud computing | |
| Guo et al. | FileDAG: A multi-version decentralized storage network built on DAG-based blockchain | |
| CN113051341A (en) | User data storage system and method based on multiple block chains |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190111 |