Blockchain node member allocation method and device, and computer readable storage medium

Abstract

The application discloses a blockchain node member allocation method and device and a computer readable storage medium. A blockchain node member allocation request is received. The blockchain node member allocation request comprises a node member allocation model, an original block and a corresponding block identifier, original block nodes contained in the original block and corresponding node identifiers, and original node members contained in the original block nodes and corresponding member identifiers. A corresponding relationship between blocks, block nodes and node members after re-allocation is determined according to the node member allocation model, the block identifier corresponding to the original block, the node identifier corresponding to the original block node, and the member identifier corresponding to the original node member. The block nodes corresponding to the blocks and the node members corresponding to the block nodes are re-allocated according to the corresponding relationship. The difficulty of destroying or attacking the blocks and the nodes is increased, thereby improving the security of the data stored on the blockchain.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of blockchains, and in particular to a blockchain node member allocation method and device and a computer readable storage medium. BACKGROUND

[0002] In a conventional blockchain service, one block usually corresponds to multiple block nodes, and one block node corresponds to multiple block members. In order to facilitate maintenance, the block and its corresponding block node and the block node and its corresponding block member are usually one-to-one corresponding. However, when the block or the block node is destroyed or invaded, the block member is easily penetrated by data or the member data is stolen. This will bring a disaster to the block or the block node, and the data on the blockchain will be seriously threatened. SUMMARY

[0003] The technical problem to be solved by the present application is to provide a blockchain node member allocation method, device and computer readable storage medium, which can improve the security of data stored on the blockchain.

[0004] To solve the above technical problems, the present application adopts a technical scheme:

[0005] A blockchain node member allocation method, comprising the steps of:

[0006] receiving a blockchain node member allocation request, the blockchain node member allocation request comprising a node member allocation model, an original block and a corresponding block identifier, an original block node contained in the original block and a corresponding node identifier, and an original node member contained in the original block node and a corresponding member identifier;

[0007] determining the corresponding relationship between the re-allocated block, block node and node member according to the node member allocation model, the block identifier corresponding to the original block, the node identifier corresponding to the original block node, and the member identifier corresponding to the original node member;

[0008] re-allocating the block node corresponding to the block and the node member corresponding to the block node according to the corresponding relationship.

[0009] Further, the step of receiving the blockchain node member allocation request further comprises the step of:

[0010] allocating a node member allocation model for the block, and establishing corresponding identifiers for the original block, the original block node corresponding to the original block, and the original node member corresponding to the original block node.

[0011] Further, the node member allocation model can be dynamically configured.

[0012] Further, the blockchain node member allocation request is received before each operation of the blockchain.

[0013] Further, the re-allocation of the block nodes corresponding to the blocks and the node members corresponding to the block nodes according to the correspondence includes:

[0014] According to the correspondence, the structure between the blocks, the block nodes and the node members is broken.

[0015] Further, the method further comprises the steps of:

[0016] A block connection request is received, and each block after the re-allocation is traversed according to the block connection request.

[0017] It is determined whether each block exists and whether each block and the block node corresponding to the block and each block node and the node member corresponding to the block node are connected.

[0018] Further, the determination of whether each block and the block node corresponding to the block and each block node and the node member corresponding to the block node are connected includes:

[0019] A first link is established between each block and the block node corresponding to the block, and it is determined whether the first link is smooth.

[0020] A second link is established between each block node and the node member corresponding to the block node, and it is determined whether the second link is smooth.

[0021] To solve the above technical problems, another technical solution adopted by the present application is:

[0022] A blockchain node member allocation device comprises a memory, a processor and a computer program stored in the memory and executable on the processor, and the processor executes the computer program to realize the steps of the above-mentioned blockchain node member allocation method.

[0023] To solve the above technical problems, another technical solution adopted by the present application is:

[0024] A computer readable storage medium having computer program instructions stored thereon, wherein the computer program instructions are executed by a processor to realize the steps of the above-mentioned blockchain node member allocation method.

