Results 31 to 40 of about 1,046 (174)
Dynamic reputation–based consensus mechanism: Real-time transactions for energy blockchain
The energy blockchain is a distributed Internet protocol for energy transactions between nodes in power systems. The consensus algorithm is the core component of the energy blockchain and has an essential impact on its application.
Wenjun Cai +5 more
doaj +1 more source
The Practical Byzantine Fault Tolerant (PBFT) consensus algorithm has many advantages, which makes PBFT utilized widely. Nonetheless, PBFT is not suitable for large-scale node scenarios due to its high communication complexity and it also has an apparent
Yanhe Na +4 more
doaj +1 more source
Quantum Secured-Byzantine Fault Tolerance Blockchain Consensus Mechanism [PDF]
Aiming at the problem that the classical blockchain consensus mechanism is under the threat of quantum computing attacks,a quantum-secured Byzantine fault tolerant consensus mechanism is proposed.Firstly,to solve the security threat of public key digital
REN Chang, ZHAO Hong, JIANG Hua
doaj +1 more source
Byzantine fault tolerance of regenerating codes [PDF]
In The 11th IEEE International Conference on Peer-to-Peer Computing (P2P 2011)
Frédérique E. Oggier, Anwitaman Datta
openaire +3 more sources
Challenges of PBFT-Inspired Consensus for Blockchain and Enhancements over Neo dBFT
Consensus mechanisms are a core feature for handling negotiation and agreements. Blockchain technology has seen the introduction of different sorts of consensus mechanism, ranging from tasks of heavy computation to the subtle mathematical proofs of ...
Igor M. Coelho +4 more
doaj +1 more source
FP‐BFT: A fast pipeline Byzantine consensus algorithm
The Byzantine Fault Tolerant (BFT) consensus algorithms have been widely applied in the blockchain systems because of their fault tolerance capability to determine system consistency in the presence of malicious nodes.
Xinlei Liu +4 more
doaj +1 more source
Multi-Threshold Byzantine Fault Tolerance
Classic Byzantine fault tolerant (BFT) protocols are designed for a specific timing model, most often one of the following: synchronous, asynchronous or partially synchronous. It is well known that the timing model and fault tolerance threshold present inherent trade-offs. Synchronous protocols tolerate up to n/2 Byzantine faults, while asynchronous or
Momose, Atsuki, Ren, Ling
openaire +2 more sources
On the Practicality of Practical Byzantine Fault Tolerance [PDF]
Byzantine Fault Tolerant (BFT) systems are considered by the systems research community to be state of the art with regards to providing reliability in distributed systems. BFT systems provide safety and liveness guarantees with reasonable assumptions, amongst a set of nodes where at most f nodes display arbitrarily incorrect behaviors, known as ...
Nikos Chondros +2 more
openaire +4 more sources
An improved PBFT consensus algorithm based on grouping and credit grading
To improve the blockchain consensus algorithm practical Byzantine fault tolerance (PBFT) with random master node selection, which has high communication overhead and a small supported network size, this paper proposes a Byzantine fault tolerant consensus
Shannan Liu +4 more
doaj +1 more source
Improved Fault-Tolerant Consensus Based on the PBFT Algorithm
Nowadays Practical Byzantine Fault Tolerance (PBFT) algorithm has become the most extensive consensus algorithm in the alliance chain. However, the PBFT algorithm is usually only applicable to small networks due to high communication complexity and poor ...
Jian Yang +4 more
doaj +1 more source

