WO2022027531A1 - Procédé et système de construction de chaîne de blocs, et support de stockage, dispositif informatique et application - Google Patents

Procédé et système de construction de chaîne de blocs, et support de stockage, dispositif informatique et application Download PDF

Info

Publication number
WO2022027531A1
WO2022027531A1 PCT/CN2020/107592 CN2020107592W WO2022027531A1 WO 2022027531 A1 WO2022027531 A1 WO 2022027531A1 CN 2020107592 W CN2020107592 W CN 2020107592W WO 2022027531 A1 WO2022027531 A1 WO 2022027531A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
node
blockchain
consensus
round
Prior art date
Application number
PCT/CN2020/107592
Other languages
English (en)
Chinese (zh)
Inventor
李兴华
王运帷
李小强
胡中元
任彦冰
王航
Original Assignee
西安电子科技大学
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 西安电子科技大学 filed Critical 西安电子科技大学
Publication of WO2022027531A1 publication Critical patent/WO2022027531A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/04—Network management architectures or arrangements
    • H04L41/042—Network management architectures or arrangements comprising distributed management centres cooperatively managing the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H04L41/0806—Configuration setting for initial configuration or provisioning, e.g. plug-and-play
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/28—Restricting access to network management systems or functions, e.g. using authorisation function to access network configuration
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/0876—Network architectures or network communication protocols for network security for authentication of entities based on the identity of the terminal or configuration, e.g. MAC address, hardware or software configuration or device fingerprint
    • 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/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • 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/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • 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
    • 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
    • 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/3297—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 time stamps, e.g. generation of time stamps