[0025] The beneficial effects of the present application are that when the blockchain node member allocation is performed, the node member allocation model is set, the corresponding block identifier of the original block is set, the corresponding node identifier of the original block node contained in the original block is set, and the corresponding member identifier of the original node member contained in the original block node is set, and the corresponding relationship between the re-allocated blocks, block nodes and block members is determined accordingly, so as to realize the recombination and arrangement of each block on the blockchain, the block nodes contained in each block and the node members contained in each block node, increase the difficulty of the block and its nodes being destroyed or attacked, and improve the security of the data stored on the blockchain. BRIEF DESCRIPTION OF DRAWINGS

[0026] Figure 1 A step flow chart of a blockchain node member allocation method according to an embodiment of the present application;

[0027] Figure 2 A structural schematic diagram of a blockchain node member allocation device according to an embodiment of the present application;

[0028] Figure 3 A corresponding relationship diagram between blocks, block nodes and node members in a blockchain node member allocation method according to an embodiment of the present application;

[0029] Figure 4 Another structural schematic diagram of a blockchain node member allocation device according to an embodiment of the present application. DETAILED DESCRIPTION

[0030] To explain the technical content, purposes and effects of the present application in detail, the following will be described in combination with the embodiments and the accompanying drawings.

[0031] The above-mentioned blockchain node member allocation method, device and computer readable storage medium can be applied to the application scenarios of blockchain data encryption, data protection and the like, and the following will be described through specific embodiments.

[0032] In an optional embodiment, as shown in Figure 1 A blockchain node member allocation method, comprising the steps of:

[0033] S1, receiving a blockchain node member allocation request, wherein the blockchain node member allocation request comprises a node member allocation model, an original block and a corresponding block identifier thereof, an original block node contained in the original block and a corresponding node identifier thereof, and an original node member contained in the original block node and a corresponding member identifier thereof;

[0034] Wherein, each block can comprise a plurality of block nodes, and each block node can comprise a plurality of node members.

[0035] S2, determining the corresponding relationship between the re-allocated block, block node and node member according to the node member allocation model, the block identifier corresponding to the original block, the node identifier corresponding to the original block node and the member identifier corresponding to the original node member;

[0036] S3, re-allocating the block node corresponding to the block and the node member corresponding to the block node according to the corresponding relationship.

[0037] In another optional implementation, the receiving of the block chain node member allocation request further comprises the following steps:

[0038] A node member allocation model is allocated for a block, and corresponding identifiers are established for the original block, the original block node corresponding to the original block and the original node member corresponding to the original block node.

[0039] The node member allocation model can be a matrix formula, including matrix addition, subtraction, multiplication and division, and permutation relationship, etc. Figure 3 As shown in the figure, an identifier C is established for a block, an identifier A is established for a node block, an identifier B is established for a node member, and a matrix formula C=A+B is set. As long as the block, block node and node member satisfy the above relationship, they represent that they have a corresponding relationship, that is, A belongs to block C, and B belongs to block node A. For example, C=[c1 c2], A=[a1 a2], B=[b1 b2] are set. If c1=a1+b1 and c2=a2+b2 are satisfied, there is a corresponding relationship between C, A and B. If there is also E=[e1 e2] and F=[f1 f2], and c1=e1+f1 and c2=e2+f2 are also satisfied, there is also a corresponding relationship between C, E and F.

[0040] Or set C=A-B. As long as the block, block node and node member satisfy the above relationship, they represent that they have a corresponding relationship. Of course, other matrix relationships can also be set, such as C=A*B or C=A*B-B / A.

[0041] Or a permutation relationship can be set, that is, the node members originally contained in two block nodes are permuted, for example:

[0042] Block C1 has nodes: A1 A2 A3 A4 A5

[0043] Block C2 has nodes: AA1 AA2

[0044] If reconstruction occurs according to the formula at this time, then:

[0045] The nodes of block C1 become: A1 A2 AA1 AA2 A4 A5

