Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Block chain shared data protection method

A technology of sharing data and blockchain, applied in the field of blockchain, can solve the problems of multiple verification times, low efficiency, long time, etc.

Pending Publication Date: 2020-05-12
辽宁振兴银行股份有限公司
View PDF14 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The conventional method is to separately verify each transaction on the chain separately. When this conventional method requires batch verification, the number of verifications is large, the time is long, and the efficiency is low. Therefore, those skilled in the art provide a block A protection method for chain shared data to solve the problems raised in the above-mentioned background technology

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0048] Assuming 4 transactions: [A, a', a], [B, b', b], [C, c', c], [D, d', d], the 4 transactions [A, a' , a], [B, b', b], [C, c', c], [D, d', d] are extracted from the same field, and A, B, C, D, a', b are obtained ', c', d' and a, b, c, d three sets of data; A, B, C, D are combined to generate a verification code matrix [A, B, C, D], and a', b', c' and d' are merged to generate the verification code two [a', b', c', d'] matrix, and a, b, c, d are combined to generate the verification code three matrix [a, b, c, d]; yes [A, B, C, D], [a', b', c', d'], [a, b, c, d] three verification code matrices are verified as follows in turn:

[0049] A ----------- send a'------------a;

[0050] B------------send b'------------b;

[0051] C ----------- send c'------------c;

[0052] D ----------- send d'------------d;

[0053] [Verification code matrix 1] [Verification code matrix 2] [Verification code matrix 3].

[0054] After verification, set N=hash[A, a', a], N is only known by ...

Embodiment 2

[0058] Suppose 7 transactions: [A, a', a], [B, b', b], [C, c', c], [D, d', d], [E, e', e], [F, f', f] [G, g', g], will 7 transactions [A, a', a], [B, b', b], [C, c', c], [D , d', d], [E, e', e], [F, f', f] [G, g', g] are extracted from the same field, and A, B, C, D, E, F, G, a', b', c', d', e', f', g' and a, b, c, d, e, f, g three sets of data; A, B, C, D , E, F, G are combined to generate a verification code matrix [A, B, C, D, E, F, G], and a', b', c', d', e', f', g' are combined Generate verification code two [a', b', c', d', e', f', g'] matrix, combine a, b, c, d, e, f, g to generate verification code three matrix [a , b, c, d, e, f, g]; for [A, B, C, D, E, F, G], [a', b', c', d', e', f', g'], [a, b, c, d, e, f, g] three verification code matrices are verified as follows in turn:

[0059] A ----------- send a'------------a;

[0060] B------------send b'------------b;

[0061] C ----------- send c'------------c;

[0062] D ----------- send d'------------d;

[0063]...

Embodiment 3

[0071] Suppose 10 transactions: [A, a', a], [B, b', b], [C, c', c], [D, d', d], [E, e', e], [F, f', f] [G, g', g], [H, h', h], [I, i', i], [J, j', j], among the 10 transactions [ A, a', a], [B, b', b], [C, c', c], [D, d', d], [E, e', e], [F, f', f] [G, g', g], [H, h', h], [I, i', i], [J, j', j] are extracted from the same fields to get A, B, C , D, E, F, G, H, I, J, a', b', c', d', e', f', g', h', i', j' and a, b, c , d, e, f, g, h, i, j three sets of data; A, B, C, D, E, F, G, H, I, J are combined to generate a verification code matrix [A, B, C, D, E, F, G, H, I, J], combine a', b', c', d', e', f', g', h', i', j' to generate verification Code two [a', b', c', d', e', f', g', h', i', j'] matrix, a, b, c, d, e, f, g, h, i, j are combined to generate three verification code matrixes [a, b, c, d, e, f, g, h, i, j]; for [A, B, C, D, E, F, G, H , I, J], [a', b', c', d', e', f', g', h', i', j'], [a, b, c, d, e, f , g, h, i, j] the three verification code matrices are verified ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a block chain shared data protection method, which relates to the technical field of block chains, and comprises the following steps of: extracting the same fields in a plurality of transactions: combining the same fields to obtain a verification code matrix I, a verification code matrix II and a verification code matrix III; verifying the verification code matrix I, the verification code matrix II and the verification code matrix III; and extracting fields of the same transaction from the verified certificate code matrix I, the verified verification code matrix II andthe verified verification code matrix III, and forming a transaction code matrix. According to the scheme, the information in the same transaction is split and packaged and verified together with thesame split information in other multiple transactions, so that the transaction efficiency is not influenced, and the number of transactions needing to be verified can be reduced under the condition ofmore transactions; in addition, the verifier does not know which part of the same transaction is split under the condition that the hash of the complete transaction of the transaction party does notexist, so that the privacy protection of the transaction information can be improved.

Description

technical field [0001] The invention relates to the technical field of block chains, in particular to a protection method for block chain shared data. Background technique [0002] At present, most of the on-chain data on the blockchain adopts the transaction hash instead of plaintext to protect the privacy of the on-chain data. The on-chain plaintext is not conducive to the protection of the transaction privacy data of both parties, and the on-chain hash does not store data in essence. On the blockchain network, it is also impossible to realize the data sharing and control sharing permissions on the chain, but only to verify the data. Moreover, the conventional transaction verification is a separate horizontal verification one by one, and the transactions are not related to each other; while the scheme is to integrate multiple transactions into vertical verification, and the transactions are related to each other. For example: suppose multiple transactions are initiated, an...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q20/38G06F21/64
CPCG06Q20/382G06F21/64
Inventor 李杰
Owner 辽宁振兴银行股份有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com