CN117692128B

CN117692128B - Three-stage chain sealing system

Info

Publication number: CN117692128B
Application number: CN202410150733.7A
Authority: CN
Inventors: 刘鑫宇
Original assignee: Bovis Digital Technology Co ltd
Current assignee: Bovis Digital Technology Co ltd
Priority date: 2024-02-02
Filing date: 2024-02-02
Publication date: 2024-04-16
Anticipated expiration: 2044-02-02
Also published as: CN117692128A

Abstract

The invention discloses a three-level secret chain system, which comprises a server, a user pool and nodes, wherein the server, the user pool and the nodes are all provided with a plurality of nodes; the server is used for organizing work, communication among the servers is subjected to hash encryption, organizing list information is abstracted into account book information, and the account book information is time stamped and stored in the server; the server is also used for calling the user pool user and distributing the accounting task to the extracted nodes; the node for obtaining task accounting is used for completing the task of storing the account book, marking the node belongs to the organization list after the time stamp is added and hash encryption is carried out. The invention can transfer the calculation force of a large amount of personal nodes consumed in the original architecture to the server for calculation, saves the calculation force of the personal node synchronous account book, and can prevent different attack modes including 51 attack, thereby ensuring the safety.

Description

Three-stage chain sealing system

Technical Field

The invention relates to the technical field of blockchain, in particular to a three-level dense chain system.

Background

As shown in fig. 1 and fig. 2, in the existing blockchain technology, the security of data assets is ensured by a distributed account book storage mode, and an accounting person obtains the accounting qualification based on the efficiency of decoding hash by calculation force, although the account book is stored in a distributed mode and accounts are checked among nodes, the security of a block can be improved to a certain extent, an attacker can still obtain account book information in a node intrusion mode, and when the account book authority of a certain directional transaction is mastered to exceed 51%, the attacker can still tamper the account book information.

Moreover, the existing block technology occupies a large amount of calculation power, extremely pursues the architecture thought of conscious morphological decentralization, excludes the powerful calculation capability of the centralization server, and results in low calculation efficiency.

Disclosure of Invention

The invention aims to provide a three-level dense-chain system which can transfer the calculation force of a large number of personal nodes consumed in an original framework to a server for calculation, save the calculation force of a personal node synchronous account book and prevent different attack modes including 51 attack, thereby ensuring the safety.

In order to achieve the above purpose, the technical scheme adopted by the invention is as follows:

The three-level dense-chain system comprises a server, a user pool and nodes, wherein the server, the user pool and the nodes are all provided with a plurality of nodes;

The server is used for organizing work, communication among the servers is subjected to hash encryption, organization list information is abstracted into account information, a timestamp is added, and the account information is stored in the server; the server is also used for calling the user pool user and distributing the accounting task to the extracted nodes;

the node for obtaining task accounting is used for completing the task of storing the account book, marking the node belongs to the organization list after the time stamp is added and hash encryption is carried out.

Further, when the server calls the node account book, after decoding the list through the server with the organized list and the organizing authority, the billing node is informed to check, and after checking, the billing node presents the result information to the server.

Further, after the accounting node returns to the user pool, each node in the user pool synchronizes account information.

Preferably, the information transmitted between the servers includes partial organization information or partial organization information fragments, and the organization list is obtained after decoding by at least two servers.

Preferably, the decimation is a random decimation.

Preferably, the server with the organization authority is a server randomly designated through a discrete algorithm after the server obtains the organization list.

Preferably, the server does not have the right to modify the result after the accounting node finishes accounting.

The beneficial effects of the invention are as follows:

1. the invention can transfer a large amount of personal node calculation force consumed in the original architecture to the server for calculation, for example, the consensus calculation is saved, and the calculation force of the personal node synchronous account book is saved.

2. The server can obtain a complete organization list only after the organization rights are decoded by a plurality of servers, and the attack object is prevented from being positioned by an attacker in the way.

3. After the server obtains the complete organization list, a server is randomly designated to obtain the organization rights through a discrete algorithm, and the attacker cannot obtain the organization rights through managing rights and executing rights cutting of the list.

4. The server can only obtain the result information after the node checks the account, but does not modify the authority of the result after the node completes the check, so that an attacker cannot modify the result from an intermediate link.