[0046] Block C2 node becomes: A2 A3;

[0047] In this kind of node member distribution model, it does not affect the structure, only affects the constituent members of the node;

[0048] For example:

[0049] Original configuration:

[0050] Block: C1; Block node: A1 A2; Node member: A1B1 A1B2 A2B1A2B2;

[0051] Block: C2; Block node: AA AB; Node member: AAB1 AAB2 ABB1 ABB2;

[0052] That is, the original corresponding relationship is:

[0053] C1A1B1; C1A1B2; C1A2B1; C1A2B2

[0054] C2AAB1; C2AAB2; C2ABB1; C2ABB2

[0055] After re-distribution, the corresponding relationship becomes:

[0056] C2A1B1; C2A1B2; C1A2B1; C1A2B2

[0057] C1AAB1; C2AAB2; C1ABB1; C2ABB2.

[0058] Among them, the node member distribution model can be dynamically configured, that is, the node member distribution model can be dynamically changed with each running of the block chain, not fixed, which further improves the difficulty of cracking.

[0059] In this embodiment, by setting the node member distribution model in advance, and setting the corresponding identification for the block, block node and block member, the random allocation of the block chain node can be flexibly and conveniently carried out, the difficulty of cracking is greatly improved, and the node member distribution model is dynamically configurable, further improving the data security.

[0060] In another optional embodiment, the block chain node member distribution request is received before each running of the block chain.

[0061] In this embodiment, the timing of performing block chain node member distribution is further clarified, that is, the block / node is re-allocated and encrypted at runtime, which is determined at runtime and does not change at any time and any place, that is, it changes once each time, which can facilitate the normal operation of the block chain.

[0062] In another optional implementation, the reassigning the block nodes corresponding to the blocks and the node members corresponding to the block nodes according to the correspondence includes:

[0063] breaking the structure between the blocks, the block nodes and the node members according to the correspondence;

[0064] That is, the structure between the blocks, the block nodes and the node members is broken by the reassigning the correspondence between the blocks, the block nodes and the node members, and they are no longer in the original correspondence, and the correspondence can be realized across blocks and across block nodes, thereby greatly improving the protection capability of the blockchain data.

[0065] In another optional implementation, the method further includes the steps of:

[0066] receiving a block connection request, and traversing the re-assigned blocks according to the block connection request;

[0067] judging whether each block exists and whether each block and its corresponding block node and each block node and its corresponding node member are connected.

[0068] The judging whether each block and its corresponding block node and each block node and its corresponding node member are connected includes:

[0069] establishing a first link between each block and its corresponding block node, and judging whether the first link is smooth;

[0070] establishing a second link between each block node and its corresponding node member, and judging whether the second link is smooth.

[0071] In the embodiment, after the reassigning the blockchain node members, the connectivity between the blocks, the block nodes and the node members on the blockchain is further determined, and it can be known whether the block exists by traversing the block and its link, and the purpose is to prevent useless blocks from existing useful nodes or missing random encryption allocation problems.

[0072] In another optional implementation, as shown in Figure 2 A blockchain node member allocation device includes a memory, a processor and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the blockchain node member allocation method of any one of the above embodiments when executing the computer program.

[0073] When implemented, as shown in Figure 4 A plurality of module devices can be provided to implement the corresponding method steps:

[0074] The server has all the blocks and the corresponding block nodes and the data information of the node members corresponding to the block nodes, and links the block information to the processing device for processing;

[0075] The processing device is used for processing the blocks-block nodes-node members provided by the server;

[0076] A node member allocation model is allocated for the blocks, and an identifier is established for the blocks, the block nodes and the node members respectively, so as to re-allocate the blocks and the corresponding block nodes, and the block nodes and the corresponding node members, build the corresponding relationship therebetween, and send the corresponding relationship to the allocation device;

[0077] The allocation device is used for breaking the corresponding relationship among the blocks, the block nodes and the node members based on the corresponding relationship, and re-building the structure of the blocks and the block nodes, and the structure of the block nodes and the node members;

