Byzantine fault-tolerant consensus method based on quantum key distribution
A quantum key distribution and Byzantine technology, which is applied in the field of Byzantine fault-tolerant consensus based on quantum key distribution, can solve the problems of high network communication complexity and low fault tolerance rate of the consensus mechanism, and achieve reduced communication times, high communication efficiency, and guaranteed The effect of continuity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0141] In order to verify the quantum-safe Byzantine fault-tolerant consensus mechanism proposed in the present invention, the QS-BFT and PBFT consensus mechanisms are simulated and realized by using the Go programming language. In order to ensure the fairness of the test, try to use a similar code structure for QS-BFT and PBFT, and only conduct a consensus on a single transaction for performance testing. And the QS-BFT of the present invention and the classic PBFT consensus mechanism are compared and tested from the four aspects of throughput, delay and fault tolerance, and the impact of transaction submission time on throughput.
[0142] 1. Experiment configuration
[0143] First, the QS-BFT and the PBFT consensus mechanism based on the MH-USS signature scheme (hereinafter referred to as PBFT) are simulated and realized through the Go programming language. Then perform a performance test, and the results are not only related to the consensus mechanism, but also related to t...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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