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

Byzantine fault tolerance optimization method based on aggregate signature and storage medium

A Byzantine and memory pool technology, which is applied in the field of optimized Byzantine fault tolerance methods and storage media based on aggregated signatures.

Inactive Publication Date: 2021-03-19
GUANGDONG UNIV OF TECH
View PDF6 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The main purpose of the present invention is to provide an optimized Byzantine fault tolerance method and storage medium based on aggregated signatures to solve the problem that the current practical Byzantine fault tolerance protocol is not suitable for large-scale node consensus

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

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Byzantine fault tolerance optimization method based on aggregate signature and storage medium
  • Byzantine fault tolerance optimization method based on aggregate signature and storage medium
  • Byzantine fault tolerance optimization method based on aggregate signature and storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0042] Such as figure 1 , 2 As shown in and 3, an optimized Byzantine fault tolerance method (Aggregate-Signature Byzantine Fault Tolerance, ABFT) based on aggregated signatures includes steps:

[0043] S1, Pre-Prepare stage: the master node collects transactions in the transaction memory pool, packs the transactions into blocks and broadcasts them to each replica node for consensus; in step S1, a message broadcast by the master node is a Pre-Prepare message, and the Pre- The Prepare message includes: h stands for the block height, v stands for the view number, d stands for the digest of the block, which is the hash value of the block, and the block is the content of the entire block, including the collected transactions and the signatures of all transactions.

[0044] S2. Prepare stage: After receiving the Pre-Prepare message sent by the master node, all replica nodes will send a Prepare message back to the master node; in step S2, all replica nodes will receive the Pre-Prep...

Embodiment 2

[0057] Such as figure 1 , 2 As shown in , 3 and 4, the BLS signature algorithm is an algorithm that can realize the collection of multiple signatures. It can aggregate all the signatures in the block into one, easy to realize m-n multi-signature, and can also avoid redundant communication between signers . By aggregating signatures, the master node can aggregate the signatures of other nodes, and the replica node can re-verify the merged signature once it receives the information of the master node containing the aggregated signature. Using the BLS signature algorithm can well solve the problem of too high communication complexity of the PBFT algorithm.

[0058] The BLS signature algorithm mainly relies on the function also known as bilinear maps (Bilinear maps), which requires a certain understanding of the pairing function. Here is a brief introduction, define the pairing function e(P,Q), P and Q are two points of a curve (or two different curves), the pairing function sa...

Embodiment 3

[0077] ABFT algorithm implementation scheme of optimized Byzantine fault tolerance method based on aggregate signature:

[0078] In order to verify the efficiency of the improved ABFT algorithm in this paper, the ABFT algorithm is implemented based on the Golang language, and the multi-machine multi-node simulation consensus is used for this experiment. This experiment is performed on a Intel Xeon (Cascade Lake) Platinum8269CY@2.5GHz / 3.2GHz, 32v CPU , 32G memory, and the operating system is CentOS 7.6 64-bit cloud server. The account system uses the same secp256k1 signature scheme as Bitcoin, while the public and private keys and signatures between blockchain nodes use the BLS signature scheme. In the experiment, 1000 transactions are set for each block. In this system, the PBFT algorithm and the ABFT algorithm proposed in this paper are verified, and the PBFT algorithm and the ABFT algorithm are analyzed from the aspects of consensus delay and throughput. Experiments were co...

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 relates to the technical field of block chains, and discloses a Byzantine fault tolerance optimization method based on aggregate signatures and a storage medium, and the method comprisesthe steps: S1, a Pre-Prepreme stage: a main node collects transactions in a transaction memory pool, packages the transactions into blocks, and broadcasts the blocks to all replica nodes for consensus; S2, a Prepare stage: after receiving the Prepare message sent by the main node, all the replica nodes send back a Prepare message to the main node; S3, a Commit stage: the main node verifies each Prepart information, verifies the signature of the replica node, aggregates the signatures passing the verification into a signature through a BLS signature, and broadcasts the aggregated signature andother necessary information to all other replica nodes for verification; and the copy node links the block to the chain tail of the block chain to finish synchronization after verifying that the copynode is correct according to the received Commit message. The problem that an existing Byzantine fault-tolerant protocol is not suitable for large-scale node consensus is solved.

Description

technical field [0001] The invention relates to the technical field of block chains, in particular to an optimized Byzantine fault tolerance method and storage medium based on aggregated signatures. Background technique [0002] In recent years, due to the innovation of the underlying technology of the blockchain and the implementation of some business scenarios, blockchain technology has attracted worldwide attention. According to the degree of openness and application scenarios of the blockchain, it is mainly divided into three categories: Private Blockchain, Public Blockchain, and Consortium Blockchain. A private chain refers to a blockchain whose authority is only within the scope of an organization or institution. It is generally used in a centralized organization. The consensus algorithm of the private chain uses the consensus algorithm in the traditional distributed system. The main representative consensus algorithms are: Paxos, Raft, etc., this type of formula algo...

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): H04L9/32
CPCH04L9/3239H04L9/3247
Inventor 刘文印陈佳伟冼祥斌
Owner GUANGDONG UNIV OF TECH
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