[0078] The communication device is used for traversing the blocks, communicating the existing blocks, communicating the existing block nodes and communicating the existing node members, so as to ensure the communication among the blocks, the block nodes and the node members after re-allocation.

[0079] In another optional embodiment, a computer readable storage medium has computer program instructions stored thereon, and the computer program instructions are executed by a processor to implement the steps of the block chain node member allocation method in any one of the above embodiments.

[0080] In summary, the block chain node member allocation method, device and computer readable storage medium provided by the application can change the structure relationship among the blocks, the block nodes and the node members by setting a dynamically configurable node member allocation model and setting the corresponding block identifier for the original blocks, the corresponding node identifier for the original block nodes contained in the original blocks and the corresponding member identifier for the original node members contained in the original block nodes, so as to determine the corresponding relationship among the blocks, the block nodes and the node members after re-allocation, realize the random breaking of the relationship among the three, and realize the recombination and arrangement of each block and the block nodes contained in the block and the node members contained in each block node on the block chain, so as to increase the difficulty of destroying or attacking the blocks and the nodes, improve the security of the data stored on the block chain, and further determine the communication of the blocks, the block nodes and the node members after the random breaking of the corresponding relationship, so as to ensure the reliability of the operation of the block chain, and realize the safe and reliable operation of the data on the block chain.

[0081] The above merely illustrates the embodiments of the present application, and is not intended to limit the patent scope of the present application. Any equivalent transformation or direct or indirect application in the related technical field based on the content of the present application specification and drawings is also included in the patent protection scope of the present application.

Claims

1. A method for assigning blockchain node members, characterized in that, The method comprises the steps of: receiving a blockchain node member allocation request, the blockchain node member allocation request comprising a node member allocation model, an original block and a corresponding block identifier, an original block node contained in the original block and a corresponding node identifier, and an original node member contained in the original block node and a corresponding member identifier; determining a corresponding relationship between the original block, the original block node, and the original node member according to the node member allocation model, the block identifier corresponding to the original block, the node identifier corresponding to the original block node, and the member identifier corresponding to the original node member; redistributing the block nodes corresponding to the blocks and the node members corresponding to the block nodes according to the corresponding relationship; the node member allocation model is a matrix formula; the node member allocation model can be dynamically configured. 2.The method of claim 1, wherein, Before the step of receiving the blockchain node member allocation request, the method further comprises the steps of: allocating a node member allocation model to a block, and establishing corresponding identifiers for the original block, the original block node corresponding to the original block, and the original node member corresponding to the original block node. 3.The method of any one of claims 1-2, wherein, The blockchain node member allocation request is received before each run of the blockchain.

4. The method of claim 1 or 2, wherein, The step of redistributing the block nodes corresponding to the blocks and the node members corresponding to the block nodes according to the corresponding relationship comprises: breaking the structure between the blocks, the block nodes, and the node members according to the corresponding relationship. 5.The method of claim 1 or 2, wherein, The method further comprises the steps of: receiving a block connectivity request, and traversing the redistributed blocks according to the block connectivity request; judging whether each block exists, and whether each block and the block node corresponding thereto, and each block node and the node member corresponding thereto are connected.

6. The method of claim 5, wherein, The step of judging whether each block and the block node corresponding thereto, and each block node and the node member corresponding thereto are connected comprises: establishing a first link between each block and the block node corresponding thereto, and judging whether the first link is unobstructed; establishing a second link between each block node and the node member corresponding thereto, and judging whether the second link is unobstructed. 7.A blockchain node member allocation apparatus, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, The computer program is executed by the processor to implement the steps of the blockchain node member allocation method according to any one of claims 1 to 6.

8. A computer-readable storage medium having stored thereon computer program instructions, wherein, The computer program instructions are executed by the processor to implement the steps of the blockchain node member allocation method according to any one of claims 1 to 6.

Images