5. The account book information is transferred in a user pool of the user participating in the account book, and the users are grouped through the user pool, so that the purpose of crossing accounts is achieved, and an attacker cannot lock the account book position.

6. The middle layer of the user pool exists, so that an attacker needs to attack all servers and all user pools to acquire all node information, but key generation rules of different server nodes and user pools are different even running environments, and the difficulty of attack all servers and all user pools is greatly increased.

Drawings

FIG. 1 is a node relationship diagram of a prior art manner of acquiring billing qualifications based on computational power.

Fig. 2 is a schematic diagram of an information transfer rule of a hash decoding by calculation in the prior art.

Fig. 3 is a schematic diagram of the present invention.

Fig. 4 is a diagram of the user pool ledger synchronization of the present invention.

Detailed Description

The present invention will be described in further detail with reference to the accompanying drawings, in order to make the objects, technical solutions and advantages of the present invention more apparent.

As shown in FIG. 3, the three-level closed-chain system disclosed by the invention comprises a server, a user pool and nodes, wherein the server, the user pool and the nodes are all provided with a plurality of.

Wherein: the servers are responsible for organizing work, communication among the servers is subjected to hash encryption, organizing list information is abstracted into account book information, and the account book information is directly stored in a server node after being time stamped.

The server has authority to invoke different user pool users and assign billing tasks to the extracted nodes.

Each node obtaining the task completes the task of storing the account book, marks the time stamp, carries out hash encryption and acknowledges that the node belongs to the list.

When the server needs to call the node account book, the server with the organized list and the organizing authority informs the accounting node to check after decoding the list, and after checking the account, the node presents the result information to the server.

In particular, the server can obtain the complete organization list only after the organization rights are decoded by a plurality of servers. After the server obtains the complete organization list, a server is randomly designated to obtain the organization authority through a discrete algorithm. The server can only obtain the result information after accounting by the accounting node, and does not modify the authority of the result after accounting by the node.

As shown in FIG. 4, after the accounting node returns to the user pool, each node in the user pool may synchronize ledger information. The pool of non-participating users need not be synchronized.

The invention combines the calculation power of the server into the calculation network while pursuing the decentralization thought, but the decentralization server only carries out organization work, and the accounting and checking actions are still distributed in the nodes, so that the decentralization design thought is still satisfied.

The prior blockchain technology screens a plurality of nodes with accounting qualification through calculation force to account, the invention randomly extracts a plurality of user nodes from a plurality of user pools through a server to account, and the design can endow the server with organization information, so that the accounting nodes do not need to acquire qualification through calculation force, thereby greatly saving calculation force on a chain. The design can ensure that when an attacker attacks the nodes, the attacker cannot acquire organization information, so that other nodes participating in accounting cannot be found, an attack object cannot be locked, and when the attacker attacks the server, the attacker cannot acquire the organization information but cannot lock specific transaction information, thereby realizing the aim of greatly improving the calculation efficiency under the decentralization design thought, preventing different types of attack modes including 51 attacks, and further ensuring the security.

Of course, the present invention is capable of other various embodiments and its several details are capable of modification and variation in light of the present invention by one skilled in the art without departing from the spirit and scope of the invention as defined in the appended claims.

Claims

1. A three-stage chain sealing system, characterized in that: the system comprises a server, a user pool and nodes, wherein the server, the user pool and the nodes are all provided with a plurality of servers;

The node for obtaining task accounting is used for completing the task of storing the account book, carrying out hash encryption after adding a time stamp, and marking the node as belonging to the organization list;

the information transmitted between the servers comprises partial organization information or partial organization information fragments, and the organization list is obtained after decoding by at least two servers;

the server with the organization authority is a server which is randomly designated through a discrete algorithm after the server obtains an organization list;

the server does not have the right to modify the results after accounting nodes complete accounting.

2. A three-level chain seal system according to claim 1, wherein: when the server calls the node account book, the server with the organization list and the organization authority decodes the list, notifies the accounting node to check, and the accounting node presents the result information to the server after checking.

3. A three-stage chain seal system according to claim 1 or 2, characterized in that: after the accounting node returns to the user pool, each node in the user pool synchronizes account information.

4. A three-level chain seal system according to claim 1, wherein: the extraction is random extraction.