Results 11 to 20 of about 1,046 (174)

Grouped Multilayer Practical Byzantine Fault Tolerance Algorithm: A Practical Byzantine Fault Tolerance Consensus Algorithm Optimized for Digital Asset Trading Scenarios [PDF]

Sensors, 2023
Based on the practical Byzantine fault tolerance algorithm (PBFT), a grouped multilayer PBFT consensus algorithm (GM-PBFT) is proposed to be applied to digital asset transactions in view of the problems with excessive communication complexity and low ...
Jian Liu, Wenlong Feng, Mengxing Huang, Siling Feng, Yu Zhang   +4 more
doaj   +2 more sources

Improving Trust in a (Trans)National Invoicing System: The Performance of Crash vs. Byzantine Fault Tolerance at Scale

Applied Sciences, 2023
Crash fault tolerance describes the capability of a distributed system to maintain its proper function despite the occurrence of crashes or failures in one or more of its components.
Jonas S. Søgaard, Peter W. Eklund, Lasse Herskind, Jason Spasovski   +3 more
doaj   +3 more sources

A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network

IEEE Access, 2023
The consortium chain is the main form of application of blockchain technology in the actual industry, and its consensus mechanism mostly adopts the practical Byzantine fault tolerance (PBFT) algorithm.
Wangxi Jiang, Xiaoxiong Wu, Mingyang Song, Jiwei Qin, Zhenhong Jia   +4 more
doaj   +3 more sources

Enhancing healthcare consensus mechanism - A reputation integrated variant of PBFT (BR-PBFT). [PDF]

PLoS ONE
In the rapidly evolving healthcare landscape, adopting blockchain technology requires an optimal consensus mechanism to ensure security, efficiency, reliability, and scalability. This paper examines various consensus methods, including PoW (Proof of Work)
Shamsudeen Sajna, Manu J Pillai, Ginu Rajan   +2 more
doaj   +2 more sources

SelectVote Byzantine Fault Tolerance for Evidence Custody: Virtual Voting Consensus with Environmental Compensation [PDF]

Sensors
Digital evidence custody requires consensus protocols that guarantee immediate and deterministic finality. Legal admissibility depends on proof that no party can alter or delay confirmation of evidence transfers.
Belinda I. Onyeashie, Petra Leimich, Sean McKeown, Gordon Russell   +3 more
doaj   +2 more sources

Application-Aware Byzantine Fault Tolerance [PDF]

2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing, 2014
Byzantine fault tolerance has been intensively studied over the past decade as a way to enhance the intrusion resilience of computer systems. However, state-machine-based Byzantine fault tolerance algorithms require deterministic application processing and sequential execution of totally ordered requests.
Wenbing Zhao
exaly   +2 more sources

Forensic Support for Abraham et al.’s BB Protocol [PDF]

Entropy
The consensus protocol is a fundamental building block in distributed computing and has been widely used in blockchain systems in recent years. Paxos, introduced by Lamport, stands out as one of the most widely adopted consensus protocols and has found ...
Qidi You, Hongjian Yang, Xiyong Zhang, Xiaotong Jiang, Kaiwen Guo, Kexin Hu   +5 more
doaj   +2 more sources

Egalitarian Byzantine Fault Tolerance [PDF]

2021 IEEE 26th Pacific Rim International Symposium on Dependable Computing (PRDC), 2021
Minimizing end-to-end latency in geo-replicated systems usually makes it necessary to compromise on resilience, resource efficiency, or throughput performance, because existing approaches either tolerate only crashes, require additional replicas, or rely on a global leader for consensus.
Michael Eischer, Tobias Distler
openaire   +2 more sources

Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication [PDF]

2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), 2021
Byzantine fault tolerant (BFT) state machine replication (SMR) is an important building block for constructing permissioned blockchain systems. In contrast to Nakamoto Consensus where any block obtains higher assurance as buried deeper in the blockchain, in BFT SMR, any committed block is secure has a fixed resilience threshold.
Zhuolun Xiang, Dahlia Malkhi, Kartik Nayak, Ling Ren 0001   +3 more
openaire   +2 more sources

Research Advance on BFT Consensus Algorithms [PDF]

Jisuanji kexue, 2022
Since the advent of Bitcoin in 2008, blockchain has gradually become a research hotspot in academia.As the key technology of blockchain, consensus algorithm has also attracted more attention from researchers.It's easy to introduce Byzantine fault nodes ...
FENG Liao-liao, DING Yan, LIU Kun-lin, MA Ke-lin, CHANG Jun-sheng
doaj   +1 more source