Definitions

  • the invention belongs to the technical field of blockchain application, and in particular relates to a blockchain construction method, system, storage medium, computer equipment and application.
  • blockchain is a new decentralized infrastructure and distributed computing paradigm that has gradually emerged with the increasing popularity of digital cryptocurrencies such as Bitcoin. of great attention and widespread concern.
  • the consensus protocol is the core of the blockchain database.
  • the existing consensus protocols are mainly divided into two categories: one is the consensus protocol in the public environment, such as POW represented by the Bitcoin blockchain and Ethereum represented by POS, they use the competitive mining resistance mechanism to realize the selection of accounting nodes in an untrusted public network environment.
  • POW represented by the Bitcoin blockchain
  • POS Ethereum represented by POS
  • POS the competitive mining resistance mechanism to realize the selection of accounting nodes in an untrusted public network environment.
  • its consensus efficiency is poor, and it is difficult to meet high real-time and high concurrent data processing services.
  • the other type is consensus protocols in private environments, such as PBFT and Raft, whose core idea is to use a rotating or voting mechanism to achieve the alternation of accounting nodes in a fully trusted environment.
  • PBFT and Raft consensus protocols in private environments
  • PBFT and Raft a rotating or voting mechanism to achieve the alternation of accounting nodes in a fully trusted environment.
  • the existing blockchain consensus protocols are difficult to take into account performance and security, and cannot meet the needs of efficient and secure real-world scenarios. Or provide efficient consensus among fully trusted nodes.
  • the nodes are relatively credible, there is a lack of a consensus protocol that takes both performance and security into consideration.
  • the above-mentioned consensus protocols have high computational energy consumption, low consensus efficiency, and poor robustness and security.
  • the problems and defects of the existing technology are: the current blockchain has a consensus protocol that consumes a lot of energy for calculation, low consensus efficiency, and poor robustness and security.
  • the main defect of the existing consensus protocol is that it is difficult to balance security and efficiency. It is worth noting that compared with the public chain, the performance of the consensus protocol in the private environment is improved by an order of magnitude, which is closer to the goal of the present invention.
  • the existing private chain consensus itself has weak security and is too dependent on the external environment, that is, it needs to be deployed in a completely secure environment, which is difficult to fully satisfy in reality. Therefore, the present invention needs to improve the security of the consensus protocol in the existing private environment, and the key difficulty lies in how to protect its identity while determining a new round of bookkeeping master nodes, and avoid being locked in advance by malicious attacks for damage.
  • the present invention provides a blockchain construction method, system, storage medium, computer equipment and application.
  • a method for constructing a blockchain includes:
  • CA first divides the network into Q domains, and assigns a leader node to each domain to participate in the construction of the blockchain.
  • a node joins the blockchain network , register the identity information at the CA; when a node exits, the CA also needs to cancel its identity information;
  • the billing node of the round randomly selects the billing node of the next round.
  • the initial configuration of the blockchain construction method specifically includes the following steps:
  • Step 1 At the beginning of the establishment of the blockchain, the CA first divides the network into Q domains, and assigns a leader node to participate in the consensus for each domain to participate in the consensus of the blockchain system;
  • Step 2 generate a genesis block, namely Block 0 ;
  • Step 3 When a node joins the blockchain network, firstly register the identity information at the CA and obtain the issued public key certificate as the admission certificate for its participation in the blockchain network; at the same time, it is necessary to specify the domain to which the joining node belongs. ;
  • Step 4 When a node exits, the CA also needs to revoke its public key certificate.
  • the CA first divides the network into Q domains, and assigns a leader node for each domain whose number is from 1 to Q, as follows:
  • CA assigns each node in the network to different domains
  • Each domain selects a master node to communicate with other master nodes in the blockchain network.
  • the generation of the creation block in the step 2 specifically includes:
  • Raft efficient and secure consensus protocol based on a verifiable random function includes the following steps:
  • Step 1 the node decrypts the Nx_P* field of the block, obtains the information proving the packaging node of this round, and determines whether it is a packaging node;
  • Step 2 randomly select the next round of billing node j, and the block generated by node i is Block n ;
  • Step 3 start to generate block Block n , node i broadcasts the generated new block Block n to the rest of the nodes, and then he waits for feedback from other nodes, only if it receives more than one-third of the number of consensus nodes in the entire blockchain network The second is to write the block into the local blockchain;
  • step 4 other nodes verify the block Block n . After the verification is passed, each master node redistributes the verified block Block n to each non-participating consensus node in its management domain.
  • randomly selecting the billing node j of the next round in the second step includes the following steps:
  • VRF_Hash VRF_Hash(Sk, M)
  • Sk the private key
  • the prover calculates the VRF proof P;
  • the block Block n is generated, and the node i broadcasts the generated new block Block n to the rest of the nodes, and then he waits for feedback from other nodes, and only receives more than one-third of the number of consensus nodes in the entire blockchain network.
  • the second is to write the block to the local blockchain, including the following steps:
  • node i broadcasts the generated new block Block n to the rest of the nodes, and then he waits for feedback from other nodes, only if it receives more than two-thirds of the number of consensus nodes in the entire blockchain network Only write the block to the local blockchain;
  • the node receiving Block n first verifies the hash chain relationship before and after, and then verifies whether the signature field Sig in the block header is established;
  • the node After the verification is passed, the node extracts the values Y, P, M, Pk in the Pr_P field in the received block Block n ;
  • the verifier inputs the VRF prover's public key Pk, the message M, and the VRF output random value Y and the proof P are performed verify.
  • the output is False/True. If it is proved that P is generated according to M and Y can be deduced by P, then the verification passes and the output is True; otherwise, the verification fails and the output is False, and it is verified whether Y can be mapped to the current packaging node. If it can be mapped to, the verification is passed. , otherwise the verification fails;
  • the master node After the verification is passed, the master node writes the block into the local blockchain, and each master node redistributes the verified block Block n to each non-participating consensus node in its management domain.
  • the current packaging node feeds back an acceptance message;
  • Another object of the present invention is to provide a computer device, the computer device includes a memory and a processor, the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the following step:
  • CA first divides the network into Q domains, and assigns a leader node to each domain to participate in the construction of the blockchain.
  • a node joins the blockchain network , register the identity information at the CA; when a node exits, the CA also needs to cancel its identity information;
  • the billing node of this round randomly selects the billing node of the next round.
  • Another object of the present invention is to provide a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a processor, causes the processor to perform the following steps:
  • CA first divides the network into Q domains, and assigns a leader node to each domain to participate in the construction of the blockchain.
  • a node joins the blockchain network , register the identity information at the CA; when a node exits, the CA also needs to cancel its identity information;
  • the billing node of the round randomly selects the billing node of the next round.
  • Another object of the present invention is to provide a blockchain construction system for implementing the blockchain construction method, the blockchain construction system comprising:
  • the initial configuration module of the blockchain is used to divide the network into Q domains at the beginning of the establishment of the blockchain.
  • Each domain designates a leader node to participate in the blockchain consensus, and the remaining nodes in the domain passively synchronize the blocks after the leader node consensus. ;
  • the Raft consensus protocol building block is used for the Raft consensus protocol based on a verifiable random function: when a new block is generated in each round, the billing node of the round randomly selects the billing node of the next round.
  • Another object of the present invention is to provide a blockchain system equipped with the blockchain construction system.
  • the CA at the beginning of the establishment of the blockchain, the CA first divides the network into Q domains, and assigns a leader node for each domain to participate in the area.
  • Blockchain consensus When a node joins the blockchain network, the identity information is first registered at the CA. When a node exits, the CA also needs to revoke its identity information.
  • the billing node of the round randomly selects the billing node of the next round. It realizes the efficient and safe selection of blockchain accounting nodes in an incompletely trusted environment.
  • the proposed consensus protocol in the process of random determination of accounting nodes, uses public key encryption to select the identity information of the next round of consensus nodes, which ensures that the confidentiality of the identity of the next round of consensus nodes is avoided from being destroyed in advance, and improves the Security and robustness of consensus protocols. It avoids the problem that the identity of the accounting node based on the sequential rotation mechanism (such as PBFT) and the voting mechanism (such as Raft) consensus protocol is open and vulnerable.
  • PBFT sequential rotation mechanism
  • Raft voting mechanism
  • the proposed consensus method uses a verifiable random function to randomly determine the billing node selection process, which ensures that the next round of billing is not generated by competition, but randomly generated and disclosed by the previous round of billing nodes. Verifiable, thus avoiding the problems of high energy consumption and low consensus efficiency in consensus protocols based on competitive accounting mechanisms (such as classic PoW, PoS consensus mechanisms).
  • the present invention applies the verifiable random function to the blockchain, and realizes that the security and efficiency problems brought by the Raft consensus of the traditional blockchain can be solved with the minimum performance overhead between incompletely trusted nodes.
  • the invention improves the traditional Raft consensus protocol by using a verifiable random function, realizes the efficient and safe selection of billing nodes in the blockchain system in an incompletely trusted environment, and satisfies the need for massive users and high concurrent services to the blockchain system data. Efficient and secure synchronization requirements.
  • FIG. 1 is a flowchart of a blockchain construction method provided by an embodiment of the present invention.
  • FIG. 2 is a schematic structural diagram of a blockchain construction system provided by an embodiment of the present invention.
  • FIG. 3 is an overall architecture diagram of an implementation provided by an embodiment of the present invention.
  • FIG. 4 is a diagram of a Raft consensus protocol based on a verifiable random function implemented by an embodiment of the present invention.
  • FIG. 5 is a structural diagram of a founding block of an implementation provided by an embodiment of the present invention.
  • FIG. 6 is a block chain data structure diagram of an implementation provided by an embodiment of the present invention.
  • FIG. 7 is a sub-flow chart of blockchain initialization provided by an embodiment of the present invention.
  • FIG. 8 is a sub-flow chart of constructing a Raft efficient and secure consensus protocol based on a verifiable random function provided by an embodiment of the present invention.
  • FIG. 9 is a schematic diagram of the relationship between concurrency and time provided by an embodiment of the present invention.
  • FIG. 10 is a schematic diagram of the relationship between the number of nodes and time according to an embodiment of the present invention.
  • the present invention provides a method, system, storage medium, computer equipment and application for building a blockchain.
  • the present invention is described in detail below with reference to the accompanying drawings.
  • the blockchain construction method provided by the present invention includes the following steps:
  • each domain designates a leader node to participate in the blockchain consensus, and the remaining nodes in the domain passively synchronize the blocks after the leader node consensus;
  • S102 Raft consensus protocol based on a verifiable random function: while generating a new block in each round, the billing node of the round randomly selects the billing node of the next round.
  • FIG. 1 The blockchain construction method provided by the present invention in FIG. 1 is only a specific example.
  • the blockchain construction system provided by the present invention includes:
  • Blockchain initial configuration module 1 is used to divide the network into Q domains at the beginning of the establishment of the blockchain, each domain designates a leader node to participate in the blockchain consensus, and the remaining nodes in the domain passively synchronize the area after the leader node consensus piece.
  • Raft consensus protocol building module 2 is used for Raft consensus protocol based on verifiable random function: while generating a new block in each round, the billing node of this round randomly selects the billing node of the next round.
  • Step 1 CA divides the network into Q domains
  • CA assigns each node in the network to different domains, respectively labeled 1 to Q. Each domain selects a master node for communicating with other master nodes in the blockchain network to reach a consensus. The labels of each master node are also 1 to Q, and each master node registers its identity at the CA;
  • Step 2 generate a genesis block (ie Block 0 );
  • R_Hash represents the hash of the previous block, and this field is initially empty in Block 0 .
  • Num represents the number of the current block. In Block 0 , this field is initially numbered 0.
  • the Tamp field represents a timestamp, and in Block 0 , the Tamp field is initially the current timestamp.
  • Cu_Cert represents the public key certificate of the accounting node in this round. In Block 0 , this field is the public key certificate of the CA.
  • the Pr_P field represents the information of the current round of billing nodes, which is initialized to be empty in Block 0 ;
  • P_Hash represents the hash root of the block body, which is filled with the currently calculated hash value in Block 0 ;
  • Nx_P* represents the next The information of the round accounting node.
  • this field is filled with the default value generated by the CA, that is, the information of the next packaging node;
  • Sig represents the signature of the entire block information by the accounting node in this round.
  • this field is The CA's signature for the entire block information.
  • Step 3 when a new node joins the blockchain network, register the identity information at the CA;
  • Step 4 When a node exits, the CA also needs to revoke its identity information
  • the present invention constructs a Raft efficient and secure consensus protocol based on a verifiable random function as follows:
  • Step 1 the node decrypts the Nx_P* field of the block, and obtains the information that proves the packaging node of this round;
  • Step 2 determine whether you are a packaged node, if so, go to Step 3;
  • Step 3 and randomly select the accounting node j of the next round, if the block generated by node i is Block n ;
  • Billing node i in the nth round of consensus will use the following three functions in the verifiable random function:
  • Sk the private key
  • the output of the hash function is randomly distributed in the range of the value range.
  • the hash method is used in the VRF calculation process, and the calculated value is random.
  • the prover calculates the VRF proof P, and outputs the input data M and VRF Y, and the public key Pk of the VRF prover , the VRF proof P is sent to the verifier.
  • Step 4 the consensus node i of the current round of bookkeeping collects the transaction information generated by each consensus node in the current period of time, and starts to generate the block Block n ;
  • Node i first obtains Y n-1 and P n-1 , t, P k in the Nx_P* field in the block header of Block n-1 , and then converts Y n-1 and P n-1 , t, P k Fill in the Pr_P field of Block n . Then it fills its own public key certificate Cert_i into the field Cu_Cert in the block header of Block n , and B fills the calculated Y n * , P n * , t * , and P k into the Nx_P* field in the block n block header. Then use the Merkle tree to calculate the value of P_Hash.
  • Step 5 Node i broadcasts the generated new block Block n to the remaining Q-1 nodes, and then waits for feedback from other nodes, counts the number of received nodes, and only receives more than the consensus in the entire blockchain network. Only two-thirds of the number of nodes write blocks into the local blockchain;
  • Step 6 Receive other nodes of Block n , verify the hash chain relationship before and after, and then verify whether the signature field Sig in the block header is valid to ensure the integrity of the block;
  • Step 7 Obtain Y n-1 and P n-1 , t, P k in the Pr_P field in the block header of Block n , and verify the authenticity of the identity information;
  • the verifier inputs the public key P k of the VRF prover, the message n-1, and the random value Y n-1 and the proof P n-1 output by the VRF for verification.
  • the output is False/True. If it is proved that P n-1 is generated according to n-1 and Y n- 1 can be deduced from P n- 1, the output is True if the verification passes, otherwise the verification fails and the output is False;
  • Step 8 If all the verifications pass, the node sends an acceptance message true to the current packaging node, otherwise it sends a non-acceptance message false and writes the block Block n to the local blockchain.
  • the invention proposes an efficient and secure blockchain construction method based on verifiable random function and Raft.
  • verifiable random function and Raft consensus protocol By combining the verifiable random function and Raft consensus protocol, an efficient and secure blockchain system accounting node is constructed in an incompletely trusted environment.
  • the security selection mechanism solves the problem that the security and efficiency of the traditional blockchain consensus protocol are difficult to balance.
  • the present invention compares the consensus protocol with the traditional classical consensus as shown in Table 1.
  • the consensus protocol of the present invention realizes an efficient and safe selection mechanism for the accounting nodes of the blockchain system in an incompletely trusted environment, and solves the problem that the security and efficiency of the traditional blockchain consensus protocol are difficult to balance.
  • plural means two or more; the terms “upper”, “lower”, “left”, “right”, “inner”, “outer”
  • the orientation or positional relationship indicated by , “front end”, “rear end”, “head”, “tail”, etc. are based on the orientation or positional relationship shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, not An indication or implication that the referred device or element must have a particular orientation, be constructed and operate in a particular orientation, is not to be construed as a limitation of the invention.
  • the terms “first,” “second,” “third,” etc. are used for descriptive purposes only and should not be construed to indicate or imply relative importance.
  • the embodiments of the present invention may be implemented by hardware, software, or a combination of software and hardware.
  • the hardware portion may be implemented using special purpose logic; the software portion may be stored in memory and executed by a suitable instruction execution system, such as a microprocessor or specially designed hardware.
  • a suitable instruction execution system such as a microprocessor or specially designed hardware.
  • Those of ordinary skill in the art will appreciate that the apparatus and methods described above may be implemented using computer-executable instructions and/or embodied in processor control code, for example on a carrier medium such as a disk, CD or DVD-ROM, such as a read-only memory Such code is provided on a programmable memory (firmware) or a data carrier such as an optical or electronic signal carrier.
  • the device of the present invention and its modules can be implemented by hardware circuits such as very large scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, etc., or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., It can also be implemented by software executed by various types of processors, or by a combination of the above-mentioned hardware circuits and software, such as firmware.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Power Engineering (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne un procédé et un système de construction de chaîne de blocs, ainsi qu'un support de stockage, un dispositif informatique et une application. Le procédé comprend : au début de l'établissement de la chaîne de blocs, diviser un réseau en Q domaines, spécifier un nœud de tête pour chaque domaine pour participer au consensus de chaîne de blocs, et les nœuds restants dans le domaine synchronisent passivement un bloc sur lequel un consensus est obtenu par le nœud de tête (S101); et sur la base d'un protocole de consensus Raft d'une fonction aléatoire vérifiable, tout en générant un nouveau bloc dans chaque cycle, un nœud de comptabilité du cycle présent sélectionne de manière aléatoire un nœud de comptabilité du cycle suivant (S102). Dans le processus du consensus, la comptabilité du prochain cycle n'est pas générée au moyen d'une compétition (telle qu'un mécanisme de consensus Pow classique), mais est générée de manière aléatoire par un nœud de comptabilité du cycle précédent et est vérifiable publiquement, de telle sorte que l'efficacité et la sécurité du consensus sont améliorées. Un nœud de comptabilité de chaque cycle change dynamiquement et possède des informations d'identité cachées, de telle sorte que le nœud de comptabilité est empêché d'être attaqué de manière malveillante, et la sécurité et la robustesse d'un système de chaîne de blocs sont assurées.
PCT/CN2020/107592 2020-08-03 2020-08-07 Procédé et système de construction de chaîne de blocs, et support de stockage, dispositif informatique et application WO2022027531A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010769437.7A CN112118124B (zh) 2020-08-03 2020-08-03 区块链构建方法、系统、存储介质、计算机设备及应用
CN202010769437.7 2020-08-03

Publications (1)

Publication Number Publication Date
WO2022027531A1 true WO2022027531A1 (fr) 2022-02-10

Family

ID=73799192

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/107592 WO2022027531A1 (fr) 2020-08-03 2020-08-07 Procédé et système de construction de chaîne de blocs, et support de stockage, dispositif informatique et application

Country Status (2)

Country Link
CN (1) CN112118124B (fr)
WO (1) WO2022027531A1 (fr)

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114650302A (zh) * 2022-03-11 2022-06-21 南京邮电大学 基于区块链的物联网边缘设备可信管理方法
CN114726533A (zh) * 2022-03-23 2022-07-08 扬州大学 基于区块链的边缘计算环境下冗余数据检测和删除的方法
CN114760157A (zh) * 2022-06-16 2022-07-15 天津市城市规划设计研究总院有限公司 城市规划领域区块链节点合法性验证方法及系统
CN114826607A (zh) * 2022-04-02 2022-07-29 中国科学院信息工程研究所 基于区块链的边缘计算节点压缩方法及轻量级存储系统
CN115002221A (zh) * 2022-06-06 2022-09-02 长春理工大学 一种适用于物联网的区块链共识方法及系统
CN115021945A (zh) * 2022-08-08 2022-09-06 四块科技(深圳)有限公司 区块链交易处理方法和系统
CN115065468A (zh) * 2022-07-15 2022-09-16 辽宁工程技术大学 一种基于分组信誉值的pbft共识优化方法
CN115086049A (zh) * 2022-06-21 2022-09-20 天津理工大学 基于可验证延迟函数的区块链医疗数据共享系统及方法
CN115118435A (zh) * 2022-06-29 2022-09-27 河北工业大学 基于双层链的隐私数据保护和授权框架
CN115150246A (zh) * 2022-04-14 2022-10-04 北京邮电大学 基于新型嵌套链架构的面向海量实时物联网的上链方法
CN115499453A (zh) * 2022-06-28 2022-12-20 重庆邮电大学 面向联盟链的分片存储方法
CN115632791A (zh) * 2022-10-12 2023-01-20 南京航空航天大学 一种动态跨链数据一致性去中心化验证方法
CN115664714A (zh) * 2022-09-22 2023-01-31 中国人民解放军国防科技大学 区块链上基于tee的匿名选委员方法、系统及介质
CN115664684A (zh) * 2022-12-27 2023-01-31 湖南工商大学 融合数字证据的共识协议运行方法、装置及相关设备
CN116074328A (zh) * 2023-03-01 2023-05-05 中国信息通信研究院 区块链网络中的区块传输方法、装置、设备和介质
CN116932656A (zh) * 2023-09-18 2023-10-24 中孚安全技术有限公司 基于区块链的数据血缘存储方法、系统、设备及介质
CN117692128A (zh) * 2024-02-02 2024-03-12 波维希数字科技有限公司 三级密链架构

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112600945B (zh) * 2021-03-04 2021-06-04 暗链科技(深圳)有限公司 分布式区块链服务系统及其构建方法、存储介质
CN114281887B (zh) * 2021-04-07 2022-08-05 暗链科技(深圳)有限公司 基于区块分布式区块链的数据保存方法及电子设备
CN112769963B (zh) * 2021-04-07 2021-07-09 暗链科技(深圳)有限公司 基于区块分布式区块链的节点通讯方法及电子设备
CN113672987B (zh) * 2021-09-06 2023-09-05 上海万向区块链股份公司 PoW机制下分组式记账节点的选择方法及系统
CN113965566B (zh) * 2021-10-11 2024-05-14 浪潮云信息技术股份公司 一种基于Header-Sig流的BFT共识算法实现方法及系统
CN114362930A (zh) * 2021-12-09 2022-04-15 重庆海尔制冷电器有限公司 区块链共识方法及计算机可读存储介质
CN114465887B (zh) * 2021-12-23 2024-01-23 杭州溪塔科技有限公司 一种基于git的区块链配置管理方法和装置
CN114938380B (zh) * 2022-06-23 2023-08-22 成都质数斯达克科技有限公司 一种适用于区块链的数据共享系统及方法
CN115314374B (zh) * 2022-07-06 2024-02-06 京东科技信息技术有限公司 区块链节点的部署方法、设备、存储介质及程序产品
CN115361133A (zh) * 2022-08-19 2022-11-18 西安理工大学 安全可扩展的分片区块链构造方法
CN115378715A (zh) * 2022-08-24 2022-11-22 河北中废通网络技术有限公司 一种基于区块链的链式信息加密传递方法、装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108717630A (zh) * 2018-05-19 2018-10-30 上海分布信息科技有限公司 一种出块方法及其实现系统
CN109726229A (zh) * 2018-11-30 2019-05-07 深圳市元征科技股份有限公司 一种区块链数据存储方法及装置
US20190158470A1 (en) * 2016-04-29 2019-05-23 nChain Holdings Limited Operating system for blockchain iot devices
CN111476548A (zh) * 2020-04-16 2020-07-31 山东师范大学 一种基于区块链的职称评审方法及系统

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107528886B (zh) * 2017-07-25 2020-07-31 中国科学院计算技术研究所 区块链全网拆分方法与系统
WO2019090342A1 (fr) * 2017-11-06 2019-05-09 Velo Holdings Limited Système de chaîne de blocs
CN109698753B (zh) * 2018-12-17 2022-05-03 成都四方伟业软件股份有限公司 基于区块链的上链共识算法匹配方法及装置
CN109714447B (zh) * 2018-12-20 2021-09-10 全链通有限公司 基于区块链域名系统的域名生成方法和系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190158470A1 (en) * 2016-04-29 2019-05-23 nChain Holdings Limited Operating system for blockchain iot devices
CN108717630A (zh) * 2018-05-19 2018-10-30 上海分布信息科技有限公司 一种出块方法及其实现系统
CN109726229A (zh) * 2018-11-30 2019-05-07 深圳市元征科技股份有限公司 一种区块链数据存储方法及装置
CN111476548A (zh) * 2020-04-16 2020-07-31 山东师范大学 一种基于区块链的职称评审方法及系统

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LI YAN, MA HAIYING;WANG ZHANJU: "Research Progress on Key Technologies of Blockchain", COMPUTER ENGINEERING AND APPLICATIONS, HUABEI JISUAN JISHU YANJIUSUO, CN, vol. 55, no. 20, 23 August 2019 (2019-08-23), CN , XP055895282, ISSN: 1002-8331, DOI: 10.3778/j.issn.1002-8331.1906-0013 *
XUE TENGFEI: "Research on Several Issues in Blockchain Applications", CHINA MASTER’S THESES FULL-TEXT DATABASE, 15 August 2019 (2019-08-15), XP055895286, ISBN: 978-7-111-60788-5 *

Cited By (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114650302B (zh) * 2022-03-11 2024-03-12 南京邮电大学 基于区块链的物联网边缘设备可信管理方法
CN114650302A (zh) * 2022-03-11 2022-06-21 南京邮电大学 基于区块链的物联网边缘设备可信管理方法
CN114726533A (zh) * 2022-03-23 2022-07-08 扬州大学 基于区块链的边缘计算环境下冗余数据检测和删除的方法
CN114726533B (zh) * 2022-03-23 2023-12-01 扬州大学 基于区块链的边缘计算环境下冗余数据检测和删除的方法
CN114826607A (zh) * 2022-04-02 2022-07-29 中国科学院信息工程研究所 基于区块链的边缘计算节点压缩方法及轻量级存储系统
CN114826607B (zh) * 2022-04-02 2024-04-19 中国科学院信息工程研究所 基于区块链的边缘计算节点压缩方法及轻量级存储系统
CN115150246A (zh) * 2022-04-14 2022-10-04 北京邮电大学 基于新型嵌套链架构的面向海量实时物联网的上链方法
CN115150246B (zh) * 2022-04-14 2023-06-30 北京邮电大学 基于新型嵌套链架构的面向海量实时物联网的上链方法
CN115002221A (zh) * 2022-06-06 2022-09-02 长春理工大学 一种适用于物联网的区块链共识方法及系统
CN115002221B (zh) * 2022-06-06 2023-06-23 长春理工大学 一种适用于物联网的区块链共识方法及系统
CN114760157B (zh) * 2022-06-16 2022-09-16 天津市城市规划设计研究总院有限公司 城市规划领域区块链节点合法性验证方法及系统
CN114760157A (zh) * 2022-06-16 2022-07-15 天津市城市规划设计研究总院有限公司 城市规划领域区块链节点合法性验证方法及系统
CN115086049B (zh) * 2022-06-21 2023-09-08 天津理工大学 基于可验证延迟函数的区块链医疗数据共享系统及方法
CN115086049A (zh) * 2022-06-21 2022-09-20 天津理工大学 基于可验证延迟函数的区块链医疗数据共享系统及方法
CN115499453A (zh) * 2022-06-28 2022-12-20 重庆邮电大学 面向联盟链的分片存储方法
CN115499453B (zh) * 2022-06-28 2024-03-12 重庆邮电大学 面向联盟链的分片存储方法
CN115118435B (zh) * 2022-06-29 2024-03-22 河北工业大学 基于双层链的隐私数据保护和授权框架
CN115118435A (zh) * 2022-06-29 2022-09-27 河北工业大学 基于双层链的隐私数据保护和授权框架
CN115065468B (zh) * 2022-07-15 2024-04-30 辽宁工程技术大学 一种基于分组信誉值的pbft共识优化方法
CN115065468A (zh) * 2022-07-15 2022-09-16 辽宁工程技术大学 一种基于分组信誉值的pbft共识优化方法
CN115021945A (zh) * 2022-08-08 2022-09-06 四块科技(深圳)有限公司 区块链交易处理方法和系统
CN115021945B (zh) * 2022-08-08 2022-11-08 四块科技(深圳)有限公司 区块链交易处理方法和系统
CN115664714B (zh) * 2022-09-22 2024-05-14 中国人民解放军国防科技大学 区块链上基于tee的匿名选委员方法、系统及介质
CN115664714A (zh) * 2022-09-22 2023-01-31 中国人民解放军国防科技大学 区块链上基于tee的匿名选委员方法、系统及介质
CN115632791B (zh) * 2022-10-12 2024-03-19 南京航空航天大学 一种动态跨链数据一致性去中心化验证方法
CN115632791A (zh) * 2022-10-12 2023-01-20 南京航空航天大学 一种动态跨链数据一致性去中心化验证方法
CN115664684B (zh) * 2022-12-27 2023-04-18 湖南工商大学 融合数字证据的共识协议运行方法、装置及相关设备
CN115664684A (zh) * 2022-12-27 2023-01-31 湖南工商大学 融合数字证据的共识协议运行方法、装置及相关设备
CN116074328B (zh) * 2023-03-01 2023-06-27 中国信息通信研究院 区块链网络中的区块传输方法、装置、设备和介质
CN116074328A (zh) * 2023-03-01 2023-05-05 中国信息通信研究院 区块链网络中的区块传输方法、装置、设备和介质
CN116932656B (zh) * 2023-09-18 2024-01-09 中孚安全技术有限公司 基于区块链的数据血缘存储方法、系统、设备及介质
CN116932656A (zh) * 2023-09-18 2023-10-24 中孚安全技术有限公司 基于区块链的数据血缘存储方法、系统、设备及介质
CN117692128A (zh) * 2024-02-02 2024-03-12 波维希数字科技有限公司 三级密链架构
CN117692128B (zh) * 2024-02-02 2024-04-16 波维希数字科技有限公司 一种三级密链系统

Also Published As

Publication number Publication date
CN112118124B (zh) 2022-05-03
CN112118124A (zh) 2020-12-22

Similar Documents

Publication Publication Date Title
WO2022027531A1 (fr) Procédé et système de construction de chaîne de blocs, et support de stockage, dispositif informatique et application
JP7289298B2 (ja) 低エントロピーパスワードを用いてブロックチェーントランザクションを許可するためのコンピュータ実装されたシステム及び方法
US11050762B2 (en) High throughput secure multi-party computation with identifiable abort
WO2021258549A1 (fr) Procédés de signature et de vérification de signature adaptés à une ligne d'assemblage, dispositif, et support d'enregistrement
CN113079132B (zh) 海量物联网设备认证方法、存储介质、信息数据处理终端
CN113301022A (zh) 基于区块链和雾计算的物联网设备身份安全认证方法
CN110910139A (zh) 基于区块链的可信硬件与高性能去中心化匿名加密的算法
WO2021150238A1 (fr) Attestation à distance
CN114463009B (zh) 一种用于提高大规模能源节点交易安全性的方法
Wu et al. Distributed Timestamp Mechanism Based on Verifiable Delay Functions.
CN116346357A (zh) 一种基于区块链的跨队列数据访问的身份认证方法
Meng et al. Fast secure and anonymous key agreement against bad randomness for cloud computing
Irshad et al. A low-cost privacy preserving user access in mobile edge computing framework
Xie et al. A novel blockchain-based and proxy-oriented public audit scheme for low performance terminal devices
Wang et al. Lightweight zero-knowledge authentication scheme for IoT embedded devices
Li et al. An efficient certificateless aggregate signature scheme designed for VANET
JP2002529778A (ja) 共有無作為性の分散暗号化への組み込み
US20220138005A1 (en) Distributed computing system and method of operation thereof
CN116170144B (zh) 智能电网匿名认证方法、电子设备及存储介质
CN112231731A (zh) 松散耦合的区块链交易方法和区块链节点
Sakho et al. Privacy protection issues in blockchain technology
US11977930B2 (en) Distributed computer system using correctness proof for partial evaluations in determining consensus
Jiang et al. Security Analysis of “SMAKA: Secure Many-to-Many Authentication and Key Agreement Scheme for Vehicular Networks”
Duan et al. Lightweight key management system for inter-node communication in IoT
CN114026586A (zh) 用于授予对加密资产的访问权的零知识或有支付协议

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20948349

Country of ref document: EP

Kind code of ref document: A1